/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_7.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-abd8500 [2020-01-16 18:59:03,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-01-16 18:59:03,327 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-01-16 18:59:03,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-01-16 18:59:03,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-01-16 18:59:03,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-01-16 18:59:03,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-01-16 18:59:03,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-01-16 18:59:03,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-01-16 18:59:03,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-01-16 18:59:03,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-01-16 18:59:03,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-01-16 18:59:03,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-01-16 18:59:03,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-01-16 18:59:03,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-01-16 18:59:03,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-01-16 18:59:03,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-01-16 18:59:03,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-01-16 18:59:03,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-01-16 18:59:03,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-01-16 18:59:03,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-01-16 18:59:03,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-01-16 18:59:03,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-01-16 18:59:03,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-01-16 18:59:03,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-01-16 18:59:03,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-01-16 18:59:03,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-01-16 18:59:03,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-01-16 18:59:03,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-01-16 18:59:03,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-01-16 18:59:03,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-01-16 18:59:03,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-01-16 18:59:03,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-01-16 18:59:03,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-01-16 18:59:03,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-01-16 18:59:03,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-01-16 18:59:03,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-01-16 18:59:03,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-01-16 18:59:03,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-01-16 18:59:03,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-01-16 18:59:03,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-01-16 18:59:03,412 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2020-01-16 18:59:03,429 INFO L113 SettingsManager]: Loading preferences was successful [2020-01-16 18:59:03,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-01-16 18:59:03,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-01-16 18:59:03,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-01-16 18:59:03,431 INFO L138 SettingsManager]: * Use SBE=true [2020-01-16 18:59:03,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-01-16 18:59:03,431 INFO L138 SettingsManager]: * sizeof long=4 [2020-01-16 18:59:03,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-01-16 18:59:03,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-01-16 18:59:03,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-01-16 18:59:03,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-01-16 18:59:03,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-01-16 18:59:03,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-01-16 18:59:03,433 INFO L138 SettingsManager]: * sizeof long double=12 [2020-01-16 18:59:03,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-01-16 18:59:03,433 INFO L138 SettingsManager]: * Use constant arrays=true [2020-01-16 18:59:03,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-01-16 18:59:03,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-01-16 18:59:03,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-01-16 18:59:03,434 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-01-16 18:59:03,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-01-16 18:59:03,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-01-16 18:59:03,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-01-16 18:59:03,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-01-16 18:59:03,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-01-16 18:59:03,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-01-16 18:59:03,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-01-16 18:59:03,435 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-01-16 18:59:03,435 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-01-16 18:59:03,436 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-01-16 18:59:03,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-01-16 18:59:03,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-01-16 18:59:03,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-01-16 18:59:03,769 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-01-16 18:59:03,770 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-01-16 18:59:03,771 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_7.bpl [2020-01-16 18:59:03,772 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_7.bpl' [2020-01-16 18:59:03,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-01-16 18:59:03,818 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-01-16 18:59:03,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-01-16 18:59:03,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-01-16 18:59:03,819 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-01-16 18:59:03,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:59:03" (1/1) ... [2020-01-16 18:59:03,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:59:03" (1/1) ... [2020-01-16 18:59:03,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-01-16 18:59:03,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-01-16 18:59:03,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-01-16 18:59:03,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-01-16 18:59:03,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:59:03" (1/1) ... [2020-01-16 18:59:03,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:59:03" (1/1) ... [2020-01-16 18:59:03,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:59:03" (1/1) ... [2020-01-16 18:59:03,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:59:03" (1/1) ... [2020-01-16 18:59:03,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:59:03" (1/1) ... [2020-01-16 18:59:03,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:59:03" (1/1) ... [2020-01-16 18:59:03,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:59:03" (1/1) ... [2020-01-16 18:59:03,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-01-16 18:59:03,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-01-16 18:59:03,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-01-16 18:59:03,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-01-16 18:59:03,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:59:03" (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-01-16 18:59:03,960 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-01-16 18:59:03,961 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-01-16 18:59:03,962 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-01-16 18:59:03,963 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-01-16 18:59:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-01-16 18:59:03,963 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-01-16 18:59:03,963 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-01-16 18:59:03,964 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-01-16 18:59:03,964 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-01-16 18:59:03,964 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-01-16 18:59:03,964 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-01-16 18:59:03,964 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-01-16 18:59:03,964 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-01-16 18:59:03,965 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-01-16 18:59:03,965 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-01-16 18:59:03,965 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-01-16 18:59:03,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-01-16 18:59:03,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-01-16 18:59:03,966 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-01-16 18:59:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-01-16 18:59:03,966 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-01-16 18:59:03,966 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_6 given in one single declaration [2020-01-16 18:59:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure set_6 [2020-01-16 18:59:03,967 INFO L138 BoogieDeclarations]: Found implementation of procedure set_6 [2020-01-16 18:59:03,968 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-01-16 18:59:04,255 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-01-16 18:59:04,255 INFO L287 CfgBuilder]: Removed 0 assume(true) statements. [2020-01-16 18:59:04,257 INFO L202 PluginConnector]: Adding new model example_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.01 06:59:04 BoogieIcfgContainer [2020-01-16 18:59:04,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-01-16 18:59:04,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-01-16 18:59:04,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-01-16 18:59:04,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-01-16 18:59:04,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:59:03" (1/2) ... [2020-01-16 18:59:04,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b74ef27 and model type example_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.01 06:59:04, skipping insertion in model container [2020-01-16 18:59:04,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.01 06:59:04" (2/2) ... [2020-01-16 18:59:04,278 INFO L109 eAbstractionObserver]: Analyzing ICFG example_7.bpl [2020-01-16 18:59:04,289 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-01-16 18:59:04,290 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-01-16 18:59:04,297 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-01-16 18:59:04,298 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-01-16 18:59:04,451 INFO L250 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-01-16 18:59:04,472 INFO L374 AbstractCegarLoop]: Interprodecural is true [2020-01-16 18:59:04,472 INFO L375 AbstractCegarLoop]: Hoare is true [2020-01-16 18:59:04,472 INFO L376 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-01-16 18:59:04,473 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-01-16 18:59:04,473 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-01-16 18:59:04,473 INFO L379 AbstractCegarLoop]: Difference is false [2020-01-16 18:59:04,473 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-01-16 18:59:04,473 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-01-16 18:59:04,488 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 80 transitions [2020-01-16 18:59:04,490 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 60 places, 80 transitions [2020-01-16 18:59:04,721 INFO L129 PetriNetUnfolder]: 321/472 cut-off events. [2020-01-16 18:59:04,743 INFO L130 PetriNetUnfolder]: For 448/448 co-relation queries the response was YES. [2020-01-16 18:59:04,765 INFO L76 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 472 events. 321/472 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1550 event pairs. 0/471 useless extension candidates. Maximal degree in co-relation 416. Up to 140 conditions per place. [2020-01-16 18:59:04,777 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 60 places, 80 transitions [2020-01-16 18:59:04,892 INFO L129 PetriNetUnfolder]: 321/472 cut-off events. [2020-01-16 18:59:04,892 INFO L130 PetriNetUnfolder]: For 448/448 co-relation queries the response was YES. [2020-01-16 18:59:04,897 INFO L76 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 472 events. 321/472 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1550 event pairs. 0/471 useless extension candidates. Maximal degree in co-relation 416. Up to 140 conditions per place. [2020-01-16 18:59:04,906 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1260 [2020-01-16 18:59:04,907 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-01-16 18:59:05,055 INFO L206 etLargeBlockEncoding]: Checked pairs total: 357 [2020-01-16 18:59:05,055 INFO L214 etLargeBlockEncoding]: Total number of compositions: 8 [2020-01-16 18:59:05,058 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 72 transitions [2020-01-16 18:59:05,287 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2316 states. [2020-01-16 18:59:05,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states. [2020-01-16 18:59:05,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:05,361 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:05,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, 1, 1, 1] [2020-01-16 18:59:05,363 INFO L426 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:05,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:05,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1886146014, now seen corresponding path program 1 times [2020-01-16 18:59:05,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:05,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873400122] [2020-01-16 18:59:05,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:05,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873400122] [2020-01-16 18:59:05,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:05,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:59:05,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63210992] [2020-01-16 18:59:05,590 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:59:05,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:05,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:59:05,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:59:05,611 INFO L87 Difference]: Start difference. First operand 2316 states. Second operand 3 states. [2020-01-16 18:59:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:05,682 INFO L93 Difference]: Finished difference Result 1820 states and 7856 transitions. [2020-01-16 18:59:05,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:59:05,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-01-16 18:59:05,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:05,734 INFO L225 Difference]: With dead ends: 1820 [2020-01-16 18:59:05,735 INFO L226 Difference]: Without dead ends: 1819 [2020-01-16 18:59:05,737 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-01-16 18:59:05,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2020-01-16 18:59:05,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1819. [2020-01-16 18:59:05,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1819 states. [2020-01-16 18:59:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 7855 transitions. [2020-01-16 18:59:05,928 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 7855 transitions. Word has length 22 [2020-01-16 18:59:05,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:05,930 INFO L478 AbstractCegarLoop]: Abstraction has 1819 states and 7855 transitions. [2020-01-16 18:59:05,930 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:59:05,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 7855 transitions. [2020-01-16 18:59:05,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:05,939 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:05,939 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:05,939 INFO L426 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:05,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:05,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1634401592, now seen corresponding path program 1 times [2020-01-16 18:59:05,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:05,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952391958] [2020-01-16 18:59:05,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:05,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-01-16 18:59:05,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952391958] [2020-01-16 18:59:05,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:05,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:59:05,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455077734] [2020-01-16 18:59:05,991 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:59:05,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:05,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:59:05,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:59:05,993 INFO L87 Difference]: Start difference. First operand 1819 states and 7855 transitions. Second operand 3 states. [2020-01-16 18:59:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:06,028 INFO L93 Difference]: Finished difference Result 1275 states and 5199 transitions. [2020-01-16 18:59:06,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:59:06,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-01-16 18:59:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:06,043 INFO L225 Difference]: With dead ends: 1275 [2020-01-16 18:59:06,043 INFO L226 Difference]: Without dead ends: 1275 [2020-01-16 18:59:06,044 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-01-16 18:59:06,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2020-01-16 18:59:06,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1275. [2020-01-16 18:59:06,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2020-01-16 18:59:06,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 5199 transitions. [2020-01-16 18:59:06,101 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 5199 transitions. Word has length 22 [2020-01-16 18:59:06,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:06,101 INFO L478 AbstractCegarLoop]: Abstraction has 1275 states and 5199 transitions. [2020-01-16 18:59:06,101 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:59:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 5199 transitions. [2020-01-16 18:59:06,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:06,107 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:06,107 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:06,107 INFO L426 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:06,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:06,108 INFO L82 PathProgramCache]: Analyzing trace with hash -488840274, now seen corresponding path program 1 times [2020-01-16 18:59:06,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:06,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868723249] [2020-01-16 18:59:06,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:06,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-01-16 18:59:06,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868723249] [2020-01-16 18:59:06,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:06,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:59:06,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927701239] [2020-01-16 18:59:06,135 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:59:06,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:06,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:59:06,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:59:06,136 INFO L87 Difference]: Start difference. First operand 1275 states and 5199 transitions. Second operand 3 states. [2020-01-16 18:59:06,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:06,175 INFO L93 Difference]: Finished difference Result 847 states and 3331 transitions. [2020-01-16 18:59:06,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:59:06,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-01-16 18:59:06,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:06,185 INFO L225 Difference]: With dead ends: 847 [2020-01-16 18:59:06,186 INFO L226 Difference]: Without dead ends: 847 [2020-01-16 18:59:06,187 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-01-16 18:59:06,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2020-01-16 18:59:06,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2020-01-16 18:59:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2020-01-16 18:59:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 3331 transitions. [2020-01-16 18:59:06,232 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 3331 transitions. Word has length 22 [2020-01-16 18:59:06,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:06,233 INFO L478 AbstractCegarLoop]: Abstraction has 847 states and 3331 transitions. [2020-01-16 18:59:06,233 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:59:06,233 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 3331 transitions. [2020-01-16 18:59:06,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:06,237 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:06,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, 1, 1, 1] [2020-01-16 18:59:06,237 INFO L426 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:06,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:06,238 INFO L82 PathProgramCache]: Analyzing trace with hash 625763952, now seen corresponding path program 1 times [2020-01-16 18:59:06,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:06,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102270178] [2020-01-16 18:59:06,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:06,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-01-16 18:59:06,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102270178] [2020-01-16 18:59:06,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:06,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:59:06,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055031812] [2020-01-16 18:59:06,312 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:59:06,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:06,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:59:06,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:59:06,313 INFO L87 Difference]: Start difference. First operand 847 states and 3331 transitions. Second operand 3 states. [2020-01-16 18:59:06,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:06,332 INFO L93 Difference]: Finished difference Result 575 states and 2209 transitions. [2020-01-16 18:59:06,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:59:06,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-01-16 18:59:06,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:06,375 INFO L225 Difference]: With dead ends: 575 [2020-01-16 18:59:06,375 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 18:59:06,375 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-01-16 18:59:06,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 18:59:06,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2020-01-16 18:59:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2020-01-16 18:59:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 2209 transitions. [2020-01-16 18:59:06,398 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 2209 transitions. Word has length 22 [2020-01-16 18:59:06,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:06,398 INFO L478 AbstractCegarLoop]: Abstraction has 575 states and 2209 transitions. [2020-01-16 18:59:06,399 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:59:06,399 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 2209 transitions. [2020-01-16 18:59:06,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:06,402 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:06,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, 1, 1, 1] [2020-01-16 18:59:06,402 INFO L426 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:06,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:06,403 INFO L82 PathProgramCache]: Analyzing trace with hash 625764882, now seen corresponding path program 1 times [2020-01-16 18:59:06,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:06,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603413245] [2020-01-16 18:59:06,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:06,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-01-16 18:59:06,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603413245] [2020-01-16 18:59:06,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:06,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:06,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467773674] [2020-01-16 18:59:06,985 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:06,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:06,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:06,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:06,986 INFO L87 Difference]: Start difference. First operand 575 states and 2209 transitions. Second operand 9 states. [2020-01-16 18:59:07,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:07,106 INFO L93 Difference]: Finished difference Result 908 states and 3017 transitions. [2020-01-16 18:59:07,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:07,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:07,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:07,114 INFO L225 Difference]: With dead ends: 908 [2020-01-16 18:59:07,114 INFO L226 Difference]: Without dead ends: 884 [2020-01-16 18:59:07,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:07,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2020-01-16 18:59:07,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 588. [2020-01-16 18:59:07,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-01-16 18:59:07,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 2250 transitions. [2020-01-16 18:59:07,144 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 2250 transitions. Word has length 22 [2020-01-16 18:59:07,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:07,144 INFO L478 AbstractCegarLoop]: Abstraction has 588 states and 2250 transitions. [2020-01-16 18:59:07,145 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 2250 transitions. [2020-01-16 18:59:07,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:07,147 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:07,147 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:07,147 INFO L426 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:07,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:07,148 INFO L82 PathProgramCache]: Analyzing trace with hash -2078936528, now seen corresponding path program 2 times [2020-01-16 18:59:07,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:07,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132945084] [2020-01-16 18:59:07,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:07,538 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2020-01-16 18:59:07,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-01-16 18:59:07,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132945084] [2020-01-16 18:59:07,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:07,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:07,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702766710] [2020-01-16 18:59:07,642 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:07,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:07,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:07,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:07,644 INFO L87 Difference]: Start difference. First operand 588 states and 2250 transitions. Second operand 9 states. [2020-01-16 18:59:07,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:07,777 INFO L93 Difference]: Finished difference Result 900 states and 2993 transitions. [2020-01-16 18:59:07,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:07,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:07,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:07,785 INFO L225 Difference]: With dead ends: 900 [2020-01-16 18:59:07,785 INFO L226 Difference]: Without dead ends: 879 [2020-01-16 18:59:07,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:07,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2020-01-16 18:59:07,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 583. [2020-01-16 18:59:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2020-01-16 18:59:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 2238 transitions. [2020-01-16 18:59:07,833 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 2238 transitions. Word has length 22 [2020-01-16 18:59:07,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:07,833 INFO L478 AbstractCegarLoop]: Abstraction has 583 states and 2238 transitions. [2020-01-16 18:59:07,834 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:07,834 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 2238 transitions. [2020-01-16 18:59:07,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:07,837 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:07,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, 1, 1, 1] [2020-01-16 18:59:07,838 INFO L426 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:07,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:07,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1978315202, now seen corresponding path program 3 times [2020-01-16 18:59:07,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:07,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956602212] [2020-01-16 18:59:07,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:08,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956602212] [2020-01-16 18:59:08,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:08,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:08,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382755694] [2020-01-16 18:59:08,357 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:08,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:08,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:08,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:08,357 INFO L87 Difference]: Start difference. First operand 583 states and 2238 transitions. Second operand 9 states. [2020-01-16 18:59:08,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:08,458 INFO L93 Difference]: Finished difference Result 908 states and 3014 transitions. [2020-01-16 18:59:08,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:08,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:08,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:08,465 INFO L225 Difference]: With dead ends: 908 [2020-01-16 18:59:08,465 INFO L226 Difference]: Without dead ends: 884 [2020-01-16 18:59:08,466 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:08,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2020-01-16 18:59:08,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 588. [2020-01-16 18:59:08,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-01-16 18:59:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 2247 transitions. [2020-01-16 18:59:08,494 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 2247 transitions. Word has length 22 [2020-01-16 18:59:08,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:08,495 INFO L478 AbstractCegarLoop]: Abstraction has 588 states and 2247 transitions. [2020-01-16 18:59:08,495 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 2247 transitions. [2020-01-16 18:59:08,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:08,497 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:08,497 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:08,498 INFO L426 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:08,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:08,498 INFO L82 PathProgramCache]: Analyzing trace with hash 684254128, now seen corresponding path program 1 times [2020-01-16 18:59:08,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:08,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363689934] [2020-01-16 18:59:08,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:08,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-01-16 18:59:08,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363689934] [2020-01-16 18:59:08,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:08,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:59:08,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300112937] [2020-01-16 18:59:08,520 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:59:08,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:08,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:59:08,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:59:08,521 INFO L87 Difference]: Start difference. First operand 588 states and 2247 transitions. Second operand 3 states. [2020-01-16 18:59:08,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:08,527 INFO L93 Difference]: Finished difference Result 522 states and 1921 transitions. [2020-01-16 18:59:08,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:59:08,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-01-16 18:59:08,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:08,532 INFO L225 Difference]: With dead ends: 522 [2020-01-16 18:59:08,532 INFO L226 Difference]: Without dead ends: 522 [2020-01-16 18:59:08,533 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-01-16 18:59:08,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-01-16 18:59:08,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2020-01-16 18:59:08,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2020-01-16 18:59:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1921 transitions. [2020-01-16 18:59:08,553 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1921 transitions. Word has length 22 [2020-01-16 18:59:08,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:08,554 INFO L478 AbstractCegarLoop]: Abstraction has 522 states and 1921 transitions. [2020-01-16 18:59:08,554 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:59:08,554 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1921 transitions. [2020-01-16 18:59:08,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:08,558 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:08,558 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:08,558 INFO L426 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:08,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:08,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1999772210, now seen corresponding path program 1 times [2020-01-16 18:59:08,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:08,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333123551] [2020-01-16 18:59:08,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:08,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333123551] [2020-01-16 18:59:08,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:08,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:59:08,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804167482] [2020-01-16 18:59:08,576 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:59:08,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:08,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:59:08,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:59:08,577 INFO L87 Difference]: Start difference. First operand 522 states and 1921 transitions. Second operand 3 states. [2020-01-16 18:59:08,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:08,582 INFO L93 Difference]: Finished difference Result 392 states and 1373 transitions. [2020-01-16 18:59:08,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:59:08,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-01-16 18:59:08,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:08,586 INFO L225 Difference]: With dead ends: 392 [2020-01-16 18:59:08,586 INFO L226 Difference]: Without dead ends: 392 [2020-01-16 18:59:08,586 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-01-16 18:59:08,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2020-01-16 18:59:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2020-01-16 18:59:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 18:59:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1373 transitions. [2020-01-16 18:59:08,601 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1373 transitions. Word has length 22 [2020-01-16 18:59:08,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:08,602 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1373 transitions. [2020-01-16 18:59:08,602 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:59:08,602 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1373 transitions. [2020-01-16 18:59:08,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:08,604 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:08,604 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:08,604 INFO L426 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:08,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:08,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1755583602, now seen corresponding path program 4 times [2020-01-16 18:59:08,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:08,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064473254] [2020-01-16 18:59:08,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:09,069 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-01-16 18:59:09,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-01-16 18:59:09,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064473254] [2020-01-16 18:59:09,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:09,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:09,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115378469] [2020-01-16 18:59:09,077 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:09,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:09,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:09,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:09,078 INFO L87 Difference]: Start difference. First operand 392 states and 1373 transitions. Second operand 9 states. [2020-01-16 18:59:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:09,194 INFO L93 Difference]: Finished difference Result 593 states and 1773 transitions. [2020-01-16 18:59:09,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:09,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:09,199 INFO L225 Difference]: With dead ends: 593 [2020-01-16 18:59:09,199 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 18:59:09,200 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:09,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 18:59:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 390. [2020-01-16 18:59:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 18:59:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1369 transitions. [2020-01-16 18:59:09,221 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1369 transitions. Word has length 22 [2020-01-16 18:59:09,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:09,222 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1369 transitions. [2020-01-16 18:59:09,222 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1369 transitions. [2020-01-16 18:59:09,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:09,224 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:09,224 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:09,224 INFO L426 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:09,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:09,225 INFO L82 PathProgramCache]: Analyzing trace with hash 784024996, now seen corresponding path program 5 times [2020-01-16 18:59:09,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:09,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641207089] [2020-01-16 18:59:09,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:09,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641207089] [2020-01-16 18:59:09,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:09,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:09,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891670673] [2020-01-16 18:59:09,576 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:09,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:09,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:09,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:09,576 INFO L87 Difference]: Start difference. First operand 390 states and 1369 transitions. Second operand 9 states. [2020-01-16 18:59:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:09,732 INFO L93 Difference]: Finished difference Result 589 states and 1766 transitions. [2020-01-16 18:59:09,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:09,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:09,737 INFO L225 Difference]: With dead ends: 589 [2020-01-16 18:59:09,737 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 18:59:09,738 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:09,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 18:59:09,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 391. [2020-01-16 18:59:09,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 18:59:09,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1370 transitions. [2020-01-16 18:59:09,756 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1370 transitions. Word has length 22 [2020-01-16 18:59:09,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:09,756 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1370 transitions. [2020-01-16 18:59:09,756 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:09,757 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1370 transitions. [2020-01-16 18:59:09,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:09,758 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:09,758 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:09,759 INFO L426 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:09,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:09,759 INFO L82 PathProgramCache]: Analyzing trace with hash -661492014, now seen corresponding path program 6 times [2020-01-16 18:59:09,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:09,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548683469] [2020-01-16 18:59:09,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:10,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-01-16 18:59:10,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548683469] [2020-01-16 18:59:10,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:10,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:10,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912284388] [2020-01-16 18:59:10,109 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:10,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:10,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:10,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:10,110 INFO L87 Difference]: Start difference. First operand 391 states and 1370 transitions. Second operand 9 states. [2020-01-16 18:59:10,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:10,213 INFO L93 Difference]: Finished difference Result 587 states and 1761 transitions. [2020-01-16 18:59:10,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:10,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:10,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:10,218 INFO L225 Difference]: With dead ends: 587 [2020-01-16 18:59:10,218 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 18:59:10,218 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:10,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 18:59:10,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 388. [2020-01-16 18:59:10,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 18:59:10,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1365 transitions. [2020-01-16 18:59:10,237 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1365 transitions. Word has length 22 [2020-01-16 18:59:10,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:10,237 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1365 transitions. [2020-01-16 18:59:10,237 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:10,237 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1365 transitions. [2020-01-16 18:59:10,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:10,239 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:10,239 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:10,239 INFO L426 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:10,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:10,239 INFO L82 PathProgramCache]: Analyzing trace with hash 203279156, now seen corresponding path program 7 times [2020-01-16 18:59:10,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:10,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879096143] [2020-01-16 18:59:10,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:10,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-01-16 18:59:10,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879096143] [2020-01-16 18:59:10,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:10,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:10,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651240550] [2020-01-16 18:59:10,605 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:10,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:10,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:10,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:10,606 INFO L87 Difference]: Start difference. First operand 388 states and 1365 transitions. Second operand 9 states. [2020-01-16 18:59:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:10,720 INFO L93 Difference]: Finished difference Result 608 states and 1810 transitions. [2020-01-16 18:59:10,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:10,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:10,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:10,726 INFO L225 Difference]: With dead ends: 608 [2020-01-16 18:59:10,727 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 18:59:10,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:10,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 18:59:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 395. [2020-01-16 18:59:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 18:59:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1381 transitions. [2020-01-16 18:59:10,745 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1381 transitions. Word has length 22 [2020-01-16 18:59:10,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:10,745 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1381 transitions. [2020-01-16 18:59:10,745 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:10,746 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1381 transitions. [2020-01-16 18:59:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:10,747 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:10,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, 1, 1, 1] [2020-01-16 18:59:10,748 INFO L426 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:10,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:10,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1793545042, now seen corresponding path program 8 times [2020-01-16 18:59:10,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:10,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492356918] [2020-01-16 18:59:10,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:11,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-01-16 18:59:11,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492356918] [2020-01-16 18:59:11,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:11,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:11,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178614773] [2020-01-16 18:59:11,061 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:11,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:11,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:11,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:11,061 INFO L87 Difference]: Start difference. First operand 395 states and 1381 transitions. Second operand 9 states. [2020-01-16 18:59:11,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:11,176 INFO L93 Difference]: Finished difference Result 603 states and 1797 transitions. [2020-01-16 18:59:11,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:11,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:11,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:11,181 INFO L225 Difference]: With dead ends: 603 [2020-01-16 18:59:11,182 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 18:59:11,182 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:11,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 18:59:11,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 391. [2020-01-16 18:59:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 18:59:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1372 transitions. [2020-01-16 18:59:11,198 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1372 transitions. Word has length 22 [2020-01-16 18:59:11,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:11,199 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1372 transitions. [2020-01-16 18:59:11,199 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:11,199 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1372 transitions. [2020-01-16 18:59:11,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:11,200 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:11,200 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:11,200 INFO L426 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:11,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:11,201 INFO L82 PathProgramCache]: Analyzing trace with hash 304191328, now seen corresponding path program 9 times [2020-01-16 18:59:11,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:11,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990605333] [2020-01-16 18:59:11,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:11,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:11,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990605333] [2020-01-16 18:59:11,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:11,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:11,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813981574] [2020-01-16 18:59:11,543 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:11,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:11,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:11,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:11,544 INFO L87 Difference]: Start difference. First operand 391 states and 1372 transitions. Second operand 9 states. [2020-01-16 18:59:11,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:11,642 INFO L93 Difference]: Finished difference Result 606 states and 1802 transitions. [2020-01-16 18:59:11,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:11,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:11,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:11,647 INFO L225 Difference]: With dead ends: 606 [2020-01-16 18:59:11,647 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 18:59:11,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 18:59:11,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 394. [2020-01-16 18:59:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 18:59:11,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1376 transitions. [2020-01-16 18:59:11,662 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1376 transitions. Word has length 22 [2020-01-16 18:59:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:11,662 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1376 transitions. [2020-01-16 18:59:11,663 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:11,663 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1376 transitions. [2020-01-16 18:59:11,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:11,664 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:11,664 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:11,665 INFO L426 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:11,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:11,665 INFO L82 PathProgramCache]: Analyzing trace with hash 430827702, now seen corresponding path program 10 times [2020-01-16 18:59:11,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:11,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051770908] [2020-01-16 18:59:11,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:12,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051770908] [2020-01-16 18:59:12,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:12,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:12,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140234505] [2020-01-16 18:59:12,059 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:12,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:12,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:12,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:12,060 INFO L87 Difference]: Start difference. First operand 394 states and 1376 transitions. Second operand 9 states. [2020-01-16 18:59:12,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:12,185 INFO L93 Difference]: Finished difference Result 600 states and 1788 transitions. [2020-01-16 18:59:12,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:12,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:12,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:12,189 INFO L225 Difference]: With dead ends: 600 [2020-01-16 18:59:12,190 INFO L226 Difference]: Without dead ends: 587 [2020-01-16 18:59:12,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:12,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-01-16 18:59:12,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 391. [2020-01-16 18:59:12,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 18:59:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1369 transitions. [2020-01-16 18:59:12,206 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1369 transitions. Word has length 22 [2020-01-16 18:59:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:12,207 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1369 transitions. [2020-01-16 18:59:12,207 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1369 transitions. [2020-01-16 18:59:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:12,208 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:12,208 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:12,209 INFO L426 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:12,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:12,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1984190466, now seen corresponding path program 11 times [2020-01-16 18:59:12,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:12,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316911737] [2020-01-16 18:59:12,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:12,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-01-16 18:59:12,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316911737] [2020-01-16 18:59:12,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:12,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:12,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530060996] [2020-01-16 18:59:12,512 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:12,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:12,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:12,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:12,513 INFO L87 Difference]: Start difference. First operand 391 states and 1369 transitions. Second operand 9 states. [2020-01-16 18:59:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:12,612 INFO L93 Difference]: Finished difference Result 595 states and 1779 transitions. [2020-01-16 18:59:12,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:12,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:12,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:12,617 INFO L225 Difference]: With dead ends: 595 [2020-01-16 18:59:12,617 INFO L226 Difference]: Without dead ends: 584 [2020-01-16 18:59:12,617 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:12,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-01-16 18:59:12,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 393. [2020-01-16 18:59:12,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 18:59:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1372 transitions. [2020-01-16 18:59:12,634 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1372 transitions. Word has length 22 [2020-01-16 18:59:12,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:12,636 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1372 transitions. [2020-01-16 18:59:12,636 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1372 transitions. [2020-01-16 18:59:12,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:12,637 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:12,637 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:12,637 INFO L426 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:12,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:12,638 INFO L82 PathProgramCache]: Analyzing trace with hash -642257678, now seen corresponding path program 12 times [2020-01-16 18:59:12,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:12,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102526581] [2020-01-16 18:59:12,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:12,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-01-16 18:59:12,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102526581] [2020-01-16 18:59:12,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:12,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:12,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163872843] [2020-01-16 18:59:12,957 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:12,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:12,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:12,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:12,958 INFO L87 Difference]: Start difference. First operand 393 states and 1372 transitions. Second operand 9 states. [2020-01-16 18:59:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:13,078 INFO L93 Difference]: Finished difference Result 594 states and 1775 transitions. [2020-01-16 18:59:13,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:13,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:13,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:13,084 INFO L225 Difference]: With dead ends: 594 [2020-01-16 18:59:13,084 INFO L226 Difference]: Without dead ends: 579 [2020-01-16 18:59:13,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:13,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-01-16 18:59:13,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 388. [2020-01-16 18:59:13,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 18:59:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1363 transitions. [2020-01-16 18:59:13,101 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1363 transitions. Word has length 22 [2020-01-16 18:59:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:13,101 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1363 transitions. [2020-01-16 18:59:13,101 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1363 transitions. [2020-01-16 18:59:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:13,102 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:13,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, 1, 1, 1] [2020-01-16 18:59:13,103 INFO L426 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:13,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:13,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1959727298, now seen corresponding path program 13 times [2020-01-16 18:59:13,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:13,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995287697] [2020-01-16 18:59:13,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:13,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995287697] [2020-01-16 18:59:13,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:13,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:13,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516967534] [2020-01-16 18:59:13,443 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:13,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:13,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:13,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:13,444 INFO L87 Difference]: Start difference. First operand 388 states and 1363 transitions. Second operand 9 states. [2020-01-16 18:59:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:13,576 INFO L93 Difference]: Finished difference Result 598 states and 1781 transitions. [2020-01-16 18:59:13,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:13,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:13,586 INFO L225 Difference]: With dead ends: 598 [2020-01-16 18:59:13,586 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 18:59:13,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:13,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 18:59:13,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 392. [2020-01-16 18:59:13,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 18:59:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1371 transitions. [2020-01-16 18:59:13,609 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1371 transitions. Word has length 22 [2020-01-16 18:59:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:13,609 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1371 transitions. [2020-01-16 18:59:13,609 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:13,609 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1371 transitions. [2020-01-16 18:59:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:13,610 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:13,611 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:13,611 INFO L426 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:13,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:13,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1774171506, now seen corresponding path program 14 times [2020-01-16 18:59:13,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:13,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526742952] [2020-01-16 18:59:13,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:13,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526742952] [2020-01-16 18:59:13,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:13,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:13,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96925679] [2020-01-16 18:59:13,996 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:13,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:13,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:13,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:13,997 INFO L87 Difference]: Start difference. First operand 392 states and 1371 transitions. Second operand 9 states. [2020-01-16 18:59:14,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:14,148 INFO L93 Difference]: Finished difference Result 591 states and 1766 transitions. [2020-01-16 18:59:14,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:14,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:14,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:14,152 INFO L225 Difference]: With dead ends: 591 [2020-01-16 18:59:14,152 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 18:59:14,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:14,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 18:59:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 390. [2020-01-16 18:59:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 18:59:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1367 transitions. [2020-01-16 18:59:14,168 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1367 transitions. Word has length 22 [2020-01-16 18:59:14,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:14,168 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1367 transitions. [2020-01-16 18:59:14,168 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1367 transitions. [2020-01-16 18:59:14,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:14,170 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:14,170 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:14,170 INFO L426 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:14,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:14,171 INFO L82 PathProgramCache]: Analyzing trace with hash 359289444, now seen corresponding path program 15 times [2020-01-16 18:59:14,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:14,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322715044] [2020-01-16 18:59:14,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:14,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-01-16 18:59:14,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322715044] [2020-01-16 18:59:14,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:14,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:14,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292860986] [2020-01-16 18:59:14,495 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:14,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:14,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:14,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:14,496 INFO L87 Difference]: Start difference. First operand 390 states and 1367 transitions. Second operand 9 states. [2020-01-16 18:59:14,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:14,579 INFO L93 Difference]: Finished difference Result 600 states and 1784 transitions. [2020-01-16 18:59:14,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:14,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:14,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:14,582 INFO L225 Difference]: With dead ends: 600 [2020-01-16 18:59:14,582 INFO L226 Difference]: Without dead ends: 584 [2020-01-16 18:59:14,582 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:14,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-01-16 18:59:14,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 393. [2020-01-16 18:59:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 18:59:14,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1371 transitions. [2020-01-16 18:59:14,598 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1371 transitions. Word has length 22 [2020-01-16 18:59:14,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:14,598 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1371 transitions. [2020-01-16 18:59:14,598 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:14,598 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1371 transitions. [2020-01-16 18:59:14,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:14,600 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:14,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, 1, 1, 1] [2020-01-16 18:59:14,600 INFO L426 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:14,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:14,600 INFO L82 PathProgramCache]: Analyzing trace with hash -602914218, now seen corresponding path program 16 times [2020-01-16 18:59:14,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:14,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320980607] [2020-01-16 18:59:14,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:14,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-01-16 18:59:14,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320980607] [2020-01-16 18:59:14,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:14,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:14,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783490428] [2020-01-16 18:59:14,919 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:14,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:14,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:14,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:14,920 INFO L87 Difference]: Start difference. First operand 393 states and 1371 transitions. Second operand 9 states. [2020-01-16 18:59:15,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:15,072 INFO L93 Difference]: Finished difference Result 594 states and 1770 transitions. [2020-01-16 18:59:15,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:15,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:15,075 INFO L225 Difference]: With dead ends: 594 [2020-01-16 18:59:15,075 INFO L226 Difference]: Without dead ends: 581 [2020-01-16 18:59:15,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:15,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-01-16 18:59:15,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 390. [2020-01-16 18:59:15,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 18:59:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1365 transitions. [2020-01-16 18:59:15,098 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1365 transitions. Word has length 22 [2020-01-16 18:59:15,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:15,098 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1365 transitions. [2020-01-16 18:59:15,099 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1365 transitions. [2020-01-16 18:59:15,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:15,100 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:15,100 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:15,101 INFO L426 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:15,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:15,102 INFO L82 PathProgramCache]: Analyzing trace with hash 414011670, now seen corresponding path program 17 times [2020-01-16 18:59:15,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:15,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305476482] [2020-01-16 18:59:15,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:15,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305476482] [2020-01-16 18:59:15,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:15,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:15,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109911684] [2020-01-16 18:59:15,517 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:15,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:15,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:15,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:15,518 INFO L87 Difference]: Start difference. First operand 390 states and 1365 transitions. Second operand 9 states. [2020-01-16 18:59:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:15,599 INFO L93 Difference]: Finished difference Result 584 states and 1751 transitions. [2020-01-16 18:59:15,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:15,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:15,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:15,602 INFO L225 Difference]: With dead ends: 584 [2020-01-16 18:59:15,602 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 18:59:15,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 18:59:15,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 391. [2020-01-16 18:59:15,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 18:59:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1366 transitions. [2020-01-16 18:59:15,626 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1366 transitions. Word has length 22 [2020-01-16 18:59:15,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:15,626 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1366 transitions. [2020-01-16 18:59:15,626 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:15,626 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1366 transitions. [2020-01-16 18:59:15,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:15,627 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:15,628 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:15,628 INFO L426 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:15,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:15,628 INFO L82 PathProgramCache]: Analyzing trace with hash 2024952628, now seen corresponding path program 18 times [2020-01-16 18:59:15,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:15,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571675480] [2020-01-16 18:59:15,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:15,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-01-16 18:59:15,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571675480] [2020-01-16 18:59:15,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:15,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:15,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61767225] [2020-01-16 18:59:15,982 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:15,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:15,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:15,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:15,983 INFO L87 Difference]: Start difference. First operand 391 states and 1366 transitions. Second operand 9 states. [2020-01-16 18:59:16,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:16,100 INFO L93 Difference]: Finished difference Result 585 states and 1752 transitions. [2020-01-16 18:59:16,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:16,100 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:16,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:16,102 INFO L225 Difference]: With dead ends: 585 [2020-01-16 18:59:16,103 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 18:59:16,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 18:59:16,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 388. [2020-01-16 18:59:16,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 18:59:16,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1361 transitions. [2020-01-16 18:59:16,117 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1361 transitions. Word has length 22 [2020-01-16 18:59:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:16,117 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1361 transitions. [2020-01-16 18:59:16,117 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:16,117 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1361 transitions. [2020-01-16 18:59:16,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:16,119 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:16,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, 1, 1, 1] [2020-01-16 18:59:16,119 INFO L426 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:16,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:16,119 INFO L82 PathProgramCache]: Analyzing trace with hash 322537952, now seen corresponding path program 19 times [2020-01-16 18:59:16,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:16,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813194174] [2020-01-16 18:59:16,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:16,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813194174] [2020-01-16 18:59:16,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:16,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:16,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262220763] [2020-01-16 18:59:16,446 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:16,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:16,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:16,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:16,447 INFO L87 Difference]: Start difference. First operand 388 states and 1361 transitions. Second operand 9 states. [2020-01-16 18:59:16,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:16,566 INFO L93 Difference]: Finished difference Result 579 states and 1743 transitions. [2020-01-16 18:59:16,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:16,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:16,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:16,568 INFO L225 Difference]: With dead ends: 579 [2020-01-16 18:59:16,569 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 18:59:16,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:16,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 18:59:16,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 390. [2020-01-16 18:59:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 18:59:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1365 transitions. [2020-01-16 18:59:16,583 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1365 transitions. Word has length 22 [2020-01-16 18:59:16,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:16,583 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1365 transitions. [2020-01-16 18:59:16,584 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:16,584 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1365 transitions. [2020-01-16 18:59:16,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:16,585 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:16,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, 1, 1, 1] [2020-01-16 18:59:16,585 INFO L426 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:16,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:16,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1122979058, now seen corresponding path program 20 times [2020-01-16 18:59:16,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:16,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520614319] [2020-01-16 18:59:16,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:16,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-01-16 18:59:16,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520614319] [2020-01-16 18:59:16,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:16,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:16,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280171882] [2020-01-16 18:59:16,917 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:16,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:16,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:16,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:16,918 INFO L87 Difference]: Start difference. First operand 390 states and 1365 transitions. Second operand 9 states. [2020-01-16 18:59:17,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:17,005 INFO L93 Difference]: Finished difference Result 577 states and 1738 transitions. [2020-01-16 18:59:17,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:17,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:17,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:17,008 INFO L225 Difference]: With dead ends: 577 [2020-01-16 18:59:17,009 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 18:59:17,009 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:17,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 18:59:17,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 389. [2020-01-16 18:59:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 18:59:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1363 transitions. [2020-01-16 18:59:17,023 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1363 transitions. Word has length 22 [2020-01-16 18:59:17,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:17,023 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1363 transitions. [2020-01-16 18:59:17,024 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:17,024 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1363 transitions. [2020-01-16 18:59:17,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:17,025 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:17,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, 1, 1, 1] [2020-01-16 18:59:17,025 INFO L426 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:17,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:17,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1277899902, now seen corresponding path program 21 times [2020-01-16 18:59:17,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:17,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630033440] [2020-01-16 18:59:17,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:17,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:17,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630033440] [2020-01-16 18:59:17,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:17,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:17,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273875704] [2020-01-16 18:59:17,340 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:17,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:17,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:17,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:17,341 INFO L87 Difference]: Start difference. First operand 389 states and 1363 transitions. Second operand 9 states. [2020-01-16 18:59:17,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:17,448 INFO L93 Difference]: Finished difference Result 581 states and 1747 transitions. [2020-01-16 18:59:17,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:17,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:17,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:17,451 INFO L225 Difference]: With dead ends: 581 [2020-01-16 18:59:17,451 INFO L226 Difference]: Without dead ends: 570 [2020-01-16 18:59:17,451 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:17,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-01-16 18:59:17,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 391. [2020-01-16 18:59:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 18:59:17,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1366 transitions. [2020-01-16 18:59:17,463 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1366 transitions. Word has length 22 [2020-01-16 18:59:17,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:17,463 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1366 transitions. [2020-01-16 18:59:17,463 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:17,463 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1366 transitions. [2020-01-16 18:59:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:17,464 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59: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, 1, 1, 1] [2020-01-16 18:59:17,465 INFO L426 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:17,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:17,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1024807150, now seen corresponding path program 22 times [2020-01-16 18:59:17,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:17,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555730483] [2020-01-16 18:59:17,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:17,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555730483] [2020-01-16 18:59:17,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:17,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:17,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904917525] [2020-01-16 18:59:17,803 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:17,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:17,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:17,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:17,804 INFO L87 Difference]: Start difference. First operand 391 states and 1366 transitions. Second operand 9 states. [2020-01-16 18:59:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:17,921 INFO L93 Difference]: Finished difference Result 580 states and 1743 transitions. [2020-01-16 18:59:17,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:17,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:17,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:17,924 INFO L225 Difference]: With dead ends: 580 [2020-01-16 18:59:17,924 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 18:59:17,925 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:17,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 18:59:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 389. [2020-01-16 18:59:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 18:59:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1362 transitions. [2020-01-16 18:59:17,937 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1362 transitions. Word has length 22 [2020-01-16 18:59:17,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:17,938 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1362 transitions. [2020-01-16 18:59:17,938 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1362 transitions. [2020-01-16 18:59:17,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:17,939 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:17,939 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:17,940 INFO L426 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:17,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:17,940 INFO L82 PathProgramCache]: Analyzing trace with hash -28887470, now seen corresponding path program 23 times [2020-01-16 18:59:17,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:17,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7130008] [2020-01-16 18:59:17,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:18,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-01-16 18:59:18,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7130008] [2020-01-16 18:59:18,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:18,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:18,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690504936] [2020-01-16 18:59:18,280 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:18,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:18,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:18,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:18,281 INFO L87 Difference]: Start difference. First operand 389 states and 1362 transitions. Second operand 9 states. [2020-01-16 18:59:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:18,361 INFO L93 Difference]: Finished difference Result 576 states and 1735 transitions. [2020-01-16 18:59:18,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:18,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:18,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:18,364 INFO L225 Difference]: With dead ends: 576 [2020-01-16 18:59:18,364 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 18:59:18,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:18,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 18:59:18,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 390. [2020-01-16 18:59:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 18:59:18,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1363 transitions. [2020-01-16 18:59:18,377 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1363 transitions. Word has length 22 [2020-01-16 18:59:18,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:18,378 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1363 transitions. [2020-01-16 18:59:18,378 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:18,378 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1363 transitions. [2020-01-16 18:59:18,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:18,379 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:18,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, 1, 1, 1] [2020-01-16 18:59:18,379 INFO L426 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:18,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:18,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1582053488, now seen corresponding path program 24 times [2020-01-16 18:59:18,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:18,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810134562] [2020-01-16 18:59:18,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:18,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-01-16 18:59:18,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810134562] [2020-01-16 18:59:18,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:18,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:18,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366947403] [2020-01-16 18:59:18,720 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:18,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:18,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:18,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:18,720 INFO L87 Difference]: Start difference. First operand 390 states and 1363 transitions. Second operand 9 states. [2020-01-16 18:59:18,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:18,844 INFO L93 Difference]: Finished difference Result 577 states and 1736 transitions. [2020-01-16 18:59:18,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:18,845 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:18,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:18,847 INFO L225 Difference]: With dead ends: 577 [2020-01-16 18:59:18,847 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 18:59:18,848 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:18,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 18:59:18,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 386. [2020-01-16 18:59:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 18:59:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1357 transitions. [2020-01-16 18:59:18,866 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1357 transitions. Word has length 22 [2020-01-16 18:59:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:18,866 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1357 transitions. [2020-01-16 18:59:18,866 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1357 transitions. [2020-01-16 18:59:18,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:18,868 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:18,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, 1, 1, 1] [2020-01-16 18:59:18,868 INFO L426 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:18,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:18,869 INFO L82 PathProgramCache]: Analyzing trace with hash 2110854208, now seen corresponding path program 25 times [2020-01-16 18:59:18,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:18,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198435721] [2020-01-16 18:59:18,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:19,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198435721] [2020-01-16 18:59:19,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:19,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:19,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203836548] [2020-01-16 18:59:19,255 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:19,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:19,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:19,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:19,255 INFO L87 Difference]: Start difference. First operand 386 states and 1357 transitions. Second operand 9 states. [2020-01-16 18:59:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:19,342 INFO L93 Difference]: Finished difference Result 618 states and 1833 transitions. [2020-01-16 18:59:19,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:19,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:19,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:19,344 INFO L225 Difference]: With dead ends: 618 [2020-01-16 18:59:19,344 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 18:59:19,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:19,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 18:59:19,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 395. [2020-01-16 18:59:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 18:59:19,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1380 transitions. [2020-01-16 18:59:19,356 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1380 transitions. Word has length 22 [2020-01-16 18:59:19,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:19,357 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1380 transitions. [2020-01-16 18:59:19,357 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1380 transitions. [2020-01-16 18:59:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:19,358 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:19,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, 1, 1, 1] [2020-01-16 18:59:19,358 INFO L426 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:19,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:19,359 INFO L82 PathProgramCache]: Analyzing trace with hash -593847202, now seen corresponding path program 26 times [2020-01-16 18:59:19,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:19,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599434728] [2020-01-16 18:59:19,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:19,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599434728] [2020-01-16 18:59:19,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:19,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:19,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97136317] [2020-01-16 18:59:19,651 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:19,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:19,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:19,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:19,651 INFO L87 Difference]: Start difference. First operand 395 states and 1380 transitions. Second operand 9 states. [2020-01-16 18:59:19,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:19,764 INFO L93 Difference]: Finished difference Result 613 states and 1820 transitions. [2020-01-16 18:59:19,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:19,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:19,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:19,767 INFO L225 Difference]: With dead ends: 613 [2020-01-16 18:59:19,767 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 18:59:19,768 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:19,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 18:59:19,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 391. [2020-01-16 18:59:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 18:59:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1372 transitions. [2020-01-16 18:59:19,783 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1372 transitions. Word has length 22 [2020-01-16 18:59:19,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:19,784 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1372 transitions. [2020-01-16 18:59:19,784 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:19,784 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1372 transitions. [2020-01-16 18:59:19,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:19,785 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:19,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, 1, 1, 1] [2020-01-16 18:59:19,786 INFO L426 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:19,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:19,786 INFO L82 PathProgramCache]: Analyzing trace with hash -831562768, now seen corresponding path program 27 times [2020-01-16 18:59:19,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:19,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555607335] [2020-01-16 18:59:19,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:20,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:20,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555607335] [2020-01-16 18:59:20,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:20,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:20,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919671993] [2020-01-16 18:59:20,098 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:20,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:20,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:20,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:20,099 INFO L87 Difference]: Start difference. First operand 391 states and 1372 transitions. Second operand 9 states. [2020-01-16 18:59:20,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:20,176 INFO L93 Difference]: Finished difference Result 614 states and 1821 transitions. [2020-01-16 18:59:20,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:20,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:20,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:20,178 INFO L225 Difference]: With dead ends: 614 [2020-01-16 18:59:20,178 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 18:59:20,179 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 18:59:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 393. [2020-01-16 18:59:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 18:59:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1374 transitions. [2020-01-16 18:59:20,191 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1374 transitions. Word has length 22 [2020-01-16 18:59:20,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:20,191 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1374 transitions. [2020-01-16 18:59:20,191 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:20,191 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1374 transitions. [2020-01-16 18:59:20,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:20,192 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:20,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, 1, 1, 1] [2020-01-16 18:59:20,192 INFO L426 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:20,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:20,192 INFO L82 PathProgramCache]: Analyzing trace with hash -270494276, now seen corresponding path program 28 times [2020-01-16 18:59:20,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:20,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271169645] [2020-01-16 18:59:20,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:20,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-01-16 18:59:20,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271169645] [2020-01-16 18:59:20,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:20,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:20,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975820985] [2020-01-16 18:59:20,499 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:20,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:20,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:20,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:20,500 INFO L87 Difference]: Start difference. First operand 393 states and 1374 transitions. Second operand 9 states. [2020-01-16 18:59:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:20,583 INFO L93 Difference]: Finished difference Result 607 states and 1806 transitions. [2020-01-16 18:59:20,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:20,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:20,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:20,585 INFO L225 Difference]: With dead ends: 607 [2020-01-16 18:59:20,585 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 18:59:20,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:20,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 18:59:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 391. [2020-01-16 18:59:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 18:59:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1370 transitions. [2020-01-16 18:59:20,600 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1370 transitions. Word has length 22 [2020-01-16 18:59:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:20,600 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1370 transitions. [2020-01-16 18:59:20,600 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1370 transitions. [2020-01-16 18:59:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:20,601 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:20,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, 1, 1, 1] [2020-01-16 18:59:20,601 INFO L426 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:20,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:20,602 INFO L82 PathProgramCache]: Analyzing trace with hash -2025852974, now seen corresponding path program 29 times [2020-01-16 18:59:20,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:20,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712794794] [2020-01-16 18:59:20,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:20,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-01-16 18:59:20,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712794794] [2020-01-16 18:59:20,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:20,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:20,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365510394] [2020-01-16 18:59:20,919 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:20,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:20,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:20,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:20,919 INFO L87 Difference]: Start difference. First operand 391 states and 1370 transitions. Second operand 9 states. [2020-01-16 18:59:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:21,028 INFO L93 Difference]: Finished difference Result 603 states and 1799 transitions. [2020-01-16 18:59:21,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:21,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:21,029 INFO L225 Difference]: With dead ends: 603 [2020-01-16 18:59:21,029 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 18:59:21,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:21,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 18:59:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 392. [2020-01-16 18:59:21,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 18:59:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1371 transitions. [2020-01-16 18:59:21,042 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1371 transitions. Word has length 22 [2020-01-16 18:59:21,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:21,043 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1371 transitions. [2020-01-16 18:59:21,043 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:21,043 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1371 transitions. [2020-01-16 18:59:21,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:21,044 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:21,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, 1, 1, 1] [2020-01-16 18:59:21,044 INFO L426 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:21,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:21,045 INFO L82 PathProgramCache]: Analyzing trace with hash 823597312, now seen corresponding path program 30 times [2020-01-16 18:59:21,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:21,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598633459] [2020-01-16 18:59:21,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:21,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-01-16 18:59:21,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598633459] [2020-01-16 18:59:21,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:21,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:21,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581674264] [2020-01-16 18:59:21,373 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:21,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:21,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:21,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:21,374 INFO L87 Difference]: Start difference. First operand 392 states and 1371 transitions. Second operand 9 states. [2020-01-16 18:59:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:21,457 INFO L93 Difference]: Finished difference Result 601 states and 1794 transitions. [2020-01-16 18:59:21,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:21,457 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:21,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:21,459 INFO L225 Difference]: With dead ends: 601 [2020-01-16 18:59:21,459 INFO L226 Difference]: Without dead ends: 589 [2020-01-16 18:59:21,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:21,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-01-16 18:59:21,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 389. [2020-01-16 18:59:21,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 18:59:21,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1366 transitions. [2020-01-16 18:59:21,473 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1366 transitions. Word has length 22 [2020-01-16 18:59:21,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:21,474 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1366 transitions. [2020-01-16 18:59:21,474 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:21,474 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1366 transitions. [2020-01-16 18:59:21,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:21,475 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:21,475 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:21,476 INFO L426 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:21,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:21,476 INFO L82 PathProgramCache]: Analyzing trace with hash 350801268, now seen corresponding path program 31 times [2020-01-16 18:59:21,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:21,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236616680] [2020-01-16 18:59:21,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:21,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236616680] [2020-01-16 18:59:21,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:21,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:21,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927181381] [2020-01-16 18:59:21,781 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:21,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:21,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:21,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:21,781 INFO L87 Difference]: Start difference. First operand 389 states and 1366 transitions. Second operand 9 states. [2020-01-16 18:59:21,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:21,863 INFO L93 Difference]: Finished difference Result 634 states and 1873 transitions. [2020-01-16 18:59:21,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:21,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:21,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:21,865 INFO L225 Difference]: With dead ends: 634 [2020-01-16 18:59:21,865 INFO L226 Difference]: Without dead ends: 618 [2020-01-16 18:59:21,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:21,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-01-16 18:59:21,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 398. [2020-01-16 18:59:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 18:59:21,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1388 transitions. [2020-01-16 18:59:21,880 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1388 transitions. Word has length 22 [2020-01-16 18:59:21,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:21,881 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1388 transitions. [2020-01-16 18:59:21,881 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:21,881 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1388 transitions. [2020-01-16 18:59:21,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:21,882 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:21,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, 1, 1, 1] [2020-01-16 18:59:21,883 INFO L426 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:21,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:21,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1941067154, now seen corresponding path program 32 times [2020-01-16 18:59:21,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:21,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894589866] [2020-01-16 18:59:21,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:22,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-01-16 18:59:22,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894589866] [2020-01-16 18:59:22,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:22,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:22,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058921060] [2020-01-16 18:59:22,194 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:22,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:22,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:22,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:22,194 INFO L87 Difference]: Start difference. First operand 398 states and 1388 transitions. Second operand 9 states. [2020-01-16 18:59:22,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:22,323 INFO L93 Difference]: Finished difference Result 629 states and 1860 transitions. [2020-01-16 18:59:22,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:22,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:22,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:22,324 INFO L225 Difference]: With dead ends: 629 [2020-01-16 18:59:22,325 INFO L226 Difference]: Without dead ends: 614 [2020-01-16 18:59:22,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-01-16 18:59:22,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 394. [2020-01-16 18:59:22,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 18:59:22,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1378 transitions. [2020-01-16 18:59:22,339 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1378 transitions. Word has length 22 [2020-01-16 18:59:22,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:22,339 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1378 transitions. [2020-01-16 18:59:22,339 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1378 transitions. [2020-01-16 18:59:22,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:22,340 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:22,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, 1, 1, 1] [2020-01-16 18:59:22,341 INFO L426 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:22,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:22,341 INFO L82 PathProgramCache]: Analyzing trace with hash 615852132, now seen corresponding path program 33 times [2020-01-16 18:59:22,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:22,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394524663] [2020-01-16 18:59:22,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:22,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-01-16 18:59:22,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394524663] [2020-01-16 18:59:22,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:22,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:22,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115717540] [2020-01-16 18:59:22,678 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:22,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:22,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:22,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:22,679 INFO L87 Difference]: Start difference. First operand 394 states and 1378 transitions. Second operand 9 states. [2020-01-16 18:59:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:22,781 INFO L93 Difference]: Finished difference Result 641 states and 1885 transitions. [2020-01-16 18:59:22,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:22,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:22,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:22,783 INFO L225 Difference]: With dead ends: 641 [2020-01-16 18:59:22,783 INFO L226 Difference]: Without dead ends: 625 [2020-01-16 18:59:22,784 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:22,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-01-16 18:59:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 402. [2020-01-16 18:59:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-01-16 18:59:22,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1391 transitions. [2020-01-16 18:59:22,796 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1391 transitions. Word has length 22 [2020-01-16 18:59:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:22,796 INFO L478 AbstractCegarLoop]: Abstraction has 402 states and 1391 transitions. [2020-01-16 18:59:22,796 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1391 transitions. [2020-01-16 18:59:22,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:22,797 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:22,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, 1, 1, 1] [2020-01-16 18:59:22,797 INFO L426 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:22,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:22,797 INFO L82 PathProgramCache]: Analyzing trace with hash -881719418, now seen corresponding path program 34 times [2020-01-16 18:59:22,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:22,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701721932] [2020-01-16 18:59:22,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:23,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701721932] [2020-01-16 18:59:23,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:23,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:23,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112199920] [2020-01-16 18:59:23,133 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:23,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:23,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:23,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:23,134 INFO L87 Difference]: Start difference. First operand 402 states and 1391 transitions. Second operand 9 states. [2020-01-16 18:59:23,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:23,251 INFO L93 Difference]: Finished difference Result 639 states and 1875 transitions. [2020-01-16 18:59:23,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:23,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:23,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:23,257 INFO L225 Difference]: With dead ends: 639 [2020-01-16 18:59:23,257 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 18:59:23,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 18:59:23,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 394. [2020-01-16 18:59:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 18:59:23,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1373 transitions. [2020-01-16 18:59:23,270 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1373 transitions. Word has length 22 [2020-01-16 18:59:23,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:23,270 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1373 transitions. [2020-01-16 18:59:23,270 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:23,270 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1373 transitions. [2020-01-16 18:59:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:23,271 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:23,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, 1, 1, 1] [2020-01-16 18:59:23,272 INFO L426 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:23,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:23,272 INFO L82 PathProgramCache]: Analyzing trace with hash -599444282, now seen corresponding path program 35 times [2020-01-16 18:59:23,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:23,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517824157] [2020-01-16 18:59:23,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:23,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:23,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517824157] [2020-01-16 18:59:23,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:23,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:23,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127143829] [2020-01-16 18:59:23,569 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:23,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:23,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:23,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:23,570 INFO L87 Difference]: Start difference. First operand 394 states and 1373 transitions. Second operand 9 states. [2020-01-16 18:59:23,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:23,709 INFO L93 Difference]: Finished difference Result 626 states and 1850 transitions. [2020-01-16 18:59:23,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:23,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:23,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:23,710 INFO L225 Difference]: With dead ends: 626 [2020-01-16 18:59:23,710 INFO L226 Difference]: Without dead ends: 615 [2020-01-16 18:59:23,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:23,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-01-16 18:59:23,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 397. [2020-01-16 18:59:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 18:59:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1378 transitions. [2020-01-16 18:59:23,723 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1378 transitions. Word has length 22 [2020-01-16 18:59:23,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:23,723 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1378 transitions. [2020-01-16 18:59:23,723 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:23,723 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1378 transitions. [2020-01-16 18:59:23,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:23,724 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:23,724 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:23,725 INFO L426 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:23,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:23,725 INFO L82 PathProgramCache]: Analyzing trace with hash -581010256, now seen corresponding path program 36 times [2020-01-16 18:59:23,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:23,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791551720] [2020-01-16 18:59:23,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:24,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:24,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791551720] [2020-01-16 18:59:24,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:24,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:24,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222229090] [2020-01-16 18:59:24,017 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:24,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:24,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:24,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:24,018 INFO L87 Difference]: Start difference. First operand 397 states and 1378 transitions. Second operand 9 states. [2020-01-16 18:59:24,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:24,135 INFO L93 Difference]: Finished difference Result 629 states and 1853 transitions. [2020-01-16 18:59:24,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:24,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:24,137 INFO L225 Difference]: With dead ends: 629 [2020-01-16 18:59:24,137 INFO L226 Difference]: Without dead ends: 607 [2020-01-16 18:59:24,137 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-01-16 18:59:24,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 389. [2020-01-16 18:59:24,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 18:59:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1363 transitions. [2020-01-16 18:59:24,147 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1363 transitions. Word has length 22 [2020-01-16 18:59:24,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:24,147 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1363 transitions. [2020-01-16 18:59:24,147 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:24,147 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1363 transitions. [2020-01-16 18:59:24,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:24,148 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:24,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, 1, 1, 1] [2020-01-16 18:59:24,148 INFO L426 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:24,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:24,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1509912752, now seen corresponding path program 37 times [2020-01-16 18:59:24,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:24,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759085288] [2020-01-16 18:59:24,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:24,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-01-16 18:59:24,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759085288] [2020-01-16 18:59:24,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:24,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:24,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115756638] [2020-01-16 18:59:24,452 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:24,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:24,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:24,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:24,452 INFO L87 Difference]: Start difference. First operand 389 states and 1363 transitions. Second operand 9 states. [2020-01-16 18:59:24,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:24,533 INFO L93 Difference]: Finished difference Result 622 states and 1836 transitions. [2020-01-16 18:59:24,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:24,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:24,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:24,534 INFO L225 Difference]: With dead ends: 622 [2020-01-16 18:59:24,535 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 18:59:24,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:24,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 18:59:24,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 394. [2020-01-16 18:59:24,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 18:59:24,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1373 transitions. [2020-01-16 18:59:24,547 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1373 transitions. Word has length 22 [2020-01-16 18:59:24,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:24,547 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1373 transitions. [2020-01-16 18:59:24,547 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:24,547 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1373 transitions. [2020-01-16 18:59:24,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:24,548 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:24,548 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:24,549 INFO L426 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:24,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:24,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2070981244, now seen corresponding path program 38 times [2020-01-16 18:59:24,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:24,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005347640] [2020-01-16 18:59:24,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:24,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005347640] [2020-01-16 18:59:24,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:24,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:24,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950907633] [2020-01-16 18:59:24,837 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:24,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:24,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:24,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:24,837 INFO L87 Difference]: Start difference. First operand 394 states and 1373 transitions. Second operand 9 states. [2020-01-16 18:59:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:24,922 INFO L93 Difference]: Finished difference Result 615 states and 1821 transitions. [2020-01-16 18:59:24,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:24,923 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:24,924 INFO L225 Difference]: With dead ends: 615 [2020-01-16 18:59:24,924 INFO L226 Difference]: Without dead ends: 604 [2020-01-16 18:59:24,925 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-01-16 18:59:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 392. [2020-01-16 18:59:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 18:59:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1369 transitions. [2020-01-16 18:59:24,935 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1369 transitions. Word has length 22 [2020-01-16 18:59:24,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:24,936 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1369 transitions. [2020-01-16 18:59:24,936 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1369 transitions. [2020-01-16 18:59:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:24,937 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:24,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, 1, 1, 1] [2020-01-16 18:59:24,937 INFO L426 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:24,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:24,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1772362012, now seen corresponding path program 39 times [2020-01-16 18:59:24,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:24,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131802678] [2020-01-16 18:59:24,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:25,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-01-16 18:59:25,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131802678] [2020-01-16 18:59:25,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:25,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:25,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991438889] [2020-01-16 18:59:25,278 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:25,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:25,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:25,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:25,279 INFO L87 Difference]: Start difference. First operand 392 states and 1369 transitions. Second operand 9 states. [2020-01-16 18:59:25,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:25,360 INFO L93 Difference]: Finished difference Result 633 states and 1860 transitions. [2020-01-16 18:59:25,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:25,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:25,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:25,362 INFO L225 Difference]: With dead ends: 633 [2020-01-16 18:59:25,362 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 18:59:25,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:25,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 18:59:25,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 400. [2020-01-16 18:59:25,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-01-16 18:59:25,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1382 transitions. [2020-01-16 18:59:25,375 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1382 transitions. Word has length 22 [2020-01-16 18:59:25,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:25,376 INFO L478 AbstractCegarLoop]: Abstraction has 400 states and 1382 transitions. [2020-01-16 18:59:25,376 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:25,376 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1382 transitions. [2020-01-16 18:59:25,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:25,377 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:25,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, 1, 1, 1] [2020-01-16 18:59:25,377 INFO L426 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:25,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:25,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1902332458, now seen corresponding path program 40 times [2020-01-16 18:59:25,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:25,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259342658] [2020-01-16 18:59:25,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:25,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-01-16 18:59:25,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259342658] [2020-01-16 18:59:25,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:25,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:25,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515223067] [2020-01-16 18:59:25,697 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:25,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:25,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:25,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:25,697 INFO L87 Difference]: Start difference. First operand 400 states and 1382 transitions. Second operand 9 states. [2020-01-16 18:59:25,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:25,855 INFO L93 Difference]: Finished difference Result 631 states and 1850 transitions. [2020-01-16 18:59:25,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:25,856 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:25,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:25,857 INFO L225 Difference]: With dead ends: 631 [2020-01-16 18:59:25,857 INFO L226 Difference]: Without dead ends: 609 [2020-01-16 18:59:25,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:25,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-01-16 18:59:25,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 392. [2020-01-16 18:59:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 18:59:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1366 transitions. [2020-01-16 18:59:25,870 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1366 transitions. Word has length 22 [2020-01-16 18:59:25,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:25,870 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1366 transitions. [2020-01-16 18:59:25,870 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:25,870 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1366 transitions. [2020-01-16 18:59:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:25,876 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:25,876 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:25,876 INFO L426 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:25,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:25,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1717639786, now seen corresponding path program 41 times [2020-01-16 18:59:25,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:25,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345199702] [2020-01-16 18:59:25,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:26,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-01-16 18:59:26,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345199702] [2020-01-16 18:59:26,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:26,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:26,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321900982] [2020-01-16 18:59:26,187 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:26,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:26,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:26,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:26,187 INFO L87 Difference]: Start difference. First operand 392 states and 1366 transitions. Second operand 9 states. [2020-01-16 18:59:26,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:26,279 INFO L93 Difference]: Finished difference Result 612 states and 1813 transitions. [2020-01-16 18:59:26,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:26,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:26,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:26,281 INFO L225 Difference]: With dead ends: 612 [2020-01-16 18:59:26,281 INFO L226 Difference]: Without dead ends: 603 [2020-01-16 18:59:26,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:26,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-01-16 18:59:26,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 393. [2020-01-16 18:59:26,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 18:59:26,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1367 transitions. [2020-01-16 18:59:26,294 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1367 transitions. Word has length 22 [2020-01-16 18:59:26,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:26,295 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1367 transitions. [2020-01-16 18:59:26,295 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:26,295 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1367 transitions. [2020-01-16 18:59:26,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:26,295 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:26,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, 1, 1, 1] [2020-01-16 18:59:26,296 INFO L426 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:26,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:26,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1501616354, now seen corresponding path program 42 times [2020-01-16 18:59:26,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:26,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461359011] [2020-01-16 18:59:26,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:26,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:26,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461359011] [2020-01-16 18:59:26,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:26,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:26,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514299289] [2020-01-16 18:59:26,583 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:26,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:26,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:26,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:26,584 INFO L87 Difference]: Start difference. First operand 393 states and 1367 transitions. Second operand 9 states. [2020-01-16 18:59:26,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:26,702 INFO L93 Difference]: Finished difference Result 617 states and 1822 transitions. [2020-01-16 18:59:26,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:26,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:26,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:26,704 INFO L225 Difference]: With dead ends: 617 [2020-01-16 18:59:26,704 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 18:59:26,705 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:26,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 18:59:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 389. [2020-01-16 18:59:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 18:59:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1360 transitions. [2020-01-16 18:59:26,716 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1360 transitions. Word has length 22 [2020-01-16 18:59:26,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:26,716 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1360 transitions. [2020-01-16 18:59:26,716 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:26,716 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1360 transitions. [2020-01-16 18:59:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:26,717 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:26,717 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:26,717 INFO L426 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:26,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:26,718 INFO L82 PathProgramCache]: Analyzing trace with hash -127276594, now seen corresponding path program 43 times [2020-01-16 18:59:26,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:26,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173267567] [2020-01-16 18:59:26,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:27,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:27,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173267567] [2020-01-16 18:59:27,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:27,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:27,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35398602] [2020-01-16 18:59:27,035 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:27,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:27,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:27,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:27,036 INFO L87 Difference]: Start difference. First operand 389 states and 1360 transitions. Second operand 9 states. [2020-01-16 18:59:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:27,142 INFO L93 Difference]: Finished difference Result 598 states and 1785 transitions. [2020-01-16 18:59:27,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:27,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:27,144 INFO L225 Difference]: With dead ends: 598 [2020-01-16 18:59:27,144 INFO L226 Difference]: Without dead ends: 587 [2020-01-16 18:59:27,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:27,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-01-16 18:59:27,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 391. [2020-01-16 18:59:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 18:59:27,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1364 transitions. [2020-01-16 18:59:27,162 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1364 transitions. Word has length 22 [2020-01-16 18:59:27,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:27,163 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1364 transitions. [2020-01-16 18:59:27,163 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:27,163 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1364 transitions. [2020-01-16 18:59:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:27,164 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:27,164 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:27,164 INFO L426 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:27,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:27,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1572793604, now seen corresponding path program 44 times [2020-01-16 18:59:27,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:27,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851696622] [2020-01-16 18:59:27,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:27,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851696622] [2020-01-16 18:59:27,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:27,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:27,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630340327] [2020-01-16 18:59:27,512 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:27,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:27,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:27,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:27,513 INFO L87 Difference]: Start difference. First operand 391 states and 1364 transitions. Second operand 9 states. [2020-01-16 18:59:27,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:27,632 INFO L93 Difference]: Finished difference Result 596 states and 1780 transitions. [2020-01-16 18:59:27,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:27,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:27,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:27,634 INFO L225 Difference]: With dead ends: 596 [2020-01-16 18:59:27,634 INFO L226 Difference]: Without dead ends: 586 [2020-01-16 18:59:27,635 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:27,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-01-16 18:59:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 390. [2020-01-16 18:59:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 18:59:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1362 transitions. [2020-01-16 18:59:27,646 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1362 transitions. Word has length 22 [2020-01-16 18:59:27,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:27,646 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1362 transitions. [2020-01-16 18:59:27,646 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:27,646 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1362 transitions. [2020-01-16 18:59:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:27,647 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:27,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, 1, 1, 1] [2020-01-16 18:59:27,647 INFO L426 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:27,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:27,647 INFO L82 PathProgramCache]: Analyzing trace with hash 885415938, now seen corresponding path program 45 times [2020-01-16 18:59:27,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:27,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849356587] [2020-01-16 18:59:27,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:27,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849356587] [2020-01-16 18:59:27,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:27,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:27,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567552204] [2020-01-16 18:59:27,971 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:27,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:27,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:27,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:27,972 INFO L87 Difference]: Start difference. First operand 390 states and 1362 transitions. Second operand 9 states. [2020-01-16 18:59:28,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:28,086 INFO L93 Difference]: Finished difference Result 605 states and 1800 transitions. [2020-01-16 18:59:28,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:28,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:28,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:28,088 INFO L225 Difference]: With dead ends: 605 [2020-01-16 18:59:28,088 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 18:59:28,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:28,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 18:59:28,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 393. [2020-01-16 18:59:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 18:59:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1367 transitions. [2020-01-16 18:59:28,100 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1367 transitions. Word has length 22 [2020-01-16 18:59:28,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:28,100 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1367 transitions. [2020-01-16 18:59:28,100 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:28,101 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1367 transitions. [2020-01-16 18:59:28,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:28,102 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:28,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, 1, 1, 1] [2020-01-16 18:59:28,102 INFO L426 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:28,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:28,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2023516228, now seen corresponding path program 46 times [2020-01-16 18:59:28,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:28,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478739306] [2020-01-16 18:59:28,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:28,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-01-16 18:59:28,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478739306] [2020-01-16 18:59:28,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:28,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:28,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891374509] [2020-01-16 18:59:28,428 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:28,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:28,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:28,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:28,429 INFO L87 Difference]: Start difference. First operand 393 states and 1367 transitions. Second operand 9 states. [2020-01-16 18:59:28,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:28,550 INFO L93 Difference]: Finished difference Result 608 states and 1803 transitions. [2020-01-16 18:59:28,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:28,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:28,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:28,552 INFO L225 Difference]: With dead ends: 608 [2020-01-16 18:59:28,552 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 18:59:28,553 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 18:59:28,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 390. [2020-01-16 18:59:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 18:59:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1361 transitions. [2020-01-16 18:59:28,567 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1361 transitions. Word has length 22 [2020-01-16 18:59:28,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:28,567 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1361 transitions. [2020-01-16 18:59:28,567 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1361 transitions. [2020-01-16 18:59:28,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:28,569 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:28,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, 1, 1, 1] [2020-01-16 18:59:28,569 INFO L426 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:28,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2134428370, now seen corresponding path program 47 times [2020-01-16 18:59:28,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:28,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396074904] [2020-01-16 18:59:28,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:28,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396074904] [2020-01-16 18:59:28,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:28,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:28,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943169278] [2020-01-16 18:59:28,849 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:28,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:28,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:28,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:28,850 INFO L87 Difference]: Start difference. First operand 390 states and 1361 transitions. Second operand 9 states. [2020-01-16 18:59:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:28,952 INFO L93 Difference]: Finished difference Result 599 states and 1785 transitions. [2020-01-16 18:59:28,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:28,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:28,954 INFO L225 Difference]: With dead ends: 599 [2020-01-16 18:59:28,954 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 18:59:28,954 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:28,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 18:59:28,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 391. [2020-01-16 18:59:28,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 18:59:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-01-16 18:59:28,964 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-01-16 18:59:28,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:28,964 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-01-16 18:59:28,964 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:28,964 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-01-16 18:59:28,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:28,965 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:28,965 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:28,965 INFO L426 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:28,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:28,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1058717214, now seen corresponding path program 48 times [2020-01-16 18:59:28,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:28,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27877884] [2020-01-16 18:59:28,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:29,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-01-16 18:59:29,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27877884] [2020-01-16 18:59:29,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:29,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:29,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046826458] [2020-01-16 18:59:29,246 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:29,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:29,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:29,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:29,247 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-01-16 18:59:29,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:29,357 INFO L93 Difference]: Finished difference Result 604 states and 1794 transitions. [2020-01-16 18:59:29,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:29,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:29,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:29,359 INFO L225 Difference]: With dead ends: 604 [2020-01-16 18:59:29,359 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 18:59:29,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:29,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 18:59:29,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 386. [2020-01-16 18:59:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 18:59:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1354 transitions. [2020-01-16 18:59:29,369 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1354 transitions. Word has length 22 [2020-01-16 18:59:29,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:29,370 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1354 transitions. [2020-01-16 18:59:29,370 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:29,370 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1354 transitions. [2020-01-16 18:59:29,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:29,371 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:29,371 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:29,371 INFO L426 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:29,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:29,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1476212864, now seen corresponding path program 49 times [2020-01-16 18:59:29,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:29,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059361984] [2020-01-16 18:59:29,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:29,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:29,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059361984] [2020-01-16 18:59:29,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:29,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:29,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730629131] [2020-01-16 18:59:29,690 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:29,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:29,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:29,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:29,690 INFO L87 Difference]: Start difference. First operand 386 states and 1354 transitions. Second operand 9 states. [2020-01-16 18:59:29,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:29,798 INFO L93 Difference]: Finished difference Result 630 states and 1870 transitions. [2020-01-16 18:59:29,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:29,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:29,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:29,800 INFO L225 Difference]: With dead ends: 630 [2020-01-16 18:59:29,800 INFO L226 Difference]: Without dead ends: 614 [2020-01-16 18:59:29,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:29,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-01-16 18:59:29,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 397. [2020-01-16 18:59:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 18:59:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1386 transitions. [2020-01-16 18:59:29,830 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1386 transitions. Word has length 22 [2020-01-16 18:59:29,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:29,830 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1386 transitions. [2020-01-16 18:59:29,830 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1386 transitions. [2020-01-16 18:59:29,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:29,832 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:29,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, 1, 1, 1] [2020-01-16 18:59:29,832 INFO L426 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:29,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:29,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1228488546, now seen corresponding path program 50 times [2020-01-16 18:59:29,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:29,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286578276] [2020-01-16 18:59:29,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:30,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286578276] [2020-01-16 18:59:30,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:30,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:30,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169383469] [2020-01-16 18:59:30,112 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:30,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:30,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:30,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:30,112 INFO L87 Difference]: Start difference. First operand 397 states and 1386 transitions. Second operand 9 states. [2020-01-16 18:59:30,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:30,230 INFO L93 Difference]: Finished difference Result 625 states and 1857 transitions. [2020-01-16 18:59:30,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:30,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:30,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:30,232 INFO L225 Difference]: With dead ends: 625 [2020-01-16 18:59:30,232 INFO L226 Difference]: Without dead ends: 610 [2020-01-16 18:59:30,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:30,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-01-16 18:59:30,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 393. [2020-01-16 18:59:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 18:59:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1377 transitions. [2020-01-16 18:59:30,244 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1377 transitions. Word has length 22 [2020-01-16 18:59:30,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:30,244 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1377 transitions. [2020-01-16 18:59:30,244 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1377 transitions. [2020-01-16 18:59:30,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:30,245 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:30,245 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:30,245 INFO L426 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:30,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:30,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1577125036, now seen corresponding path program 51 times [2020-01-16 18:59:30,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:30,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080867244] [2020-01-16 18:59:30,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:30,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:30,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080867244] [2020-01-16 18:59:30,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:30,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:30,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424567836] [2020-01-16 18:59:30,652 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:30,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:30,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:30,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:30,652 INFO L87 Difference]: Start difference. First operand 393 states and 1377 transitions. Second operand 9 states. [2020-01-16 18:59:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:30,773 INFO L93 Difference]: Finished difference Result 628 states and 1862 transitions. [2020-01-16 18:59:30,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:30,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:30,775 INFO L225 Difference]: With dead ends: 628 [2020-01-16 18:59:30,775 INFO L226 Difference]: Without dead ends: 612 [2020-01-16 18:59:30,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-01-16 18:59:30,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 396. [2020-01-16 18:59:30,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 18:59:30,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1381 transitions. [2020-01-16 18:59:30,791 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1381 transitions. Word has length 22 [2020-01-16 18:59:30,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:30,791 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1381 transitions. [2020-01-16 18:59:30,791 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:30,791 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1381 transitions. [2020-01-16 18:59:30,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:30,792 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:30,792 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:30,793 INFO L426 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:30,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:30,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1703761410, now seen corresponding path program 52 times [2020-01-16 18:59:30,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:30,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193960769] [2020-01-16 18:59:30,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:31,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-01-16 18:59:31,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193960769] [2020-01-16 18:59:31,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:31,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:31,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233569802] [2020-01-16 18:59:31,097 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:31,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:31,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:31,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:31,098 INFO L87 Difference]: Start difference. First operand 396 states and 1381 transitions. Second operand 9 states. [2020-01-16 18:59:31,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:31,215 INFO L93 Difference]: Finished difference Result 622 states and 1848 transitions. [2020-01-16 18:59:31,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:31,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:31,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:31,217 INFO L225 Difference]: With dead ends: 622 [2020-01-16 18:59:31,217 INFO L226 Difference]: Without dead ends: 609 [2020-01-16 18:59:31,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:31,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-01-16 18:59:31,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 393. [2020-01-16 18:59:31,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 18:59:31,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1374 transitions. [2020-01-16 18:59:31,228 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1374 transitions. Word has length 22 [2020-01-16 18:59:31,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:31,228 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1374 transitions. [2020-01-16 18:59:31,228 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:31,228 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1374 transitions. [2020-01-16 18:59:31,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:31,229 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:31,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, 1, 1, 1] [2020-01-16 18:59:31,229 INFO L426 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:31,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:31,229 INFO L82 PathProgramCache]: Analyzing trace with hash -711256758, now seen corresponding path program 53 times [2020-01-16 18:59:31,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:31,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735927219] [2020-01-16 18:59:31,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:31,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735927219] [2020-01-16 18:59:31,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:31,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:31,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579926752] [2020-01-16 18:59:31,540 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:31,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:31,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:31,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:31,541 INFO L87 Difference]: Start difference. First operand 393 states and 1374 transitions. Second operand 9 states. [2020-01-16 18:59:31,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:31,650 INFO L93 Difference]: Finished difference Result 617 states and 1839 transitions. [2020-01-16 18:59:31,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:31,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:31,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:31,652 INFO L225 Difference]: With dead ends: 617 [2020-01-16 18:59:31,652 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 18:59:31,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:31,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 18:59:31,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 395. [2020-01-16 18:59:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 18:59:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1377 transitions. [2020-01-16 18:59:31,662 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1377 transitions. Word has length 22 [2020-01-16 18:59:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:31,663 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1377 transitions. [2020-01-16 18:59:31,663 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1377 transitions. [2020-01-16 18:59:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:31,664 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:31,664 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:31,664 INFO L426 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:31,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:31,664 INFO L82 PathProgramCache]: Analyzing trace with hash 630676030, now seen corresponding path program 54 times [2020-01-16 18:59:31,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:31,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549342739] [2020-01-16 18:59:31,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:31,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-01-16 18:59:31,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549342739] [2020-01-16 18:59:31,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:31,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:31,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821598810] [2020-01-16 18:59:31,966 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:31,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:31,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:31,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:31,966 INFO L87 Difference]: Start difference. First operand 395 states and 1377 transitions. Second operand 9 states. [2020-01-16 18:59:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:32,072 INFO L93 Difference]: Finished difference Result 616 states and 1835 transitions. [2020-01-16 18:59:32,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:32,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:32,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:32,074 INFO L225 Difference]: With dead ends: 616 [2020-01-16 18:59:32,074 INFO L226 Difference]: Without dead ends: 601 [2020-01-16 18:59:32,075 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:32,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-01-16 18:59:32,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 390. [2020-01-16 18:59:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 18:59:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1367 transitions. [2020-01-16 18:59:32,086 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1367 transitions. Word has length 22 [2020-01-16 18:59:32,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:32,086 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1367 transitions. [2020-01-16 18:59:32,087 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:32,087 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1367 transitions. [2020-01-16 18:59:32,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:32,087 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:32,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, 1, 1, 1] [2020-01-16 18:59:32,088 INFO L426 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:32,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:32,088 INFO L82 PathProgramCache]: Analyzing trace with hash 138645650, now seen corresponding path program 55 times [2020-01-16 18:59:32,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:32,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447160960] [2020-01-16 18:59:32,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:32,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:32,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447160960] [2020-01-16 18:59:32,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:32,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:32,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83782728] [2020-01-16 18:59:32,410 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:32,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:32,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:32,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:32,411 INFO L87 Difference]: Start difference. First operand 390 states and 1367 transitions. Second operand 9 states. [2020-01-16 18:59:32,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:32,491 INFO L93 Difference]: Finished difference Result 642 states and 1897 transitions. [2020-01-16 18:59:32,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:32,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:32,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:32,493 INFO L225 Difference]: With dead ends: 642 [2020-01-16 18:59:32,493 INFO L226 Difference]: Without dead ends: 626 [2020-01-16 18:59:32,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:32,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-01-16 18:59:32,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 399. [2020-01-16 18:59:32,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 18:59:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1389 transitions. [2020-01-16 18:59:32,504 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1389 transitions. Word has length 22 [2020-01-16 18:59:32,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:32,504 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1389 transitions. [2020-01-16 18:59:32,504 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:32,504 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1389 transitions. [2020-01-16 18:59:32,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:32,505 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:32,505 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:32,505 INFO L426 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:32,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:32,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1728911536, now seen corresponding path program 56 times [2020-01-16 18:59:32,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:32,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144785657] [2020-01-16 18:59:32,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:32,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-01-16 18:59:32,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144785657] [2020-01-16 18:59:32,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:32,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:32,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308031443] [2020-01-16 18:59:32,905 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:32,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:32,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:32,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:32,906 INFO L87 Difference]: Start difference. First operand 399 states and 1389 transitions. Second operand 9 states. [2020-01-16 18:59:33,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:33,052 INFO L93 Difference]: Finished difference Result 637 states and 1884 transitions. [2020-01-16 18:59:33,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:33,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:33,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:33,055 INFO L225 Difference]: With dead ends: 637 [2020-01-16 18:59:33,055 INFO L226 Difference]: Without dead ends: 622 [2020-01-16 18:59:33,055 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:33,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-01-16 18:59:33,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 395. [2020-01-16 18:59:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 18:59:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1379 transitions. [2020-01-16 18:59:33,075 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1379 transitions. Word has length 22 [2020-01-16 18:59:33,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:33,076 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1379 transitions. [2020-01-16 18:59:33,076 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1379 transitions. [2020-01-16 18:59:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:33,077 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:33,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, 1, 1, 1] [2020-01-16 18:59:33,078 INFO L426 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:33,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:33,078 INFO L82 PathProgramCache]: Analyzing trace with hash 403696514, now seen corresponding path program 57 times [2020-01-16 18:59:33,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:33,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545132375] [2020-01-16 18:59:33,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:33,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-01-16 18:59:33,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545132375] [2020-01-16 18:59:33,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:33,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:33,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928284477] [2020-01-16 18:59:33,391 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:33,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:33,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:33,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:33,392 INFO L87 Difference]: Start difference. First operand 395 states and 1379 transitions. Second operand 9 states. [2020-01-16 18:59:33,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:33,472 INFO L93 Difference]: Finished difference Result 649 states and 1909 transitions. [2020-01-16 18:59:33,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:33,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:33,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:33,474 INFO L225 Difference]: With dead ends: 649 [2020-01-16 18:59:33,474 INFO L226 Difference]: Without dead ends: 633 [2020-01-16 18:59:33,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:33,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-01-16 18:59:33,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 403. [2020-01-16 18:59:33,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-01-16 18:59:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1392 transitions. [2020-01-16 18:59:33,484 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1392 transitions. Word has length 22 [2020-01-16 18:59:33,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:33,484 INFO L478 AbstractCegarLoop]: Abstraction has 403 states and 1392 transitions. [2020-01-16 18:59:33,485 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1392 transitions. [2020-01-16 18:59:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:33,485 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:33,485 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:33,486 INFO L426 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:33,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:33,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1093875036, now seen corresponding path program 58 times [2020-01-16 18:59:33,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:33,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65515463] [2020-01-16 18:59:33,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:33,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-01-16 18:59:33,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65515463] [2020-01-16 18:59:33,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:33,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:33,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756515005] [2020-01-16 18:59:33,794 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:33,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:33,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:33,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:33,795 INFO L87 Difference]: Start difference. First operand 403 states and 1392 transitions. Second operand 9 states. [2020-01-16 18:59:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:33,902 INFO L93 Difference]: Finished difference Result 647 states and 1899 transitions. [2020-01-16 18:59:33,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:33,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:33,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:33,904 INFO L225 Difference]: With dead ends: 647 [2020-01-16 18:59:33,904 INFO L226 Difference]: Without dead ends: 625 [2020-01-16 18:59:33,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:33,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-01-16 18:59:33,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 395. [2020-01-16 18:59:33,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 18:59:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1374 transitions. [2020-01-16 18:59:33,915 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1374 transitions. Word has length 22 [2020-01-16 18:59:33,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:33,915 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1374 transitions. [2020-01-16 18:59:33,915 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1374 transitions. [2020-01-16 18:59:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:33,916 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:33,916 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:33,917 INFO L426 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:33,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:33,917 INFO L82 PathProgramCache]: Analyzing trace with hash -811599900, now seen corresponding path program 59 times [2020-01-16 18:59:33,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:33,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950487721] [2020-01-16 18:59:33,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:34,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-01-16 18:59:34,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950487721] [2020-01-16 18:59:34,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:34,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:34,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726611992] [2020-01-16 18:59:34,225 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:34,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:34,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:34,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:34,225 INFO L87 Difference]: Start difference. First operand 395 states and 1374 transitions. Second operand 9 states. [2020-01-16 18:59:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:34,335 INFO L93 Difference]: Finished difference Result 634 states and 1874 transitions. [2020-01-16 18:59:34,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:34,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:34,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:34,339 INFO L225 Difference]: With dead ends: 634 [2020-01-16 18:59:34,339 INFO L226 Difference]: Without dead ends: 623 [2020-01-16 18:59:34,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:34,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-01-16 18:59:34,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 398. [2020-01-16 18:59:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 18:59:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1379 transitions. [2020-01-16 18:59:34,349 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1379 transitions. Word has length 22 [2020-01-16 18:59:34,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:34,349 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1379 transitions. [2020-01-16 18:59:34,349 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1379 transitions. [2020-01-16 18:59:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:34,350 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:34,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, 1, 1, 1] [2020-01-16 18:59:34,351 INFO L426 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:34,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:34,351 INFO L82 PathProgramCache]: Analyzing trace with hash -793165874, now seen corresponding path program 60 times [2020-01-16 18:59:34,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:34,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256046837] [2020-01-16 18:59:34,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:34,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-01-16 18:59:34,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256046837] [2020-01-16 18:59:34,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:34,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:34,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666473854] [2020-01-16 18:59:34,656 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:34,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:34,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:34,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:34,657 INFO L87 Difference]: Start difference. First operand 398 states and 1379 transitions. Second operand 9 states. [2020-01-16 18:59:34,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:34,806 INFO L93 Difference]: Finished difference Result 637 states and 1877 transitions. [2020-01-16 18:59:34,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:34,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:34,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:34,808 INFO L225 Difference]: With dead ends: 637 [2020-01-16 18:59:34,808 INFO L226 Difference]: Without dead ends: 615 [2020-01-16 18:59:34,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-01-16 18:59:34,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 390. [2020-01-16 18:59:34,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 18:59:34,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1363 transitions. [2020-01-16 18:59:34,819 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1363 transitions. Word has length 22 [2020-01-16 18:59:34,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:34,819 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1363 transitions. [2020-01-16 18:59:34,819 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1363 transitions. [2020-01-16 18:59:34,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:34,820 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:34,820 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:34,820 INFO L426 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:34,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:34,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1075532706, now seen corresponding path program 61 times [2020-01-16 18:59:34,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:34,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063701619] [2020-01-16 18:59:34,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:35,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063701619] [2020-01-16 18:59:35,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:35,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:35,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099838062] [2020-01-16 18:59:35,129 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:35,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:35,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:35,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:35,130 INFO L87 Difference]: Start difference. First operand 390 states and 1363 transitions. Second operand 9 states. [2020-01-16 18:59:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:35,210 INFO L93 Difference]: Finished difference Result 636 states and 1876 transitions. [2020-01-16 18:59:35,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:35,210 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:35,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:35,212 INFO L225 Difference]: With dead ends: 636 [2020-01-16 18:59:35,212 INFO L226 Difference]: Without dead ends: 620 [2020-01-16 18:59:35,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:35,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-01-16 18:59:35,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 397. [2020-01-16 18:59:35,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 18:59:35,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1379 transitions. [2020-01-16 18:59:35,221 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1379 transitions. Word has length 22 [2020-01-16 18:59:35,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:35,221 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1379 transitions. [2020-01-16 18:59:35,221 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:35,221 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1379 transitions. [2020-01-16 18:59:35,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:35,222 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:35,222 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:35,222 INFO L426 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:35,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:35,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1202169080, now seen corresponding path program 62 times [2020-01-16 18:59:35,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:35,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077275667] [2020-01-16 18:59:35,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:35,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-01-16 18:59:35,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077275667] [2020-01-16 18:59:35,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:35,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:35,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75937668] [2020-01-16 18:59:35,556 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:35,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:35,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:35,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:35,556 INFO L87 Difference]: Start difference. First operand 397 states and 1379 transitions. Second operand 9 states. [2020-01-16 18:59:35,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:35,648 INFO L93 Difference]: Finished difference Result 630 states and 1862 transitions. [2020-01-16 18:59:35,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:35,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:35,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:35,650 INFO L225 Difference]: With dead ends: 630 [2020-01-16 18:59:35,650 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 18:59:35,650 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 18:59:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 394. [2020-01-16 18:59:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 18:59:35,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1372 transitions. [2020-01-16 18:59:35,663 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1372 transitions. Word has length 22 [2020-01-16 18:59:35,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:35,663 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1372 transitions. [2020-01-16 18:59:35,663 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:35,663 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1372 transitions. [2020-01-16 18:59:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:35,664 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:35,665 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:35,665 INFO L426 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:35,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:35,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1611119408, now seen corresponding path program 63 times [2020-01-16 18:59:35,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:35,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132058137] [2020-01-16 18:59:35,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:35,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:35,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132058137] [2020-01-16 18:59:35,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:35,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:35,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891563606] [2020-01-16 18:59:35,963 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:35,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:35,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:35,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:35,964 INFO L87 Difference]: Start difference. First operand 394 states and 1372 transitions. Second operand 9 states. [2020-01-16 18:59:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:36,060 INFO L93 Difference]: Finished difference Result 645 states and 1894 transitions. [2020-01-16 18:59:36,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:36,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:36,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:36,062 INFO L225 Difference]: With dead ends: 645 [2020-01-16 18:59:36,062 INFO L226 Difference]: Without dead ends: 629 [2020-01-16 18:59:36,063 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:36,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-01-16 18:59:36,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 402. [2020-01-16 18:59:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-01-16 18:59:36,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1385 transitions. [2020-01-16 18:59:36,072 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1385 transitions. Word has length 22 [2020-01-16 18:59:36,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:36,072 INFO L478 AbstractCegarLoop]: Abstraction has 402 states and 1385 transitions. [2020-01-16 18:59:36,072 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:36,073 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1385 transitions. [2020-01-16 18:59:36,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:36,073 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:36,073 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:36,073 INFO L426 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:36,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:36,074 INFO L82 PathProgramCache]: Analyzing trace with hash 2034402296, now seen corresponding path program 64 times [2020-01-16 18:59:36,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:36,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042140067] [2020-01-16 18:59:36,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:36,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:36,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042140067] [2020-01-16 18:59:36,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:36,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:36,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681872182] [2020-01-16 18:59:36,367 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:36,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:36,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:36,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:36,368 INFO L87 Difference]: Start difference. First operand 402 states and 1385 transitions. Second operand 9 states. [2020-01-16 18:59:36,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:36,473 INFO L93 Difference]: Finished difference Result 643 states and 1884 transitions. [2020-01-16 18:59:36,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:36,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:36,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:36,475 INFO L225 Difference]: With dead ends: 643 [2020-01-16 18:59:36,475 INFO L226 Difference]: Without dead ends: 621 [2020-01-16 18:59:36,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:36,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-01-16 18:59:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 394. [2020-01-16 18:59:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 18:59:36,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1368 transitions. [2020-01-16 18:59:36,486 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1368 transitions. Word has length 22 [2020-01-16 18:59:36,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:36,486 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1368 transitions. [2020-01-16 18:59:36,486 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1368 transitions. [2020-01-16 18:59:36,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:36,487 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:36,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, 1, 1, 1] [2020-01-16 18:59:36,487 INFO L426 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:36,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:36,487 INFO L82 PathProgramCache]: Analyzing trace with hash 664313502, now seen corresponding path program 65 times [2020-01-16 18:59:36,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:36,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606322020] [2020-01-16 18:59:36,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:36,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606322020] [2020-01-16 18:59:36,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:36,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:36,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614017073] [2020-01-16 18:59:36,773 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:36,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:36,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:36,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:36,774 INFO L87 Difference]: Start difference. First operand 394 states and 1368 transitions. Second operand 9 states. [2020-01-16 18:59:36,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:36,879 INFO L93 Difference]: Finished difference Result 627 states and 1853 transitions. [2020-01-16 18:59:36,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:36,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:36,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:36,881 INFO L225 Difference]: With dead ends: 627 [2020-01-16 18:59:36,881 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 18:59:36,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:36,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 18:59:36,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 396. [2020-01-16 18:59:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 18:59:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1371 transitions. [2020-01-16 18:59:36,893 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1371 transitions. Word has length 22 [2020-01-16 18:59:36,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:36,893 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1371 transitions. [2020-01-16 18:59:36,893 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:36,893 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1371 transitions. [2020-01-16 18:59:36,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:36,894 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:36,894 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:36,894 INFO L426 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:36,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:36,895 INFO L82 PathProgramCache]: Analyzing trace with hash -253636688, now seen corresponding path program 66 times [2020-01-16 18:59:36,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:36,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723731055] [2020-01-16 18:59:36,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:37,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:37,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723731055] [2020-01-16 18:59:37,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:37,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:37,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304289117] [2020-01-16 18:59:37,241 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:37,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:37,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:37,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:37,242 INFO L87 Difference]: Start difference. First operand 396 states and 1371 transitions. Second operand 9 states. [2020-01-16 18:59:37,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:37,352 INFO L93 Difference]: Finished difference Result 631 states and 1859 transitions. [2020-01-16 18:59:37,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:37,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:37,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:37,353 INFO L225 Difference]: With dead ends: 631 [2020-01-16 18:59:37,354 INFO L226 Difference]: Without dead ends: 611 [2020-01-16 18:59:37,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:37,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-01-16 18:59:37,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 390. [2020-01-16 18:59:37,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 18:59:37,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1359 transitions. [2020-01-16 18:59:37,366 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1359 transitions. Word has length 22 [2020-01-16 18:59:37,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:37,367 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1359 transitions. [2020-01-16 18:59:37,367 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1359 transitions. [2020-01-16 18:59:37,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:37,368 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:37,368 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:37,368 INFO L426 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:37,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:37,369 INFO L82 PathProgramCache]: Analyzing trace with hash -118757500, now seen corresponding path program 67 times [2020-01-16 18:59:37,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:37,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327833094] [2020-01-16 18:59:37,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:37,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327833094] [2020-01-16 18:59:37,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:37,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:37,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848908149] [2020-01-16 18:59:37,652 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:37,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:37,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:37,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:37,653 INFO L87 Difference]: Start difference. First operand 390 states and 1359 transitions. Second operand 9 states. [2020-01-16 18:59:37,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:37,759 INFO L93 Difference]: Finished difference Result 612 states and 1824 transitions. [2020-01-16 18:59:37,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:37,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:37,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:37,761 INFO L225 Difference]: With dead ends: 612 [2020-01-16 18:59:37,761 INFO L226 Difference]: Without dead ends: 601 [2020-01-16 18:59:37,762 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:37,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-01-16 18:59:37,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 394. [2020-01-16 18:59:37,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 18:59:37,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1369 transitions. [2020-01-16 18:59:37,770 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1369 transitions. Word has length 22 [2020-01-16 18:59:37,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:37,771 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1369 transitions. [2020-01-16 18:59:37,771 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:37,771 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1369 transitions. [2020-01-16 18:59:37,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:37,771 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:37,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, 1, 1, 1] [2020-01-16 18:59:37,772 INFO L426 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:37,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:37,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1223175288, now seen corresponding path program 68 times [2020-01-16 18:59:37,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:37,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26965841] [2020-01-16 18:59:37,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:38,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-01-16 18:59:38,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26965841] [2020-01-16 18:59:38,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:38,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:38,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87420527] [2020-01-16 18:59:38,067 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:38,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:38,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:38,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:38,067 INFO L87 Difference]: Start difference. First operand 394 states and 1369 transitions. Second operand 9 states. [2020-01-16 18:59:38,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:38,173 INFO L93 Difference]: Finished difference Result 611 states and 1820 transitions. [2020-01-16 18:59:38,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:38,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:38,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:38,175 INFO L225 Difference]: With dead ends: 611 [2020-01-16 18:59:38,175 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 18:59:38,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:38,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 18:59:38,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 392. [2020-01-16 18:59:38,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 18:59:38,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1364 transitions. [2020-01-16 18:59:38,185 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1364 transitions. Word has length 22 [2020-01-16 18:59:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:38,185 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1364 transitions. [2020-01-16 18:59:38,185 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1364 transitions. [2020-01-16 18:59:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:38,186 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:38,186 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:38,186 INFO L426 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:38,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:38,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1489557682, now seen corresponding path program 69 times [2020-01-16 18:59:38,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:38,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598447273] [2020-01-16 18:59:38,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:38,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598447273] [2020-01-16 18:59:38,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:38,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:38,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137846368] [2020-01-16 18:59:38,504 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:38,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:38,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:38,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:38,505 INFO L87 Difference]: Start difference. First operand 392 states and 1364 transitions. Second operand 9 states. [2020-01-16 18:59:38,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:38,609 INFO L93 Difference]: Finished difference Result 617 states and 1833 transitions. [2020-01-16 18:59:38,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:38,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:38,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:38,610 INFO L225 Difference]: With dead ends: 617 [2020-01-16 18:59:38,610 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 18:59:38,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:38,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 18:59:38,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 395. [2020-01-16 18:59:38,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 18:59:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1369 transitions. [2020-01-16 18:59:38,620 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1369 transitions. Word has length 22 [2020-01-16 18:59:38,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:38,620 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1369 transitions. [2020-01-16 18:59:38,621 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:38,621 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1369 transitions. [2020-01-16 18:59:38,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:38,621 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:38,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, 1, 1, 1] [2020-01-16 18:59:38,622 INFO L426 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:38,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:38,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1938849630, now seen corresponding path program 70 times [2020-01-16 18:59:38,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:38,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478464558] [2020-01-16 18:59:38,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:38,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:38,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478464558] [2020-01-16 18:59:38,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:38,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:38,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995719954] [2020-01-16 18:59:38,906 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:38,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:38,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:38,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:38,906 INFO L87 Difference]: Start difference. First operand 395 states and 1369 transitions. Second operand 9 states. [2020-01-16 18:59:39,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:39,014 INFO L93 Difference]: Finished difference Result 620 states and 1836 transitions. [2020-01-16 18:59:39,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:39,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:39,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:39,016 INFO L225 Difference]: With dead ends: 620 [2020-01-16 18:59:39,017 INFO L226 Difference]: Without dead ends: 603 [2020-01-16 18:59:39,017 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:39,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-01-16 18:59:39,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 392. [2020-01-16 18:59:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 18:59:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1362 transitions. [2020-01-16 18:59:39,026 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1362 transitions. Word has length 22 [2020-01-16 18:59:39,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:39,027 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1362 transitions. [2020-01-16 18:59:39,027 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1362 transitions. [2020-01-16 18:59:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:39,027 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:39,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:39,028 INFO L426 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:39,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:39,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1758405090, now seen corresponding path program 71 times [2020-01-16 18:59:39,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:39,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029247220] [2020-01-16 18:59:39,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:39,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029247220] [2020-01-16 18:59:39,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:39,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:39,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053624189] [2020-01-16 18:59:39,337 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:39,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:39,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:39,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:39,338 INFO L87 Difference]: Start difference. First operand 392 states and 1362 transitions. Second operand 9 states. [2020-01-16 18:59:39,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:39,445 INFO L93 Difference]: Finished difference Result 614 states and 1824 transitions. [2020-01-16 18:59:39,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:39,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:39,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:39,446 INFO L225 Difference]: With dead ends: 614 [2020-01-16 18:59:39,447 INFO L226 Difference]: Without dead ends: 604 [2020-01-16 18:59:39,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:39,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-01-16 18:59:39,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 394. [2020-01-16 18:59:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 18:59:39,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1365 transitions. [2020-01-16 18:59:39,458 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1365 transitions. Word has length 22 [2020-01-16 18:59:39,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:39,458 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1365 transitions. [2020-01-16 18:59:39,458 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:39,458 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1365 transitions. [2020-01-16 18:59:39,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:39,459 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:39,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, 1, 1, 1] [2020-01-16 18:59:39,459 INFO L426 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:39,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:39,459 INFO L82 PathProgramCache]: Analyzing trace with hash 840454900, now seen corresponding path program 72 times [2020-01-16 18:59:39,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:39,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087447956] [2020-01-16 18:59:39,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:39,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-01-16 18:59:39,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087447956] [2020-01-16 18:59:39,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:39,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:39,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354333864] [2020-01-16 18:59:39,833 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:39,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:39,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:39,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:39,834 INFO L87 Difference]: Start difference. First operand 394 states and 1365 transitions. Second operand 9 states. [2020-01-16 18:59:39,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:39,948 INFO L93 Difference]: Finished difference Result 618 states and 1830 transitions. [2020-01-16 18:59:39,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:39,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:39,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:39,950 INFO L225 Difference]: With dead ends: 618 [2020-01-16 18:59:39,950 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 18:59:39,950 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 18:59:39,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 386. [2020-01-16 18:59:39,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 18:59:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1351 transitions. [2020-01-16 18:59:39,959 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1351 transitions. Word has length 22 [2020-01-16 18:59:39,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:39,959 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1351 transitions. [2020-01-16 18:59:39,959 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:39,959 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1351 transitions. [2020-01-16 18:59:39,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:39,960 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:39,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, 1, 1, 1] [2020-01-16 18:59:39,960 INFO L426 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:39,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:39,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1531024386, now seen corresponding path program 73 times [2020-01-16 18:59:39,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:39,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837975454] [2020-01-16 18:59:39,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:40,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837975454] [2020-01-16 18:59:40,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:40,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:40,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933759560] [2020-01-16 18:59:40,251 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:40,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:40,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:40,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:40,251 INFO L87 Difference]: Start difference. First operand 386 states and 1351 transitions. Second operand 9 states. [2020-01-16 18:59:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:40,326 INFO L93 Difference]: Finished difference Result 608 states and 1800 transitions. [2020-01-16 18:59:40,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:40,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:40,328 INFO L225 Difference]: With dead ends: 608 [2020-01-16 18:59:40,328 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 18:59:40,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:40,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 18:59:40,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 393. [2020-01-16 18:59:40,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 18:59:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1370 transitions. [2020-01-16 18:59:40,338 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1370 transitions. Word has length 22 [2020-01-16 18:59:40,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:40,338 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1370 transitions. [2020-01-16 18:59:40,338 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:40,339 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1370 transitions. [2020-01-16 18:59:40,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:40,339 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:40,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:40,340 INFO L426 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:40,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:40,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2092092878, now seen corresponding path program 74 times [2020-01-16 18:59:40,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:40,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346338767] [2020-01-16 18:59:40,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:40,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-01-16 18:59:40,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346338767] [2020-01-16 18:59:40,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:40,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:40,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715496059] [2020-01-16 18:59:40,664 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:40,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:40,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:40,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:40,665 INFO L87 Difference]: Start difference. First operand 393 states and 1370 transitions. Second operand 9 states. [2020-01-16 18:59:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:40,745 INFO L93 Difference]: Finished difference Result 601 states and 1785 transitions. [2020-01-16 18:59:40,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:40,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:40,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:40,746 INFO L225 Difference]: With dead ends: 601 [2020-01-16 18:59:40,747 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 18:59:40,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:40,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 18:59:40,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 391. [2020-01-16 18:59:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 18:59:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1366 transitions. [2020-01-16 18:59:40,756 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1366 transitions. Word has length 22 [2020-01-16 18:59:40,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:40,756 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1366 transitions. [2020-01-16 18:59:40,756 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1366 transitions. [2020-01-16 18:59:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:40,757 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:40,757 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:40,757 INFO L426 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:40,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:40,757 INFO L82 PathProgramCache]: Analyzing trace with hash -69413468, now seen corresponding path program 75 times [2020-01-16 18:59:40,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:40,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217846973] [2020-01-16 18:59:40,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:41,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-01-16 18:59:41,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217846973] [2020-01-16 18:59:41,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:41,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:41,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702471775] [2020-01-16 18:59:41,078 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:41,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:41,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:41,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:41,079 INFO L87 Difference]: Start difference. First operand 391 states and 1366 transitions. Second operand 9 states. [2020-01-16 18:59:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:41,158 INFO L93 Difference]: Finished difference Result 610 states and 1803 transitions. [2020-01-16 18:59:41,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:41,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:41,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:41,160 INFO L225 Difference]: With dead ends: 610 [2020-01-16 18:59:41,160 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 18:59:41,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:41,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 18:59:41,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 394. [2020-01-16 18:59:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 18:59:41,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1370 transitions. [2020-01-16 18:59:41,170 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1370 transitions. Word has length 22 [2020-01-16 18:59:41,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:41,170 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1370 transitions. [2020-01-16 18:59:41,171 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1370 transitions. [2020-01-16 18:59:41,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:41,171 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:41,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, 1, 1, 1] [2020-01-16 18:59:41,172 INFO L426 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:41,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:41,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1031617130, now seen corresponding path program 76 times [2020-01-16 18:59:41,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:41,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774162890] [2020-01-16 18:59:41,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:41,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:41,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774162890] [2020-01-16 18:59:41,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:41,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:41,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603933797] [2020-01-16 18:59:41,471 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:41,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:41,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:41,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:41,472 INFO L87 Difference]: Start difference. First operand 394 states and 1370 transitions. Second operand 9 states. [2020-01-16 18:59:41,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:41,574 INFO L93 Difference]: Finished difference Result 604 states and 1789 transitions. [2020-01-16 18:59:41,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:41,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:41,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:41,576 INFO L225 Difference]: With dead ends: 604 [2020-01-16 18:59:41,576 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 18:59:41,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:41,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 18:59:41,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 391. [2020-01-16 18:59:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 18:59:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1364 transitions. [2020-01-16 18:59:41,586 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1364 transitions. Word has length 22 [2020-01-16 18:59:41,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:41,586 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1364 transitions. [2020-01-16 18:59:41,586 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:41,586 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1364 transitions. [2020-01-16 18:59:41,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:41,587 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:41,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, 1, 1, 1] [2020-01-16 18:59:41,587 INFO L426 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:41,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:41,587 INFO L82 PathProgramCache]: Analyzing trace with hash -14691242, now seen corresponding path program 77 times [2020-01-16 18:59:41,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:41,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034365344] [2020-01-16 18:59:41,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:41,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-01-16 18:59:41,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034365344] [2020-01-16 18:59:41,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:41,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:41,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688851146] [2020-01-16 18:59:41,904 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:41,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:41,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:41,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:41,904 INFO L87 Difference]: Start difference. First operand 391 states and 1364 transitions. Second operand 9 states. [2020-01-16 18:59:42,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:42,008 INFO L93 Difference]: Finished difference Result 594 states and 1770 transitions. [2020-01-16 18:59:42,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:42,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:42,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:42,010 INFO L225 Difference]: With dead ends: 594 [2020-01-16 18:59:42,010 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 18:59:42,010 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:42,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 18:59:42,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 392. [2020-01-16 18:59:42,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 18:59:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1365 transitions. [2020-01-16 18:59:42,021 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1365 transitions. Word has length 22 [2020-01-16 18:59:42,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:42,021 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1365 transitions. [2020-01-16 18:59:42,021 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1365 transitions. [2020-01-16 18:59:42,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:42,022 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:42,022 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:42,022 INFO L426 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:42,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:42,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1596249716, now seen corresponding path program 78 times [2020-01-16 18:59:42,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:42,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907636795] [2020-01-16 18:59:42,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:42,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907636795] [2020-01-16 18:59:42,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:42,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:42,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589328804] [2020-01-16 18:59:42,393 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:42,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:42,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:42,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:42,394 INFO L87 Difference]: Start difference. First operand 392 states and 1365 transitions. Second operand 9 states. [2020-01-16 18:59:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:42,497 INFO L93 Difference]: Finished difference Result 595 states and 1771 transitions. [2020-01-16 18:59:42,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:42,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:42,499 INFO L225 Difference]: With dead ends: 595 [2020-01-16 18:59:42,499 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 18:59:42,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 18:59:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 389. [2020-01-16 18:59:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 18:59:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1360 transitions. [2020-01-16 18:59:42,509 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1360 transitions. Word has length 22 [2020-01-16 18:59:42,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:42,509 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1360 transitions. [2020-01-16 18:59:42,509 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:42,509 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1360 transitions. [2020-01-16 18:59:42,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:42,510 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:42,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, 1, 1, 1] [2020-01-16 18:59:42,510 INFO L426 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:42,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:42,511 INFO L82 PathProgramCache]: Analyzing trace with hash 933687728, now seen corresponding path program 79 times [2020-01-16 18:59:42,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:42,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218501255] [2020-01-16 18:59:42,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:42,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-01-16 18:59:42,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218501255] [2020-01-16 18:59:42,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:42,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:42,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701217516] [2020-01-16 18:59:42,799 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:42,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:42,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:42,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:42,800 INFO L87 Difference]: Start difference. First operand 389 states and 1360 transitions. Second operand 9 states. [2020-01-16 18:59:42,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:42,889 INFO L93 Difference]: Finished difference Result 618 states and 1821 transitions. [2020-01-16 18:59:42,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:42,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:42,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:42,891 INFO L225 Difference]: With dead ends: 618 [2020-01-16 18:59:42,891 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 18:59:42,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 18:59:42,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 394. [2020-01-16 18:59:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 18:59:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1370 transitions. [2020-01-16 18:59:42,901 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1370 transitions. Word has length 22 [2020-01-16 18:59:42,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:42,902 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1370 transitions. [2020-01-16 18:59:42,902 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:42,902 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1370 transitions. [2020-01-16 18:59:42,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:42,903 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:42,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, 1, 1, 1] [2020-01-16 18:59:42,903 INFO L426 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:42,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:42,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1494756220, now seen corresponding path program 80 times [2020-01-16 18:59:42,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:42,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091608599] [2020-01-16 18:59:42,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:43,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-01-16 18:59:43,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091608599] [2020-01-16 18:59:43,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:43,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:43,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971595517] [2020-01-16 18:59:43,178 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:43,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:43,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:43,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:43,179 INFO L87 Difference]: Start difference. First operand 394 states and 1370 transitions. Second operand 9 states. [2020-01-16 18:59:43,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:43,262 INFO L93 Difference]: Finished difference Result 611 states and 1806 transitions. [2020-01-16 18:59:43,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:43,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:43,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:43,264 INFO L225 Difference]: With dead ends: 611 [2020-01-16 18:59:43,264 INFO L226 Difference]: Without dead ends: 600 [2020-01-16 18:59:43,264 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:43,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-01-16 18:59:43,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 392. [2020-01-16 18:59:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 18:59:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1366 transitions. [2020-01-16 18:59:43,274 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1366 transitions. Word has length 22 [2020-01-16 18:59:43,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:43,275 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1366 transitions. [2020-01-16 18:59:43,276 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1366 transitions. [2020-01-16 18:59:43,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:43,277 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:43,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, 1, 1, 1] [2020-01-16 18:59:43,277 INFO L426 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:43,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:43,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1946380260, now seen corresponding path program 81 times [2020-01-16 18:59:43,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:43,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210455159] [2020-01-16 18:59:43,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:43,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:43,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210455159] [2020-01-16 18:59:43,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:43,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:43,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138202253] [2020-01-16 18:59:43,570 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:43,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:43,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:43,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:43,570 INFO L87 Difference]: Start difference. First operand 392 states and 1366 transitions. Second operand 9 states. [2020-01-16 18:59:43,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:43,647 INFO L93 Difference]: Finished difference Result 629 states and 1845 transitions. [2020-01-16 18:59:43,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:43,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:43,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:43,649 INFO L225 Difference]: With dead ends: 629 [2020-01-16 18:59:43,649 INFO L226 Difference]: Without dead ends: 613 [2020-01-16 18:59:43,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-01-16 18:59:43,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 400. [2020-01-16 18:59:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-01-16 18:59:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1379 transitions. [2020-01-16 18:59:43,659 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1379 transitions. Word has length 22 [2020-01-16 18:59:43,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:43,659 INFO L478 AbstractCegarLoop]: Abstraction has 400 states and 1379 transitions. [2020-01-16 18:59:43,659 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1379 transitions. [2020-01-16 18:59:43,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:43,660 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:43,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:43,660 INFO L426 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:43,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1816409814, now seen corresponding path program 82 times [2020-01-16 18:59:43,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:43,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908081636] [2020-01-16 18:59:43,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:43,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-01-16 18:59:43,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908081636] [2020-01-16 18:59:43,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:43,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:43,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287908955] [2020-01-16 18:59:43,956 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:43,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:43,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:43,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:43,956 INFO L87 Difference]: Start difference. First operand 400 states and 1379 transitions. Second operand 9 states. [2020-01-16 18:59:44,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:44,058 INFO L93 Difference]: Finished difference Result 627 states and 1835 transitions. [2020-01-16 18:59:44,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:44,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:44,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:44,060 INFO L225 Difference]: With dead ends: 627 [2020-01-16 18:59:44,061 INFO L226 Difference]: Without dead ends: 605 [2020-01-16 18:59:44,061 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-01-16 18:59:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 392. [2020-01-16 18:59:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 18:59:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1363 transitions. [2020-01-16 18:59:44,070 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1363 transitions. Word has length 22 [2020-01-16 18:59:44,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:44,070 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1363 transitions. [2020-01-16 18:59:44,070 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1363 transitions. [2020-01-16 18:59:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:44,071 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:44,071 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:44,071 INFO L426 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:44,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:44,072 INFO L82 PathProgramCache]: Analyzing trace with hash 2001102486, now seen corresponding path program 83 times [2020-01-16 18:59:44,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:44,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534831377] [2020-01-16 18:59:44,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:44,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-01-16 18:59:44,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534831377] [2020-01-16 18:59:44,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:44,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:44,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887633393] [2020-01-16 18:59:44,363 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:44,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:44,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:44,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:44,364 INFO L87 Difference]: Start difference. First operand 392 states and 1363 transitions. Second operand 9 states. [2020-01-16 18:59:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:44,446 INFO L93 Difference]: Finished difference Result 608 states and 1798 transitions. [2020-01-16 18:59:44,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:44,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:44,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:44,448 INFO L225 Difference]: With dead ends: 608 [2020-01-16 18:59:44,448 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 18:59:44,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:44,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 18:59:44,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 393. [2020-01-16 18:59:44,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 18:59:44,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1364 transitions. [2020-01-16 18:59:44,461 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1364 transitions. Word has length 22 [2020-01-16 18:59:44,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:44,461 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1364 transitions. [2020-01-16 18:59:44,461 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:44,461 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1364 transitions. [2020-01-16 18:59:44,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:44,462 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:44,462 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:44,462 INFO L426 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:44,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:44,463 INFO L82 PathProgramCache]: Analyzing trace with hash 925391330, now seen corresponding path program 84 times [2020-01-16 18:59:44,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:44,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602017396] [2020-01-16 18:59:44,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:44,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-01-16 18:59:44,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602017396] [2020-01-16 18:59:44,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:44,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:44,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051137933] [2020-01-16 18:59:44,796 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:44,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:44,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:44,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:44,797 INFO L87 Difference]: Start difference. First operand 393 states and 1364 transitions. Second operand 9 states. [2020-01-16 18:59:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:44,903 INFO L93 Difference]: Finished difference Result 613 states and 1807 transitions. [2020-01-16 18:59:44,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:44,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:44,905 INFO L225 Difference]: With dead ends: 613 [2020-01-16 18:59:44,905 INFO L226 Difference]: Without dead ends: 595 [2020-01-16 18:59:44,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:44,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-01-16 18:59:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 389. [2020-01-16 18:59:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 18:59:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1357 transitions. [2020-01-16 18:59:44,915 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1357 transitions. Word has length 22 [2020-01-16 18:59:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:44,915 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1357 transitions. [2020-01-16 18:59:44,915 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:44,915 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1357 transitions. [2020-01-16 18:59:44,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:44,916 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:44,916 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:44,916 INFO L426 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:44,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:44,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1259283952, now seen corresponding path program 85 times [2020-01-16 18:59:44,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:44,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292004540] [2020-01-16 18:59:44,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:45,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-01-16 18:59:45,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292004540] [2020-01-16 18:59:45,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:45,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:45,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307331996] [2020-01-16 18:59:45,206 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:45,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:45,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:45,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:45,207 INFO L87 Difference]: Start difference. First operand 389 states and 1357 transitions. Second operand 9 states. [2020-01-16 18:59:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:45,304 INFO L93 Difference]: Finished difference Result 624 states and 1835 transitions. [2020-01-16 18:59:45,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:45,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:45,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:45,306 INFO L225 Difference]: With dead ends: 624 [2020-01-16 18:59:45,306 INFO L226 Difference]: Without dead ends: 608 [2020-01-16 18:59:45,306 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:45,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-01-16 18:59:45,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 396. [2020-01-16 18:59:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 18:59:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1373 transitions. [2020-01-16 18:59:45,316 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1373 transitions. Word has length 22 [2020-01-16 18:59:45,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:45,317 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1373 transitions. [2020-01-16 18:59:45,317 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:45,317 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1373 transitions. [2020-01-16 18:59:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:45,318 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:45,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, 1, 1, 1] [2020-01-16 18:59:45,318 INFO L426 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:45,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:45,318 INFO L82 PathProgramCache]: Analyzing trace with hash 297080290, now seen corresponding path program 86 times [2020-01-16 18:59:45,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:45,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812860033] [2020-01-16 18:59:45,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:45,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-01-16 18:59:45,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812860033] [2020-01-16 18:59:45,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:45,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:45,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982837542] [2020-01-16 18:59:45,600 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:45,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:45,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:45,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:45,601 INFO L87 Difference]: Start difference. First operand 396 states and 1373 transitions. Second operand 9 states. [2020-01-16 18:59:45,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:45,700 INFO L93 Difference]: Finished difference Result 618 states and 1821 transitions. [2020-01-16 18:59:45,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:45,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:45,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:45,702 INFO L225 Difference]: With dead ends: 618 [2020-01-16 18:59:45,703 INFO L226 Difference]: Without dead ends: 605 [2020-01-16 18:59:45,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-01-16 18:59:45,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 393. [2020-01-16 18:59:45,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 18:59:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1366 transitions. [2020-01-16 18:59:45,712 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1366 transitions. Word has length 22 [2020-01-16 18:59:45,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:45,712 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1366 transitions. [2020-01-16 18:59:45,712 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:45,713 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1366 transitions. [2020-01-16 18:59:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:45,713 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:45,713 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:45,713 INFO L426 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:45,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:45,714 INFO L82 PathProgramCache]: Analyzing trace with hash -422552958, now seen corresponding path program 87 times [2020-01-16 18:59:45,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:45,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885223459] [2020-01-16 18:59:45,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:46,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-01-16 18:59:46,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885223459] [2020-01-16 18:59:46,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:46,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:46,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780301659] [2020-01-16 18:59:46,018 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:46,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:46,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:46,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:46,018 INFO L87 Difference]: Start difference. First operand 393 states and 1366 transitions. Second operand 9 states. [2020-01-16 18:59:46,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:46,096 INFO L93 Difference]: Finished difference Result 633 states and 1853 transitions. [2020-01-16 18:59:46,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:46,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:46,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:46,098 INFO L225 Difference]: With dead ends: 633 [2020-01-16 18:59:46,098 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 18:59:46,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:46,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 18:59:46,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 401. [2020-01-16 18:59:46,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-01-16 18:59:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1379 transitions. [2020-01-16 18:59:46,108 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1379 transitions. Word has length 22 [2020-01-16 18:59:46,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:46,108 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 1379 transitions. [2020-01-16 18:59:46,108 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:46,108 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1379 transitions. [2020-01-16 18:59:46,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:46,109 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:46,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, 1, 1, 1] [2020-01-16 18:59:46,109 INFO L426 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:46,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:46,110 INFO L82 PathProgramCache]: Analyzing trace with hash -552523404, now seen corresponding path program 88 times [2020-01-16 18:59:46,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:46,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927635847] [2020-01-16 18:59:46,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:46,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927635847] [2020-01-16 18:59:46,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:46,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:46,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885239178] [2020-01-16 18:59:46,393 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:46,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:46,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:46,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:46,394 INFO L87 Difference]: Start difference. First operand 401 states and 1379 transitions. Second operand 9 states. [2020-01-16 18:59:46,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:46,518 INFO L93 Difference]: Finished difference Result 631 states and 1843 transitions. [2020-01-16 18:59:46,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:46,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:46,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:46,520 INFO L225 Difference]: With dead ends: 631 [2020-01-16 18:59:46,520 INFO L226 Difference]: Without dead ends: 609 [2020-01-16 18:59:46,520 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:46,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-01-16 18:59:46,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 393. [2020-01-16 18:59:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 18:59:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1362 transitions. [2020-01-16 18:59:46,530 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1362 transitions. Word has length 22 [2020-01-16 18:59:46,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:46,530 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1362 transitions. [2020-01-16 18:59:46,530 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:46,530 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1362 transitions. [2020-01-16 18:59:46,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:46,531 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:46,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, 1, 1, 1] [2020-01-16 18:59:46,531 INFO L426 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:46,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:46,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1316914946, now seen corresponding path program 89 times [2020-01-16 18:59:46,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:46,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200959992] [2020-01-16 18:59:46,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:46,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200959992] [2020-01-16 18:59:46,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:46,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:46,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171640220] [2020-01-16 18:59:46,823 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:46,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:46,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:46,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:46,824 INFO L87 Difference]: Start difference. First operand 393 states and 1362 transitions. Second operand 9 states. [2020-01-16 18:59:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:46,936 INFO L93 Difference]: Finished difference Result 615 states and 1812 transitions. [2020-01-16 18:59:46,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:46,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:46,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:46,939 INFO L225 Difference]: With dead ends: 615 [2020-01-16 18:59:46,939 INFO L226 Difference]: Without dead ends: 605 [2020-01-16 18:59:46,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:46,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-01-16 18:59:46,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 395. [2020-01-16 18:59:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 18:59:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1365 transitions. [2020-01-16 18:59:46,955 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1365 transitions. Word has length 22 [2020-01-16 18:59:46,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:46,955 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1365 transitions. [2020-01-16 18:59:46,955 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:46,955 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1365 transitions. [2020-01-16 18:59:46,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:46,956 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:46,956 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:46,956 INFO L426 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:46,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:46,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2060102160, now seen corresponding path program 90 times [2020-01-16 18:59:46,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:46,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164701566] [2020-01-16 18:59:46,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:47,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:47,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164701566] [2020-01-16 18:59:47,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:47,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:47,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219936480] [2020-01-16 18:59:47,238 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:47,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:47,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:47,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:47,238 INFO L87 Difference]: Start difference. First operand 395 states and 1365 transitions. Second operand 9 states. [2020-01-16 18:59:47,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:47,345 INFO L93 Difference]: Finished difference Result 619 states and 1818 transitions. [2020-01-16 18:59:47,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:47,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:47,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:47,347 INFO L225 Difference]: With dead ends: 619 [2020-01-16 18:59:47,347 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 18:59:47,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:47,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 18:59:47,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 389. [2020-01-16 18:59:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 18:59:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1354 transitions. [2020-01-16 18:59:47,357 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1354 transitions. Word has length 22 [2020-01-16 18:59:47,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:47,358 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1354 transitions. [2020-01-16 18:59:47,358 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:47,358 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1354 transitions. [2020-01-16 18:59:47,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:47,358 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:47,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, 1, 1, 1] [2020-01-16 18:59:47,359 INFO L426 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:47,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:47,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1497826180, now seen corresponding path program 91 times [2020-01-16 18:59:47,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:47,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819463620] [2020-01-16 18:59:47,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59: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-01-16 18:59:47,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819463620] [2020-01-16 18:59:47,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:47,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:47,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104805442] [2020-01-16 18:59:47,671 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:47,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:47,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:47,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:47,672 INFO L87 Difference]: Start difference. First operand 389 states and 1354 transitions. Second operand 9 states. [2020-01-16 18:59:47,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:47,756 INFO L93 Difference]: Finished difference Result 589 states and 1756 transitions. [2020-01-16 18:59:47,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:47,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:47,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:47,758 INFO L225 Difference]: With dead ends: 589 [2020-01-16 18:59:47,758 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 18:59:47,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:47,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 18:59:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 391. [2020-01-16 18:59:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 18:59:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1358 transitions. [2020-01-16 18:59:47,771 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1358 transitions. Word has length 22 [2020-01-16 18:59:47,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:47,771 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1358 transitions. [2020-01-16 18:59:47,771 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:47,771 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1358 transitions. [2020-01-16 18:59:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:47,772 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:47,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, 1, 1, 1] [2020-01-16 18:59:47,772 INFO L426 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:47,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:47,773 INFO L82 PathProgramCache]: Analyzing trace with hash 113114778, now seen corresponding path program 92 times [2020-01-16 18:59:47,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:47,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067146185] [2020-01-16 18:59:47,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:48,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-01-16 18:59:48,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067146185] [2020-01-16 18:59:48,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:48,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:48,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287275587] [2020-01-16 18:59:48,068 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:48,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:48,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:48,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:48,069 INFO L87 Difference]: Start difference. First operand 391 states and 1358 transitions. Second operand 9 states. [2020-01-16 18:59:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:48,179 INFO L93 Difference]: Finished difference Result 590 states and 1757 transitions. [2020-01-16 18:59:48,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:48,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:48,180 INFO L225 Difference]: With dead ends: 590 [2020-01-16 18:59:48,181 INFO L226 Difference]: Without dead ends: 579 [2020-01-16 18:59:48,181 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:48,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-01-16 18:59:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 390. [2020-01-16 18:59:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 18:59:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1356 transitions. [2020-01-16 18:59:48,190 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1356 transitions. Word has length 22 [2020-01-16 18:59:48,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:48,190 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1356 transitions. [2020-01-16 18:59:48,190 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1356 transitions. [2020-01-16 18:59:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:48,191 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:48,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, 1, 1, 1] [2020-01-16 18:59:48,191 INFO L426 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:48,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:48,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1115304206, now seen corresponding path program 93 times [2020-01-16 18:59:48,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:48,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689022870] [2020-01-16 18:59:48,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:48,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689022870] [2020-01-16 18:59:48,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:48,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:48,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198140811] [2020-01-16 18:59:48,470 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:48,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:48,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:48,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:48,471 INFO L87 Difference]: Start difference. First operand 390 states and 1356 transitions. Second operand 9 states. [2020-01-16 18:59:48,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:48,553 INFO L93 Difference]: Finished difference Result 593 states and 1763 transitions. [2020-01-16 18:59:48,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:48,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:48,555 INFO L225 Difference]: With dead ends: 593 [2020-01-16 18:59:48,555 INFO L226 Difference]: Without dead ends: 584 [2020-01-16 18:59:48,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:48,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-01-16 18:59:48,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 391. [2020-01-16 18:59:48,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 18:59:48,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1357 transitions. [2020-01-16 18:59:48,565 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1357 transitions. Word has length 22 [2020-01-16 18:59:48,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:48,565 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1357 transitions. [2020-01-16 18:59:48,566 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:48,566 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1357 transitions. [2020-01-16 18:59:48,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:48,566 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:48,567 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:48,567 INFO L426 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:48,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:48,567 INFO L82 PathProgramCache]: Analyzing trace with hash 39593050, now seen corresponding path program 94 times [2020-01-16 18:59:48,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:48,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082678032] [2020-01-16 18:59:48,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:48,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082678032] [2020-01-16 18:59:48,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:48,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:48,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115346744] [2020-01-16 18:59:48,845 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:48,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:48,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:48,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:48,845 INFO L87 Difference]: Start difference. First operand 391 states and 1357 transitions. Second operand 9 states. [2020-01-16 18:59:48,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:48,959 INFO L93 Difference]: Finished difference Result 598 states and 1772 transitions. [2020-01-16 18:59:48,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:48,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:48,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:48,961 INFO L225 Difference]: With dead ends: 598 [2020-01-16 18:59:48,961 INFO L226 Difference]: Without dead ends: 583 [2020-01-16 18:59:48,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-01-16 18:59:48,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 390. [2020-01-16 18:59:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 18:59:48,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1355 transitions. [2020-01-16 18:59:48,970 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1355 transitions. Word has length 22 [2020-01-16 18:59:48,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:48,970 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1355 transitions. [2020-01-16 18:59:48,970 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:48,970 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1355 transitions. [2020-01-16 18:59:48,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:48,971 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:48,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, 1, 1, 1] [2020-01-16 18:59:48,972 INFO L426 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:48,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:48,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1125807310, now seen corresponding path program 95 times [2020-01-16 18:59:48,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:48,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420554149] [2020-01-16 18:59:48,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:49,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-01-16 18:59:49,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420554149] [2020-01-16 18:59:49,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:49,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:49,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138218338] [2020-01-16 18:59:49,242 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:49,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:49,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:49,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:49,243 INFO L87 Difference]: Start difference. First operand 390 states and 1355 transitions. Second operand 9 states. [2020-01-16 18:59:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:49,361 INFO L93 Difference]: Finished difference Result 596 states and 1769 transitions. [2020-01-16 18:59:49,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:49,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:49,363 INFO L225 Difference]: With dead ends: 596 [2020-01-16 18:59:49,364 INFO L226 Difference]: Without dead ends: 586 [2020-01-16 18:59:49,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:49,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-01-16 18:59:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 392. [2020-01-16 18:59:49,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 18:59:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1358 transitions. [2020-01-16 18:59:49,374 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1358 transitions. Word has length 22 [2020-01-16 18:59:49,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:49,374 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1358 transitions. [2020-01-16 18:59:49,374 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1358 transitions. [2020-01-16 18:59:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:49,375 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:49,375 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:49,375 INFO L426 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:49,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:49,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1560844804, now seen corresponding path program 96 times [2020-01-16 18:59:49,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:49,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778198452] [2020-01-16 18:59:49,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:49,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-01-16 18:59:49,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778198452] [2020-01-16 18:59:49,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:49,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:49,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895322762] [2020-01-16 18:59:49,649 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:49,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:49,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:49,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:49,650 INFO L87 Difference]: Start difference. First operand 392 states and 1358 transitions. Second operand 9 states. [2020-01-16 18:59:49,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:49,760 INFO L93 Difference]: Finished difference Result 600 states and 1775 transitions. [2020-01-16 18:59:49,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:49,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:49,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:49,762 INFO L225 Difference]: With dead ends: 600 [2020-01-16 18:59:49,762 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 18:59:49,762 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:49,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 18:59:49,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 386. [2020-01-16 18:59:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 18:59:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1348 transitions. [2020-01-16 18:59:49,772 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1348 transitions. Word has length 22 [2020-01-16 18:59:49,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:49,772 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1348 transitions. [2020-01-16 18:59:49,772 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1348 transitions. [2020-01-16 18:59:49,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:49,773 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:49,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, 1, 1, 1] [2020-01-16 18:59:49,773 INFO L426 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:49,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:49,773 INFO L82 PathProgramCache]: Analyzing trace with hash -951136412, now seen corresponding path program 97 times [2020-01-16 18:59:49,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:49,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256633907] [2020-01-16 18:59:49,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:50,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-01-16 18:59:50,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256633907] [2020-01-16 18:59:50,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:50,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:50,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237832883] [2020-01-16 18:59:50,085 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:50,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:50,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:50,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:50,085 INFO L87 Difference]: Start difference. First operand 386 states and 1348 transitions. Second operand 9 states. [2020-01-16 18:59:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:50,189 INFO L93 Difference]: Finished difference Result 570 states and 1716 transitions. [2020-01-16 18:59:50,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:50,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:50,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:50,191 INFO L225 Difference]: With dead ends: 570 [2020-01-16 18:59:50,191 INFO L226 Difference]: Without dead ends: 559 [2020-01-16 18:59:50,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:50,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-01-16 18:59:50,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 389. [2020-01-16 18:59:50,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 18:59:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-01-16 18:59:50,202 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-01-16 18:59:50,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:50,202 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-01-16 18:59:50,202 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:50,202 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-01-16 18:59:50,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:50,203 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:50,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, 1, 1, 1] [2020-01-16 18:59:50,203 INFO L426 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:50,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:50,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1898313874, now seen corresponding path program 98 times [2020-01-16 18:59:50,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:50,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709629499] [2020-01-16 18:59:50,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:50,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-01-16 18:59:50,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709629499] [2020-01-16 18:59:50,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:50,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:50,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420232240] [2020-01-16 18:59:50,522 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:50,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:50,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:50,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:50,522 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-01-16 18:59:50,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:50,602 INFO L93 Difference]: Finished difference Result 568 states and 1711 transitions. [2020-01-16 18:59:50,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:50,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:50,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:50,603 INFO L225 Difference]: With dead ends: 568 [2020-01-16 18:59:50,604 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 18:59:50,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:50,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 18:59:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 388. [2020-01-16 18:59:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 18:59:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1354 transitions. [2020-01-16 18:59:50,613 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1354 transitions. Word has length 22 [2020-01-16 18:59:50,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:50,613 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1354 transitions. [2020-01-16 18:59:50,613 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:50,614 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1354 transitions. [2020-01-16 18:59:50,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:50,614 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:50,614 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:50,614 INFO L426 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:50,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:50,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1743393030, now seen corresponding path program 99 times [2020-01-16 18:59:50,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:50,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910133029] [2020-01-16 18:59:50,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:50,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:50,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910133029] [2020-01-16 18:59:50,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:50,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:50,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628873198] [2020-01-16 18:59:50,937 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:50,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:50,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:50,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:50,937 INFO L87 Difference]: Start difference. First operand 388 states and 1354 transitions. Second operand 9 states. [2020-01-16 18:59:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:51,058 INFO L93 Difference]: Finished difference Result 572 states and 1720 transitions. [2020-01-16 18:59:51,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:51,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:51,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:51,060 INFO L225 Difference]: With dead ends: 572 [2020-01-16 18:59:51,060 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 18:59:51,060 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:51,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 18:59:51,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 390. [2020-01-16 18:59:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 18:59:51,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1357 transitions. [2020-01-16 18:59:51,069 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1357 transitions. Word has length 22 [2020-01-16 18:59:51,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:51,069 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1357 transitions. [2020-01-16 18:59:51,070 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:51,070 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1357 transitions. [2020-01-16 18:59:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:51,070 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:51,070 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:51,070 INFO L426 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:51,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:51,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1996485782, now seen corresponding path program 100 times [2020-01-16 18:59:51,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:51,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459093332] [2020-01-16 18:59:51,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:51,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459093332] [2020-01-16 18:59:51,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:51,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:51,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066914603] [2020-01-16 18:59:51,361 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:51,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:51,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:51,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:51,362 INFO L87 Difference]: Start difference. First operand 390 states and 1357 transitions. Second operand 9 states. [2020-01-16 18:59:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:51,478 INFO L93 Difference]: Finished difference Result 571 states and 1716 transitions. [2020-01-16 18:59:51,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:51,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:51,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:51,480 INFO L225 Difference]: With dead ends: 571 [2020-01-16 18:59:51,480 INFO L226 Difference]: Without dead ends: 559 [2020-01-16 18:59:51,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:51,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-01-16 18:59:51,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 388. [2020-01-16 18:59:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 18:59:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1353 transitions. [2020-01-16 18:59:51,491 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1353 transitions. Word has length 22 [2020-01-16 18:59:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:51,491 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1353 transitions. [2020-01-16 18:59:51,491 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1353 transitions. [2020-01-16 18:59:51,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:51,492 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:51,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, 1, 1, 1] [2020-01-16 18:59:51,492 INFO L426 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:51,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:51,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1302561834, now seen corresponding path program 101 times [2020-01-16 18:59:51,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:51,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322226473] [2020-01-16 18:59:51,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:51,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-01-16 18:59:51,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322226473] [2020-01-16 18:59:51,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:51,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:51,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001216218] [2020-01-16 18:59:51,822 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:51,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:51,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:51,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:51,822 INFO L87 Difference]: Start difference. First operand 388 states and 1353 transitions. Second operand 9 states. [2020-01-16 18:59:51,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:51,911 INFO L93 Difference]: Finished difference Result 567 states and 1708 transitions. [2020-01-16 18:59:51,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:51,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:51,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:51,912 INFO L225 Difference]: With dead ends: 567 [2020-01-16 18:59:51,913 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 18:59:51,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:51,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 18:59:51,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 389. [2020-01-16 18:59:51,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 18:59:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1354 transitions. [2020-01-16 18:59:51,922 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1354 transitions. Word has length 22 [2020-01-16 18:59:51,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:51,922 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1354 transitions. [2020-01-16 18:59:51,923 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1354 transitions. [2020-01-16 18:59:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:51,923 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:51,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, 1, 1, 1] [2020-01-16 18:59:51,923 INFO L426 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:51,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:51,924 INFO L82 PathProgramCache]: Analyzing trace with hash 308379124, now seen corresponding path program 102 times [2020-01-16 18:59:51,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:51,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518201553] [2020-01-16 18:59:51,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:52,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518201553] [2020-01-16 18:59:52,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:52,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:52,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440306365] [2020-01-16 18:59:52,240 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:52,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:52,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:52,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:52,241 INFO L87 Difference]: Start difference. First operand 389 states and 1354 transitions. Second operand 9 states. [2020-01-16 18:59:52,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:52,346 INFO L93 Difference]: Finished difference Result 568 states and 1709 transitions. [2020-01-16 18:59:52,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:52,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:52,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:52,348 INFO L225 Difference]: With dead ends: 568 [2020-01-16 18:59:52,348 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 18:59:52,349 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:52,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 18:59:52,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 387. [2020-01-16 18:59:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 18:59:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1351 transitions. [2020-01-16 18:59:52,358 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1351 transitions. Word has length 22 [2020-01-16 18:59:52,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:52,358 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1351 transitions. [2020-01-16 18:59:52,358 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:52,358 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1351 transitions. [2020-01-16 18:59:52,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:52,358 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:52,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, 1, 1, 1] [2020-01-16 18:59:52,359 INFO L426 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:52,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:52,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1548473070, now seen corresponding path program 103 times [2020-01-16 18:59:52,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:52,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052906122] [2020-01-16 18:59:52,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:52,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-01-16 18:59:52,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052906122] [2020-01-16 18:59:52,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:52,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:52,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262810824] [2020-01-16 18:59:52,640 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:52,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:52,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:52,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:52,641 INFO L87 Difference]: Start difference. First operand 387 states and 1351 transitions. Second operand 9 states. [2020-01-16 18:59:52,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:52,741 INFO L93 Difference]: Finished difference Result 575 states and 1726 transitions. [2020-01-16 18:59:52,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:52,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:52,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:52,743 INFO L225 Difference]: With dead ends: 575 [2020-01-16 18:59:52,743 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 18:59:52,743 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:52,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 18:59:52,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 389. [2020-01-16 18:59:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 18:59:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1355 transitions. [2020-01-16 18:59:52,752 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1355 transitions. Word has length 22 [2020-01-16 18:59:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:52,752 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1355 transitions. [2020-01-16 18:59:52,752 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1355 transitions. [2020-01-16 18:59:52,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:52,753 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:52,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, 1, 1, 1] [2020-01-16 18:59:52,753 INFO L426 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:52,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:52,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1300977216, now seen corresponding path program 104 times [2020-01-16 18:59:52,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:52,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246527779] [2020-01-16 18:59:52,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:53,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-01-16 18:59:53,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246527779] [2020-01-16 18:59:53,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:53,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:53,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57643681] [2020-01-16 18:59:53,032 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:53,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:53,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:53,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:53,033 INFO L87 Difference]: Start difference. First operand 389 states and 1355 transitions. Second operand 9 states. [2020-01-16 18:59:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:53,116 INFO L93 Difference]: Finished difference Result 573 states and 1721 transitions. [2020-01-16 18:59:53,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:53,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:53,117 INFO L225 Difference]: With dead ends: 573 [2020-01-16 18:59:53,118 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 18:59:53,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:53,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 18:59:53,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 388. [2020-01-16 18:59:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 18:59:53,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1353 transitions. [2020-01-16 18:59:53,127 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1353 transitions. Word has length 22 [2020-01-16 18:59:53,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:53,127 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1353 transitions. [2020-01-16 18:59:53,127 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1353 transitions. [2020-01-16 18:59:53,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:53,128 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:53,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, 1, 1, 1] [2020-01-16 18:59:53,128 INFO L426 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:53,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:53,128 INFO L82 PathProgramCache]: Analyzing trace with hash -535780538, now seen corresponding path program 105 times [2020-01-16 18:59:53,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:53,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714580622] [2020-01-16 18:59:53,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:53,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-01-16 18:59:53,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714580622] [2020-01-16 18:59:53,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:53,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:53,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768584573] [2020-01-16 18:59:53,407 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:53,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:53,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:53,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:53,408 INFO L87 Difference]: Start difference. First operand 388 states and 1353 transitions. Second operand 9 states. [2020-01-16 18:59:53,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:53,512 INFO L93 Difference]: Finished difference Result 582 states and 1741 transitions. [2020-01-16 18:59:53,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:53,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:53,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:53,513 INFO L225 Difference]: With dead ends: 582 [2020-01-16 18:59:53,514 INFO L226 Difference]: Without dead ends: 571 [2020-01-16 18:59:53,514 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:53,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-01-16 18:59:53,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 391. [2020-01-16 18:59:53,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 18:59:53,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1358 transitions. [2020-01-16 18:59:53,523 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1358 transitions. Word has length 22 [2020-01-16 18:59:53,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:53,523 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1358 transitions. [2020-01-16 18:59:53,523 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1358 transitions. [2020-01-16 18:59:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:53,524 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:53,524 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:53,524 INFO L426 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:53,525 INFO L82 PathProgramCache]: Analyzing trace with hash 850254592, now seen corresponding path program 106 times [2020-01-16 18:59:53,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:53,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302172867] [2020-01-16 18:59:53,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:53,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-01-16 18:59:53,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302172867] [2020-01-16 18:59:53,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:53,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:53,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390762129] [2020-01-16 18:59:53,800 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:53,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:53,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:53,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:53,801 INFO L87 Difference]: Start difference. First operand 391 states and 1358 transitions. Second operand 9 states. [2020-01-16 18:59:53,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:53,903 INFO L93 Difference]: Finished difference Result 585 states and 1744 transitions. [2020-01-16 18:59:53,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:53,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:53,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:53,905 INFO L225 Difference]: With dead ends: 585 [2020-01-16 18:59:53,905 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 18:59:53,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 18:59:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 388. [2020-01-16 18:59:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 18:59:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1352 transitions. [2020-01-16 18:59:53,916 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1352 transitions. Word has length 22 [2020-01-16 18:59:53,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:53,916 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1352 transitions. [2020-01-16 18:59:53,916 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:53,916 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1352 transitions. [2020-01-16 18:59:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:53,917 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:53,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, 1, 1, 1] [2020-01-16 18:59:53,917 INFO L426 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:53,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:53,917 INFO L82 PathProgramCache]: Analyzing trace with hash 713231894, now seen corresponding path program 107 times [2020-01-16 18:59:53,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:53,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45741747] [2020-01-16 18:59:53,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:54,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-01-16 18:59:54,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45741747] [2020-01-16 18:59:54,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:54,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:54,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800327677] [2020-01-16 18:59:54,199 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:54,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:54,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:54,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:54,199 INFO L87 Difference]: Start difference. First operand 388 states and 1352 transitions. Second operand 9 states. [2020-01-16 18:59:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:54,274 INFO L93 Difference]: Finished difference Result 576 states and 1726 transitions. [2020-01-16 18:59:54,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:54,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:54,276 INFO L225 Difference]: With dead ends: 576 [2020-01-16 18:59:54,276 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 18:59:54,277 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:54,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 18:59:54,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 389. [2020-01-16 18:59:54,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 18:59:54,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1353 transitions. [2020-01-16 18:59:54,286 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1353 transitions. Word has length 22 [2020-01-16 18:59:54,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:54,286 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1353 transitions. [2020-01-16 18:59:54,286 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1353 transitions. [2020-01-16 18:59:54,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:54,287 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:54,287 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:54,287 INFO L426 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:54,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:54,287 INFO L82 PathProgramCache]: Analyzing trace with hash -362479262, now seen corresponding path program 108 times [2020-01-16 18:59:54,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:54,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40569046] [2020-01-16 18:59:54,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:54,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-01-16 18:59:54,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40569046] [2020-01-16 18:59:54,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:54,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:54,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535833321] [2020-01-16 18:59:54,591 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:54,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:54,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:54,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:54,591 INFO L87 Difference]: Start difference. First operand 389 states and 1353 transitions. Second operand 9 states. [2020-01-16 18:59:54,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:54,698 INFO L93 Difference]: Finished difference Result 581 states and 1735 transitions. [2020-01-16 18:59:54,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:54,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:54,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:54,700 INFO L225 Difference]: With dead ends: 581 [2020-01-16 18:59:54,700 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 18:59:54,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:54,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 18:59:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 387. [2020-01-16 18:59:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 18:59:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1350 transitions. [2020-01-16 18:59:54,711 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1350 transitions. Word has length 22 [2020-01-16 18:59:54,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:54,712 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1350 transitions. [2020-01-16 18:59:54,712 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:54,712 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1350 transitions. [2020-01-16 18:59:54,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:54,713 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:54,713 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:54,713 INFO L426 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:54,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:54,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1222876846, now seen corresponding path program 109 times [2020-01-16 18:59:54,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:54,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916934669] [2020-01-16 18:59:54,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:55,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-01-16 18:59:55,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916934669] [2020-01-16 18:59:55,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:55,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:55,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838967372] [2020-01-16 18:59:55,003 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:55,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:55,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:55,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:55,004 INFO L87 Difference]: Start difference. First operand 387 states and 1350 transitions. Second operand 9 states. [2020-01-16 18:59:55,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:55,122 INFO L93 Difference]: Finished difference Result 581 states and 1742 transitions. [2020-01-16 18:59:55,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:55,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:55,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:55,124 INFO L225 Difference]: With dead ends: 581 [2020-01-16 18:59:55,124 INFO L226 Difference]: Without dead ends: 570 [2020-01-16 18:59:55,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:55,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-01-16 18:59:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 391. [2020-01-16 18:59:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 18:59:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1360 transitions. [2020-01-16 18:59:55,134 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1360 transitions. Word has length 22 [2020-01-16 18:59:55,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:55,134 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1360 transitions. [2020-01-16 18:59:55,134 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:55,134 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1360 transitions. [2020-01-16 18:59:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:55,135 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:55,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, 1, 1, 1] [2020-01-16 18:59:55,135 INFO L426 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:55,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:55,135 INFO L82 PathProgramCache]: Analyzing trace with hash -969784094, now seen corresponding path program 110 times [2020-01-16 18:59:55,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:55,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687540598] [2020-01-16 18:59:55,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:55,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:55,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687540598] [2020-01-16 18:59:55,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:55,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:55,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169231030] [2020-01-16 18:59:55,443 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:55,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:55,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:55,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:55,443 INFO L87 Difference]: Start difference. First operand 391 states and 1360 transitions. Second operand 9 states. [2020-01-16 18:59:55,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:55,548 INFO L93 Difference]: Finished difference Result 580 states and 1738 transitions. [2020-01-16 18:59:55,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:55,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:55,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:55,550 INFO L225 Difference]: With dead ends: 580 [2020-01-16 18:59:55,550 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 18:59:55,550 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:55,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 18:59:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 389. [2020-01-16 18:59:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 18:59:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1355 transitions. [2020-01-16 18:59:55,559 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1355 transitions. Word has length 22 [2020-01-16 18:59:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:55,559 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1355 transitions. [2020-01-16 18:59:55,559 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1355 transitions. [2020-01-16 18:59:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:55,560 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:55,560 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:55,560 INFO L426 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:55,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:55,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1390253540, now seen corresponding path program 111 times [2020-01-16 18:59:55,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:55,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317309728] [2020-01-16 18:59:55,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:55,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:55,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317309728] [2020-01-16 18:59:55,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:55,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:55,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790497588] [2020-01-16 18:59:55,841 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:55,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:55,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:55,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:55,841 INFO L87 Difference]: Start difference. First operand 389 states and 1355 transitions. Second operand 9 states. [2020-01-16 18:59:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:55,943 INFO L93 Difference]: Finished difference Result 586 states and 1751 transitions. [2020-01-16 18:59:55,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:55,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:55,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:55,945 INFO L225 Difference]: With dead ends: 586 [2020-01-16 18:59:55,945 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 18:59:55,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 18:59:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 392. [2020-01-16 18:59:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 18:59:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1360 transitions. [2020-01-16 18:59:55,955 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1360 transitions. Word has length 22 [2020-01-16 18:59:55,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:55,955 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1360 transitions. [2020-01-16 18:59:55,955 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1360 transitions. [2020-01-16 18:59:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:55,956 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:55,956 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:55,956 INFO L426 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:55,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1518678626, now seen corresponding path program 112 times [2020-01-16 18:59:55,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:55,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047274273] [2020-01-16 18:59:55,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:56,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047274273] [2020-01-16 18:59:56,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:56,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:56,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731581450] [2020-01-16 18:59:56,241 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:56,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:56,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:56,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:56,242 INFO L87 Difference]: Start difference. First operand 392 states and 1360 transitions. Second operand 9 states. [2020-01-16 18:59:56,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:56,347 INFO L93 Difference]: Finished difference Result 589 states and 1754 transitions. [2020-01-16 18:59:56,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:56,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:56,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:56,349 INFO L225 Difference]: With dead ends: 589 [2020-01-16 18:59:56,349 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 18:59:56,349 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:56,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 18:59:56,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 389. [2020-01-16 18:59:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 18:59:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1353 transitions. [2020-01-16 18:59:56,357 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1353 transitions. Word has length 22 [2020-01-16 18:59:56,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:56,358 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1353 transitions. [2020-01-16 18:59:56,358 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:56,358 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1353 transitions. [2020-01-16 18:59:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:56,358 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:56,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, 1, 1, 1] [2020-01-16 18:59:56,358 INFO L426 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:56,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:56,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1510693950, now seen corresponding path program 113 times [2020-01-16 18:59:56,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:56,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858980900] [2020-01-16 18:59:56,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:56,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-01-16 18:59:56,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858980900] [2020-01-16 18:59:56,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:56,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:56,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724004590] [2020-01-16 18:59:56,640 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:56,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:56,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:56,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:56,640 INFO L87 Difference]: Start difference. First operand 389 states and 1353 transitions. Second operand 9 states. [2020-01-16 18:59:56,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:56,742 INFO L93 Difference]: Finished difference Result 583 states and 1742 transitions. [2020-01-16 18:59:56,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:56,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:56,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:56,744 INFO L225 Difference]: With dead ends: 583 [2020-01-16 18:59:56,744 INFO L226 Difference]: Without dead ends: 573 [2020-01-16 18:59:56,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:56,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-01-16 18:59:56,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 391. [2020-01-16 18:59:56,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 18:59:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1356 transitions. [2020-01-16 18:59:56,754 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1356 transitions. Word has length 22 [2020-01-16 18:59:56,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:56,754 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1356 transitions. [2020-01-16 18:59:56,754 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1356 transitions. [2020-01-16 18:59:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:56,755 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:56,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, 1, 1, 1] [2020-01-16 18:59:56,755 INFO L426 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:56,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:56,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1866323156, now seen corresponding path program 114 times [2020-01-16 18:59:56,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:56,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804015675] [2020-01-16 18:59:56,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:57,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-01-16 18:59:57,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804015675] [2020-01-16 18:59:57,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:57,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:57,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022922432] [2020-01-16 18:59:57,060 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:57,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:57,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:57,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:57,060 INFO L87 Difference]: Start difference. First operand 391 states and 1356 transitions. Second operand 9 states. [2020-01-16 18:59:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:57,174 INFO L93 Difference]: Finished difference Result 587 states and 1748 transitions. [2020-01-16 18:59:57,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:57,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:57,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:57,176 INFO L225 Difference]: With dead ends: 587 [2020-01-16 18:59:57,176 INFO L226 Difference]: Without dead ends: 569 [2020-01-16 18:59:57,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:57,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-01-16 18:59:57,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 387. [2020-01-16 18:59:57,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 18:59:57,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1349 transitions. [2020-01-16 18:59:57,185 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1349 transitions. Word has length 22 [2020-01-16 18:59:57,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:57,185 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1349 transitions. [2020-01-16 18:59:57,186 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:57,186 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1349 transitions. [2020-01-16 18:59:57,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:57,186 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:57,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, 1, 1, 1] [2020-01-16 18:59:57,187 INFO L426 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:57,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:57,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1952169664, now seen corresponding path program 115 times [2020-01-16 18:59:57,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:57,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573758925] [2020-01-16 18:59:57,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:57,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-01-16 18:59:57,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573758925] [2020-01-16 18:59:57,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:57,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:57,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208728626] [2020-01-16 18:59:57,474 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:57,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:57,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:57,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:57,474 INFO L87 Difference]: Start difference. First operand 387 states and 1349 transitions. Second operand 9 states. [2020-01-16 18:59:57,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:57,549 INFO L93 Difference]: Finished difference Result 570 states and 1713 transitions. [2020-01-16 18:59:57,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:57,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:57,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:57,550 INFO L225 Difference]: With dead ends: 570 [2020-01-16 18:59:57,551 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 18:59:57,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:57,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 18:59:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 389. [2020-01-16 18:59:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 18:59:57,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1353 transitions. [2020-01-16 18:59:57,560 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1353 transitions. Word has length 22 [2020-01-16 18:59:57,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:57,561 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1353 transitions. [2020-01-16 18:59:57,561 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:57,561 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1353 transitions. [2020-01-16 18:59:57,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:57,561 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:57,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, 1, 1, 1] [2020-01-16 18:59:57,562 INFO L426 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:57,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:57,562 INFO L82 PathProgramCache]: Analyzing trace with hash -731856674, now seen corresponding path program 116 times [2020-01-16 18:59:57,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:57,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211004527] [2020-01-16 18:59:57,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:57,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211004527] [2020-01-16 18:59:57,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:57,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:57,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456644974] [2020-01-16 18:59:57,844 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:57,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:57,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:57,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:57,844 INFO L87 Difference]: Start difference. First operand 389 states and 1353 transitions. Second operand 9 states. [2020-01-16 18:59:57,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:57,944 INFO L93 Difference]: Finished difference Result 571 states and 1714 transitions. [2020-01-16 18:59:57,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:57,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:57,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:57,946 INFO L225 Difference]: With dead ends: 571 [2020-01-16 18:59:57,946 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 18:59:57,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:57,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 18:59:57,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 388. [2020-01-16 18:59:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 18:59:57,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1351 transitions. [2020-01-16 18:59:57,954 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1351 transitions. Word has length 22 [2020-01-16 18:59:57,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:57,954 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1351 transitions. [2020-01-16 18:59:57,954 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:57,954 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1351 transitions. [2020-01-16 18:59:57,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:57,955 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:57,955 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:57,955 INFO L426 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:57,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:57,955 INFO L82 PathProgramCache]: Analyzing trace with hash 270332754, now seen corresponding path program 117 times [2020-01-16 18:59:57,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:57,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309629325] [2020-01-16 18:59:57,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:58,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309629325] [2020-01-16 18:59:58,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:58,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:58,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908206223] [2020-01-16 18:59:58,237 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:58,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:58,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:58,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:58,238 INFO L87 Difference]: Start difference. First operand 388 states and 1351 transitions. Second operand 9 states. [2020-01-16 18:59:58,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:58,317 INFO L93 Difference]: Finished difference Result 574 states and 1720 transitions. [2020-01-16 18:59:58,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:58,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:58,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:58,318 INFO L225 Difference]: With dead ends: 574 [2020-01-16 18:59:58,319 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 18:59:58,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:58,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 18:59:58,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 389. [2020-01-16 18:59:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 18:59:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1352 transitions. [2020-01-16 18:59:58,327 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1352 transitions. Word has length 22 [2020-01-16 18:59:58,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:58,328 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1352 transitions. [2020-01-16 18:59:58,328 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:58,328 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1352 transitions. [2020-01-16 18:59:58,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:58,328 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:58,329 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:58,329 INFO L426 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:58,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:58,329 INFO L82 PathProgramCache]: Analyzing trace with hash -805378402, now seen corresponding path program 118 times [2020-01-16 18:59:58,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:58,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615928844] [2020-01-16 18:59:58,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:58,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-01-16 18:59:58,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615928844] [2020-01-16 18:59:58,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:58,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:58,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027569246] [2020-01-16 18:59:58,599 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:58,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:58,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:58,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:58,599 INFO L87 Difference]: Start difference. First operand 389 states and 1352 transitions. Second operand 9 states. [2020-01-16 18:59:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:58,708 INFO L93 Difference]: Finished difference Result 579 states and 1729 transitions. [2020-01-16 18:59:58,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:58,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:58,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:58,710 INFO L225 Difference]: With dead ends: 579 [2020-01-16 18:59:58,710 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 18:59:58,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 18:59:58,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 388. [2020-01-16 18:59:58,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 18:59:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1350 transitions. [2020-01-16 18:59:58,721 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1350 transitions. Word has length 22 [2020-01-16 18:59:58,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:58,722 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1350 transitions. [2020-01-16 18:59:58,722 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:58,722 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1350 transitions. [2020-01-16 18:59:58,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:58,723 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:58,723 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:58,723 INFO L426 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:58,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:58,723 INFO L82 PathProgramCache]: Analyzing trace with hash 280835858, now seen corresponding path program 119 times [2020-01-16 18:59:58,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:58,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827355754] [2020-01-16 18:59:58,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:59,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-01-16 18:59:59,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827355754] [2020-01-16 18:59:59,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:59,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:59,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147395832] [2020-01-16 18:59:59,047 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:59,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:59,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:59,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:59,047 INFO L87 Difference]: Start difference. First operand 388 states and 1350 transitions. Second operand 9 states. [2020-01-16 18:59:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:59,165 INFO L93 Difference]: Finished difference Result 577 states and 1726 transitions. [2020-01-16 18:59:59,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:59,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:59,167 INFO L225 Difference]: With dead ends: 577 [2020-01-16 18:59:59,167 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 18:59:59,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 18:59:59,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 390. [2020-01-16 18:59:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 18:59:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1353 transitions. [2020-01-16 18:59:59,177 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1353 transitions. Word has length 22 [2020-01-16 18:59:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:59,177 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1353 transitions. [2020-01-16 18:59:59,177 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1353 transitions. [2020-01-16 18:59:59,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:59,178 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:59,178 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:59,178 INFO L426 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:59,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:59,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1889151040, now seen corresponding path program 120 times [2020-01-16 18:59:59,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:59,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408859866] [2020-01-16 18:59:59,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:59,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408859866] [2020-01-16 18:59:59,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:59,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:59,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276819904] [2020-01-16 18:59:59,474 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:59,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:59,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:59,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:59,474 INFO L87 Difference]: Start difference. First operand 390 states and 1353 transitions. Second operand 9 states. [2020-01-16 18:59:59,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:59,581 INFO L93 Difference]: Finished difference Result 581 states and 1732 transitions. [2020-01-16 18:59:59,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:59,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:59,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:59,583 INFO L225 Difference]: With dead ends: 581 [2020-01-16 18:59:59,583 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 18:59:59,583 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:59,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 18:59:59,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 383. [2020-01-16 18:59:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 18:59:59,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1342 transitions. [2020-01-16 18:59:59,592 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1342 transitions. Word has length 22 [2020-01-16 18:59:59,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:59,592 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1342 transitions. [2020-01-16 18:59:59,593 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:59,593 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1342 transitions. [2020-01-16 18:59:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:59,593 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:59,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, 1, 1, 1] [2020-01-16 18:59:59,594 INFO L426 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:59,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:59,594 INFO L82 PathProgramCache]: Analyzing trace with hash -317402012, now seen corresponding path program 121 times [2020-01-16 18:59:59,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:59,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319618703] [2020-01-16 18:59:59,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:59,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-01-16 18:59:59,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319618703] [2020-01-16 18:59:59,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:59,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 18:59:59,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850161794] [2020-01-16 18:59:59,872 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 18:59:59,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:59,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 18:59:59,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:59,873 INFO L87 Difference]: Start difference. First operand 383 states and 1342 transitions. Second operand 9 states. [2020-01-16 18:59:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:59,955 INFO L93 Difference]: Finished difference Result 594 states and 1772 transitions. [2020-01-16 18:59:59,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 18:59:59,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 18:59:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:59,957 INFO L225 Difference]: With dead ends: 594 [2020-01-16 18:59:59,957 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 18:59:59,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:59:59,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 18:59:59,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 393. [2020-01-16 18:59:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 18:59:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1372 transitions. [2020-01-16 18:59:59,967 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1372 transitions. Word has length 22 [2020-01-16 18:59:59,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:59,967 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1372 transitions. [2020-01-16 18:59:59,967 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 18:59:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1372 transitions. [2020-01-16 18:59:59,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 18:59:59,969 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:59,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, 1, 1, 1] [2020-01-16 18:59:59,969 INFO L426 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:59:59,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:59,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1272863874, now seen corresponding path program 122 times [2020-01-16 18:59:59,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:59,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48753896] [2020-01-16 18:59:59,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:00,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48753896] [2020-01-16 19:00:00,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:00,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:00,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011228309] [2020-01-16 19:00:00,241 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:00,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:00,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:00,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:00,242 INFO L87 Difference]: Start difference. First operand 393 states and 1372 transitions. Second operand 9 states. [2020-01-16 19:00:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:00,344 INFO L93 Difference]: Finished difference Result 589 states and 1759 transitions. [2020-01-16 19:00:00,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:00,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:00,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:00,347 INFO L225 Difference]: With dead ends: 589 [2020-01-16 19:00:00,347 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:00:00,347 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:00:00,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 389. [2020-01-16 19:00:00,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:00,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1364 transitions. [2020-01-16 19:00:00,356 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1364 transitions. Word has length 22 [2020-01-16 19:00:00,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:00,356 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1364 transitions. [2020-01-16 19:00:00,356 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:00,356 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1364 transitions. [2020-01-16 19:00:00,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:00,357 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:00,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, 1, 1, 1] [2020-01-16 19:00:00,358 INFO L426 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:00,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:00,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1035148308, now seen corresponding path program 123 times [2020-01-16 19:00:00,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:00,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694117501] [2020-01-16 19:00:00,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:00,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-01-16 19:00:00,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694117501] [2020-01-16 19:00:00,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:00,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:00,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269533231] [2020-01-16 19:00:00,626 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:00,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:00,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:00,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:00,626 INFO L87 Difference]: Start difference. First operand 389 states and 1364 transitions. Second operand 9 states. [2020-01-16 19:00:00,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:00,704 INFO L93 Difference]: Finished difference Result 590 states and 1760 transitions. [2020-01-16 19:00:00,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:00,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:00,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:00,706 INFO L225 Difference]: With dead ends: 590 [2020-01-16 19:00:00,706 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:00:00,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:00,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:00:00,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 391. [2020-01-16 19:00:00,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:00:00,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1366 transitions. [2020-01-16 19:00:00,716 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1366 transitions. Word has length 22 [2020-01-16 19:00:00,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:00,716 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1366 transitions. [2020-01-16 19:00:00,716 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1366 transitions. [2020-01-16 19:00:00,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:00,717 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:00,717 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:00,717 INFO L426 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:00,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:00,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1596216800, now seen corresponding path program 124 times [2020-01-16 19:00:00,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:00,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133724705] [2020-01-16 19:00:00,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:00,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:00,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133724705] [2020-01-16 19:00:00,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:00,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:00,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575281460] [2020-01-16 19:00:00,982 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:00,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:00,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:00,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:00,983 INFO L87 Difference]: Start difference. First operand 391 states and 1366 transitions. Second operand 9 states. [2020-01-16 19:00:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:01,072 INFO L93 Difference]: Finished difference Result 583 states and 1745 transitions. [2020-01-16 19:00:01,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:01,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:01,074 INFO L225 Difference]: With dead ends: 583 [2020-01-16 19:00:01,074 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:00:01,075 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:01,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:00:01,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 389. [2020-01-16 19:00:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1362 transitions. [2020-01-16 19:00:01,084 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1362 transitions. Word has length 22 [2020-01-16 19:00:01,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:01,084 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1362 transitions. [2020-01-16 19:00:01,084 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:01,084 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1362 transitions. [2020-01-16 19:00:01,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:01,085 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:01,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, 1, 1, 1] [2020-01-16 19:00:01,085 INFO L426 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:01,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:01,085 INFO L82 PathProgramCache]: Analyzing trace with hash -159141898, now seen corresponding path program 125 times [2020-01-16 19:00:01,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:01,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425092386] [2020-01-16 19:00:01,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:01,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-01-16 19:00:01,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425092386] [2020-01-16 19:00:01,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:01,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:01,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928316078] [2020-01-16 19:00:01,356 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:01,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:01,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:01,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:01,356 INFO L87 Difference]: Start difference. First operand 389 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:00:01,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:01,463 INFO L93 Difference]: Finished difference Result 579 states and 1738 transitions. [2020-01-16 19:00:01,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:01,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:01,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:01,467 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:00:01,467 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:00:01,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:01,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:00:01,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 390. [2020-01-16 19:00:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1363 transitions. [2020-01-16 19:00:01,476 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1363 transitions. Word has length 22 [2020-01-16 19:00:01,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:01,476 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1363 transitions. [2020-01-16 19:00:01,476 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1363 transitions. [2020-01-16 19:00:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:01,477 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:01,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, 1, 1, 1] [2020-01-16 19:00:01,477 INFO L426 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:01,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:01,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1604658908, now seen corresponding path program 126 times [2020-01-16 19:00:01,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:01,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45837900] [2020-01-16 19:00:01,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:01,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45837900] [2020-01-16 19:00:01,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:01,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:01,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384474990] [2020-01-16 19:00:01,764 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:01,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:01,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:01,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:01,764 INFO L87 Difference]: Start difference. First operand 390 states and 1363 transitions. Second operand 9 states. [2020-01-16 19:00:01,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:01,863 INFO L93 Difference]: Finished difference Result 577 states and 1733 transitions. [2020-01-16 19:00:01,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:01,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:01,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:01,865 INFO L225 Difference]: With dead ends: 577 [2020-01-16 19:00:01,865 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:00:01,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:01,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:00:01,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 387. [2020-01-16 19:00:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:00:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1358 transitions. [2020-01-16 19:00:01,876 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1358 transitions. Word has length 22 [2020-01-16 19:00:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:01,876 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1358 transitions. [2020-01-16 19:00:01,876 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1358 transitions. [2020-01-16 19:00:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:01,877 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:01,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:01,877 INFO L426 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:01,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:01,878 INFO L82 PathProgramCache]: Analyzing trace with hash -739887738, now seen corresponding path program 127 times [2020-01-16 19:00:01,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:01,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546679740] [2020-01-16 19:00:01,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:02,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-01-16 19:00:02,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546679740] [2020-01-16 19:00:02,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:02,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:02,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265956253] [2020-01-16 19:00:02,153 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:02,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:02,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:02,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:02,153 INFO L87 Difference]: Start difference. First operand 387 states and 1358 transitions. Second operand 9 states. [2020-01-16 19:00:02,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:02,241 INFO L93 Difference]: Finished difference Result 598 states and 1782 transitions. [2020-01-16 19:00:02,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:02,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:02,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:02,243 INFO L225 Difference]: With dead ends: 598 [2020-01-16 19:00:02,243 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 19:00:02,243 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:02,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 19:00:02,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 394. [2020-01-16 19:00:02,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:00:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1374 transitions. [2020-01-16 19:00:02,254 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1374 transitions. Word has length 22 [2020-01-16 19:00:02,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:02,254 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1374 transitions. [2020-01-16 19:00:02,254 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:02,254 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1374 transitions. [2020-01-16 19:00:02,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:02,255 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:02,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, 1, 1, 1] [2020-01-16 19:00:02,255 INFO L426 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:02,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:02,256 INFO L82 PathProgramCache]: Analyzing trace with hash 850378148, now seen corresponding path program 128 times [2020-01-16 19:00:02,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:02,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149891236] [2020-01-16 19:00:02,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:02,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-01-16 19:00:02,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149891236] [2020-01-16 19:00:02,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:02,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:02,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531127169] [2020-01-16 19:00:02,537 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:02,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:02,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:02,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:02,538 INFO L87 Difference]: Start difference. First operand 394 states and 1374 transitions. Second operand 9 states. [2020-01-16 19:00:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:02,657 INFO L93 Difference]: Finished difference Result 593 states and 1769 transitions. [2020-01-16 19:00:02,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:02,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:02,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:02,659 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:00:02,659 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:00:02,660 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:00:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 390. [2020-01-16 19:00:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1365 transitions. [2020-01-16 19:00:02,668 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1365 transitions. Word has length 22 [2020-01-16 19:00:02,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:02,668 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1365 transitions. [2020-01-16 19:00:02,669 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1365 transitions. [2020-01-16 19:00:02,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:02,669 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:02,669 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:02,669 INFO L426 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:02,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:02,670 INFO L82 PathProgramCache]: Analyzing trace with hash -638975566, now seen corresponding path program 129 times [2020-01-16 19:00:02,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:02,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162679233] [2020-01-16 19:00:02,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:02,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162679233] [2020-01-16 19:00:02,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:02,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:02,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681312285] [2020-01-16 19:00:02,964 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:02,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:02,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:02,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:02,965 INFO L87 Difference]: Start difference. First operand 390 states and 1365 transitions. Second operand 9 states. [2020-01-16 19:00:03,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:03,076 INFO L93 Difference]: Finished difference Result 596 states and 1774 transitions. [2020-01-16 19:00:03,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:03,076 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:03,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:03,078 INFO L225 Difference]: With dead ends: 596 [2020-01-16 19:00:03,078 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:00:03,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:03,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:00:03,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 393. [2020-01-16 19:00:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:00:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1369 transitions. [2020-01-16 19:00:03,088 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1369 transitions. Word has length 22 [2020-01-16 19:00:03,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:03,089 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1369 transitions. [2020-01-16 19:00:03,089 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1369 transitions. [2020-01-16 19:00:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:03,089 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:03,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, 1, 1, 1] [2020-01-16 19:00:03,090 INFO L426 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:03,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:03,090 INFO L82 PathProgramCache]: Analyzing trace with hash -512339192, now seen corresponding path program 130 times [2020-01-16 19:00:03,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:03,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438647690] [2020-01-16 19:00:03,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:03,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-01-16 19:00:03,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438647690] [2020-01-16 19:00:03,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:03,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:03,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664584922] [2020-01-16 19:00:03,352 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:03,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:03,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:03,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:03,353 INFO L87 Difference]: Start difference. First operand 393 states and 1369 transitions. Second operand 9 states. [2020-01-16 19:00:03,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:03,472 INFO L93 Difference]: Finished difference Result 590 states and 1760 transitions. [2020-01-16 19:00:03,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:03,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:03,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:03,474 INFO L225 Difference]: With dead ends: 590 [2020-01-16 19:00:03,474 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:00:03,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:03,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:00:03,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 390. [2020-01-16 19:00:03,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1362 transitions. [2020-01-16 19:00:03,484 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1362 transitions. Word has length 22 [2020-01-16 19:00:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:03,484 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1362 transitions. [2020-01-16 19:00:03,484 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:03,484 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1362 transitions. [2020-01-16 19:00:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:03,485 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:03,485 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:03,485 INFO L426 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:03,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:03,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1367609936, now seen corresponding path program 131 times [2020-01-16 19:00:03,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:03,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078067787] [2020-01-16 19:00:03,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:03,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-01-16 19:00:03,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078067787] [2020-01-16 19:00:03,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:03,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:03,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031286523] [2020-01-16 19:00:03,776 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:03,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:03,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:03,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:03,777 INFO L87 Difference]: Start difference. First operand 390 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:00:03,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:03,887 INFO L93 Difference]: Finished difference Result 585 states and 1751 transitions. [2020-01-16 19:00:03,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:03,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:03,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:03,889 INFO L225 Difference]: With dead ends: 585 [2020-01-16 19:00:03,889 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:00:03,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:03,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:00:03,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 392. [2020-01-16 19:00:03,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:00:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1365 transitions. [2020-01-16 19:00:03,899 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1365 transitions. Word has length 22 [2020-01-16 19:00:03,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:03,900 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1365 transitions. [2020-01-16 19:00:03,900 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1365 transitions. [2020-01-16 19:00:03,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:03,900 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:03,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:03,900 INFO L426 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:03,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:03,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1585424572, now seen corresponding path program 132 times [2020-01-16 19:00:03,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:03,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243880796] [2020-01-16 19:00:03,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:04,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243880796] [2020-01-16 19:00:04,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:04,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:04,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863509128] [2020-01-16 19:00:04,185 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:04,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:04,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:04,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:04,185 INFO L87 Difference]: Start difference. First operand 392 states and 1365 transitions. Second operand 9 states. [2020-01-16 19:00:04,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:04,299 INFO L93 Difference]: Finished difference Result 584 states and 1747 transitions. [2020-01-16 19:00:04,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:04,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:04,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:04,301 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:00:04,301 INFO L226 Difference]: Without dead ends: 569 [2020-01-16 19:00:04,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:04,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-01-16 19:00:04,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 387. [2020-01-16 19:00:04,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:00:04,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1356 transitions. [2020-01-16 19:00:04,310 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1356 transitions. Word has length 22 [2020-01-16 19:00:04,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:04,310 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1356 transitions. [2020-01-16 19:00:04,310 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:04,310 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1356 transitions. [2020-01-16 19:00:04,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:04,311 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:04,311 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:04,311 INFO L426 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:04,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:04,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1016560404, now seen corresponding path program 133 times [2020-01-16 19:00:04,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:04,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490831699] [2020-01-16 19:00:04,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:04,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490831699] [2020-01-16 19:00:04,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:04,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:04,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101141859] [2020-01-16 19:00:04,588 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:04,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:04,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:04,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:04,588 INFO L87 Difference]: Start difference. First operand 387 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:00:04,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:04,669 INFO L93 Difference]: Finished difference Result 588 states and 1753 transitions. [2020-01-16 19:00:04,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:04,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:04,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:04,671 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:00:04,671 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:00:04,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:04,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:00:04,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 391. [2020-01-16 19:00:04,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:00:04,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1364 transitions. [2020-01-16 19:00:04,681 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1364 transitions. Word has length 22 [2020-01-16 19:00:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:04,681 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1364 transitions. [2020-01-16 19:00:04,681 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:04,681 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1364 transitions. [2020-01-16 19:00:04,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:04,681 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:04,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, 1, 1, 1] [2020-01-16 19:00:04,682 INFO L426 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:04,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:04,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1577628896, now seen corresponding path program 134 times [2020-01-16 19:00:04,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:04,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816906704] [2020-01-16 19:00:04,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:04,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-01-16 19:00:04,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816906704] [2020-01-16 19:00:04,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:04,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:04,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125032808] [2020-01-16 19:00:04,960 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:04,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:04,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:04,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:04,961 INFO L87 Difference]: Start difference. First operand 391 states and 1364 transitions. Second operand 9 states. [2020-01-16 19:00:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:05,058 INFO L93 Difference]: Finished difference Result 581 states and 1738 transitions. [2020-01-16 19:00:05,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:05,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:05,059 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:00:05,059 INFO L226 Difference]: Without dead ends: 570 [2020-01-16 19:00:05,059 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:05,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-01-16 19:00:05,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 389. [2020-01-16 19:00:05,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:05,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1360 transitions. [2020-01-16 19:00:05,068 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1360 transitions. Word has length 22 [2020-01-16 19:00:05,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:05,068 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1360 transitions. [2020-01-16 19:00:05,068 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1360 transitions. [2020-01-16 19:00:05,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:05,069 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:05,069 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:05,069 INFO L426 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:05,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:05,070 INFO L82 PathProgramCache]: Analyzing trace with hash -583877450, now seen corresponding path program 135 times [2020-01-16 19:00:05,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:05,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578681915] [2020-01-16 19:00:05,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:05,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578681915] [2020-01-16 19:00:05,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:05,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:05,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940563181] [2020-01-16 19:00:05,345 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:05,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:05,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:05,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:05,346 INFO L87 Difference]: Start difference. First operand 389 states and 1360 transitions. Second operand 9 states. [2020-01-16 19:00:05,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:05,443 INFO L93 Difference]: Finished difference Result 590 states and 1756 transitions. [2020-01-16 19:00:05,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:05,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:05,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:05,445 INFO L225 Difference]: With dead ends: 590 [2020-01-16 19:00:05,445 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:00:05,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:05,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:00:05,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 392. [2020-01-16 19:00:05,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:00:05,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1364 transitions. [2020-01-16 19:00:05,456 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1364 transitions. Word has length 22 [2020-01-16 19:00:05,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:05,457 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1364 transitions. [2020-01-16 19:00:05,457 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:05,457 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1364 transitions. [2020-01-16 19:00:05,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:05,458 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:05,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, 1, 1, 1] [2020-01-16 19:00:05,458 INFO L426 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:05,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:05,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1546081112, now seen corresponding path program 136 times [2020-01-16 19:00:05,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:05,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283926128] [2020-01-16 19:00:05,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:05,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283926128] [2020-01-16 19:00:05,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:05,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:05,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138606855] [2020-01-16 19:00:05,766 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:05,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:05,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:05,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:05,767 INFO L87 Difference]: Start difference. First operand 392 states and 1364 transitions. Second operand 9 states. [2020-01-16 19:00:05,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:05,880 INFO L93 Difference]: Finished difference Result 584 states and 1742 transitions. [2020-01-16 19:00:05,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:05,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:05,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:05,882 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:00:05,882 INFO L226 Difference]: Without dead ends: 571 [2020-01-16 19:00:05,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:05,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-01-16 19:00:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 389. [2020-01-16 19:00:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1358 transitions. [2020-01-16 19:00:05,893 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1358 transitions. Word has length 22 [2020-01-16 19:00:05,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:05,893 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1358 transitions. [2020-01-16 19:00:05,893 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:05,893 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1358 transitions. [2020-01-16 19:00:05,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:05,894 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:05,894 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:05,894 INFO L426 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:05,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:05,894 INFO L82 PathProgramCache]: Analyzing trace with hash -529155224, now seen corresponding path program 137 times [2020-01-16 19:00:05,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:05,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081521088] [2020-01-16 19:00:05,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:06,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081521088] [2020-01-16 19:00:06,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:06,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:06,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075361203] [2020-01-16 19:00:06,185 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:06,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:06,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:06,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:06,185 INFO L87 Difference]: Start difference. First operand 389 states and 1358 transitions. Second operand 9 states. [2020-01-16 19:00:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:06,283 INFO L93 Difference]: Finished difference Result 574 states and 1723 transitions. [2020-01-16 19:00:06,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:06,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:06,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:06,284 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:00:06,285 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:00:06,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:00:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 390. [2020-01-16 19:00:06,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1359 transitions. [2020-01-16 19:00:06,296 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1359 transitions. Word has length 22 [2020-01-16 19:00:06,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:06,296 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1359 transitions. [2020-01-16 19:00:06,296 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1359 transitions. [2020-01-16 19:00:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:06,296 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:06,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, 1, 1, 1] [2020-01-16 19:00:06,297 INFO L426 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:06,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:06,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1081785734, now seen corresponding path program 138 times [2020-01-16 19:00:06,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:06,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111823665] [2020-01-16 19:00:06,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:06,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-01-16 19:00:06,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111823665] [2020-01-16 19:00:06,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:06,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:06,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600081688] [2020-01-16 19:00:06,577 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:06,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:06,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:06,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:06,578 INFO L87 Difference]: Start difference. First operand 390 states and 1359 transitions. Second operand 9 states. [2020-01-16 19:00:06,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:06,706 INFO L93 Difference]: Finished difference Result 575 states and 1724 transitions. [2020-01-16 19:00:06,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:06,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:06,708 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:00:06,708 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:00:06,708 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:06,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:00:06,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 387. [2020-01-16 19:00:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:00:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1354 transitions. [2020-01-16 19:00:06,717 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1354 transitions. Word has length 22 [2020-01-16 19:00:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:06,717 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1354 transitions. [2020-01-16 19:00:06,717 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1354 transitions. [2020-01-16 19:00:06,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:06,718 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:06,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, 1, 1, 1] [2020-01-16 19:00:06,718 INFO L426 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:06,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:06,718 INFO L82 PathProgramCache]: Analyzing trace with hash -620628942, now seen corresponding path program 139 times [2020-01-16 19:00:06,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:06,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797827279] [2020-01-16 19:00:06,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:07,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797827279] [2020-01-16 19:00:07,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:07,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:07,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996620190] [2020-01-16 19:00:07,007 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:07,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:07,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:07,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:07,007 INFO L87 Difference]: Start difference. First operand 387 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:00:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:07,133 INFO L93 Difference]: Finished difference Result 569 states and 1715 transitions. [2020-01-16 19:00:07,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:07,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:07,135 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:00:07,135 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:00:07,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:07,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:00:07,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 389. [2020-01-16 19:00:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:07,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1358 transitions. [2020-01-16 19:00:07,145 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1358 transitions. Word has length 22 [2020-01-16 19:00:07,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:07,145 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1358 transitions. [2020-01-16 19:00:07,145 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1358 transitions. [2020-01-16 19:00:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:07,145 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:07,146 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:07,146 INFO L426 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:07,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:07,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2066145952, now seen corresponding path program 140 times [2020-01-16 19:00:07,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:07,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945203488] [2020-01-16 19:00:07,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:07,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945203488] [2020-01-16 19:00:07,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:07,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:07,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765051643] [2020-01-16 19:00:07,431 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:07,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:07,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:07,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:07,431 INFO L87 Difference]: Start difference. First operand 389 states and 1358 transitions. Second operand 9 states. [2020-01-16 19:00:07,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:07,515 INFO L93 Difference]: Finished difference Result 567 states and 1710 transitions. [2020-01-16 19:00:07,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:07,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:07,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:07,517 INFO L225 Difference]: With dead ends: 567 [2020-01-16 19:00:07,517 INFO L226 Difference]: Without dead ends: 557 [2020-01-16 19:00:07,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:07,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-01-16 19:00:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 388. [2020-01-16 19:00:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:00:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1356 transitions. [2020-01-16 19:00:07,527 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1356 transitions. Word has length 22 [2020-01-16 19:00:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:07,527 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1356 transitions. [2020-01-16 19:00:07,527 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:07,527 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1356 transitions. [2020-01-16 19:00:07,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:07,528 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:07,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, 1, 1, 1] [2020-01-16 19:00:07,528 INFO L426 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:07,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:07,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2073900500, now seen corresponding path program 141 times [2020-01-16 19:00:07,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:07,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775888043] [2020-01-16 19:00:07,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:07,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775888043] [2020-01-16 19:00:07,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:07,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:07,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201611202] [2020-01-16 19:00:07,816 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:07,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:07,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:07,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:07,817 INFO L87 Difference]: Start difference. First operand 388 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:00:07,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:07,928 INFO L93 Difference]: Finished difference Result 571 states and 1719 transitions. [2020-01-16 19:00:07,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:07,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:07,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:07,930 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:00:07,930 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:00:07,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:00:07,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 390. [2020-01-16 19:00:07,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:07,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1359 transitions. [2020-01-16 19:00:07,940 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1359 transitions. Word has length 22 [2020-01-16 19:00:07,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:07,940 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1359 transitions. [2020-01-16 19:00:07,941 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:07,941 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1359 transitions. [2020-01-16 19:00:07,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:07,942 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:07,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:07,942 INFO L426 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:07,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:07,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1967974044, now seen corresponding path program 142 times [2020-01-16 19:00:07,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:07,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972845977] [2020-01-16 19:00:07,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:08,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:08,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972845977] [2020-01-16 19:00:08,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:08,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:08,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694235235] [2020-01-16 19:00:08,259 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:08,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:08,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:08,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:08,260 INFO L87 Difference]: Start difference. First operand 390 states and 1359 transitions. Second operand 9 states. [2020-01-16 19:00:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:08,369 INFO L93 Difference]: Finished difference Result 570 states and 1715 transitions. [2020-01-16 19:00:08,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:08,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:08,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:08,371 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:00:08,371 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:00:08,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:08,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:00:08,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 388. [2020-01-16 19:00:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:00:08,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1355 transitions. [2020-01-16 19:00:08,380 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1355 transitions. Word has length 22 [2020-01-16 19:00:08,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:08,380 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1355 transitions. [2020-01-16 19:00:08,380 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1355 transitions. [2020-01-16 19:00:08,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:08,381 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:08,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:08,381 INFO L426 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:08,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:08,382 INFO L82 PathProgramCache]: Analyzing trace with hash -972054364, now seen corresponding path program 143 times [2020-01-16 19:00:08,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:08,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078517903] [2020-01-16 19:00:08,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:08,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078517903] [2020-01-16 19:00:08,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:08,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:08,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530363754] [2020-01-16 19:00:08,755 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:08,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:08,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:08,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:08,756 INFO L87 Difference]: Start difference. First operand 388 states and 1355 transitions. Second operand 9 states. [2020-01-16 19:00:08,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:08,840 INFO L93 Difference]: Finished difference Result 566 states and 1707 transitions. [2020-01-16 19:00:08,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:08,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:08,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:08,842 INFO L225 Difference]: With dead ends: 566 [2020-01-16 19:00:08,842 INFO L226 Difference]: Without dead ends: 557 [2020-01-16 19:00:08,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-01-16 19:00:08,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 389. [2020-01-16 19:00:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:08,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-01-16 19:00:08,854 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-01-16 19:00:08,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:08,854 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-01-16 19:00:08,854 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-01-16 19:00:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:08,855 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:08,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, 1, 1, 1] [2020-01-16 19:00:08,856 INFO L426 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:08,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:08,856 INFO L82 PathProgramCache]: Analyzing trace with hash 638886594, now seen corresponding path program 144 times [2020-01-16 19:00:08,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:08,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995638320] [2020-01-16 19:00:08,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:09,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-01-16 19:00:09,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995638320] [2020-01-16 19:00:09,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:09,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:09,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969069160] [2020-01-16 19:00:09,144 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:09,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:09,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:09,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:09,144 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:00:09,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:09,282 INFO L93 Difference]: Finished difference Result 567 states and 1708 transitions. [2020-01-16 19:00:09,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:09,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:09,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:09,284 INFO L225 Difference]: With dead ends: 567 [2020-01-16 19:00:09,284 INFO L226 Difference]: Without dead ends: 553 [2020-01-16 19:00:09,284 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:09,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-01-16 19:00:09,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 385. [2020-01-16 19:00:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:00:09,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1350 transitions. [2020-01-16 19:00:09,293 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1350 transitions. Word has length 22 [2020-01-16 19:00:09,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:09,294 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1350 transitions. [2020-01-16 19:00:09,294 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1350 transitions. [2020-01-16 19:00:09,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:09,294 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:09,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, 1, 1, 1] [2020-01-16 19:00:09,295 INFO L426 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:09,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:09,295 INFO L82 PathProgramCache]: Analyzing trace with hash 743376078, now seen corresponding path program 145 times [2020-01-16 19:00:09,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:09,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538393232] [2020-01-16 19:00:09,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:09,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-01-16 19:00:09,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538393232] [2020-01-16 19:00:09,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:09,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:09,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349229884] [2020-01-16 19:00:09,550 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:09,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:09,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:09,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:09,551 INFO L87 Difference]: Start difference. First operand 385 states and 1350 transitions. Second operand 9 states. [2020-01-16 19:00:09,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:09,637 INFO L93 Difference]: Finished difference Result 602 states and 1792 transitions. [2020-01-16 19:00:09,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:09,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:09,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:09,639 INFO L225 Difference]: With dead ends: 602 [2020-01-16 19:00:09,639 INFO L226 Difference]: Without dead ends: 586 [2020-01-16 19:00:09,640 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:09,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-01-16 19:00:09,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 393. [2020-01-16 19:00:09,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:00:09,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1370 transitions. [2020-01-16 19:00:09,649 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1370 transitions. Word has length 22 [2020-01-16 19:00:09,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:09,649 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1370 transitions. [2020-01-16 19:00:09,649 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:09,649 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1370 transitions. [2020-01-16 19:00:09,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:09,650 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:09,650 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:09,650 INFO L426 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:09,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:09,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1961325332, now seen corresponding path program 146 times [2020-01-16 19:00:09,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:09,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367412913] [2020-01-16 19:00:09,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:09,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-01-16 19:00:09,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367412913] [2020-01-16 19:00:09,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:09,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:09,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901121989] [2020-01-16 19:00:09,909 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:09,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:09,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:09,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:09,910 INFO L87 Difference]: Start difference. First operand 393 states and 1370 transitions. Second operand 9 states. [2020-01-16 19:00:10,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:10,021 INFO L93 Difference]: Finished difference Result 597 states and 1779 transitions. [2020-01-16 19:00:10,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:10,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:10,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:10,022 INFO L225 Difference]: With dead ends: 597 [2020-01-16 19:00:10,023 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 19:00:10,023 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:10,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 19:00:10,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 389. [2020-01-16 19:00:10,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1362 transitions. [2020-01-16 19:00:10,031 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1362 transitions. Word has length 22 [2020-01-16 19:00:10,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:10,032 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1362 transitions. [2020-01-16 19:00:10,032 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:10,032 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1362 transitions. [2020-01-16 19:00:10,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:10,032 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:10,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, 1, 1, 1] [2020-01-16 19:00:10,032 INFO L426 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:10,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:10,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2095926398, now seen corresponding path program 147 times [2020-01-16 19:00:10,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:10,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246413330] [2020-01-16 19:00:10,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:10,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246413330] [2020-01-16 19:00:10,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:10,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:10,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46421013] [2020-01-16 19:00:10,292 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:10,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:10,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:10,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:10,293 INFO L87 Difference]: Start difference. First operand 389 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:00:10,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:10,378 INFO L93 Difference]: Finished difference Result 598 states and 1780 transitions. [2020-01-16 19:00:10,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:10,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:10,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:10,380 INFO L225 Difference]: With dead ends: 598 [2020-01-16 19:00:10,380 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 19:00:10,380 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:10,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 19:00:10,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 391. [2020-01-16 19:00:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:00:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1364 transitions. [2020-01-16 19:00:10,390 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1364 transitions. Word has length 22 [2020-01-16 19:00:10,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:10,390 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1364 transitions. [2020-01-16 19:00:10,390 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:10,390 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1364 transitions. [2020-01-16 19:00:10,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:10,390 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:10,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, 1, 1, 1] [2020-01-16 19:00:10,391 INFO L426 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:10,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:10,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1637972406, now seen corresponding path program 148 times [2020-01-16 19:00:10,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:10,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892734825] [2020-01-16 19:00:10,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:10,643 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 22 [2020-01-16 19:00:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:10,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892734825] [2020-01-16 19:00:10,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:10,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:10,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955236517] [2020-01-16 19:00:10,749 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:10,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:10,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:10,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:10,750 INFO L87 Difference]: Start difference. First operand 391 states and 1364 transitions. Second operand 9 states. [2020-01-16 19:00:10,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:10,860 INFO L93 Difference]: Finished difference Result 591 states and 1765 transitions. [2020-01-16 19:00:10,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:10,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:10,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:10,862 INFO L225 Difference]: With dead ends: 591 [2020-01-16 19:00:10,862 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:00:10,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:10,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:00:10,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 389. [2020-01-16 19:00:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:10,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1360 transitions. [2020-01-16 19:00:10,879 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1360 transitions. Word has length 22 [2020-01-16 19:00:10,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:10,880 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1360 transitions. [2020-01-16 19:00:10,880 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:10,880 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1360 transitions. [2020-01-16 19:00:10,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:10,881 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:10,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, 1, 1, 1] [2020-01-16 19:00:10,882 INFO L426 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:10,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:10,882 INFO L82 PathProgramCache]: Analyzing trace with hash 901636192, now seen corresponding path program 149 times [2020-01-16 19:00:10,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:10,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977564512] [2020-01-16 19:00:10,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:11,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977564512] [2020-01-16 19:00:11,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:11,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:11,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167705343] [2020-01-16 19:00:11,178 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:11,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:11,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:11,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:11,178 INFO L87 Difference]: Start difference. First operand 389 states and 1360 transitions. Second operand 9 states. [2020-01-16 19:00:11,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:11,280 INFO L93 Difference]: Finished difference Result 587 states and 1758 transitions. [2020-01-16 19:00:11,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:11,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:11,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:11,282 INFO L225 Difference]: With dead ends: 587 [2020-01-16 19:00:11,282 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:00:11,283 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:11,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:00:11,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 390. [2020-01-16 19:00:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1361 transitions. [2020-01-16 19:00:11,292 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1361 transitions. Word has length 22 [2020-01-16 19:00:11,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:11,292 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1361 transitions. [2020-01-16 19:00:11,292 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:11,292 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1361 transitions. [2020-01-16 19:00:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:11,293 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:11,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, 1, 1, 1] [2020-01-16 19:00:11,293 INFO L426 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:11,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:11,293 INFO L82 PathProgramCache]: Analyzing trace with hash -543880818, now seen corresponding path program 150 times [2020-01-16 19:00:11,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:11,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281976052] [2020-01-16 19:00:11,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:11,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-01-16 19:00:11,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281976052] [2020-01-16 19:00:11,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:11,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:11,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364471092] [2020-01-16 19:00:11,562 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:11,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:11,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:11,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:11,562 INFO L87 Difference]: Start difference. First operand 390 states and 1361 transitions. Second operand 9 states. [2020-01-16 19:00:11,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:11,655 INFO L93 Difference]: Finished difference Result 585 states and 1753 transitions. [2020-01-16 19:00:11,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:11,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:11,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:11,657 INFO L225 Difference]: With dead ends: 585 [2020-01-16 19:00:11,658 INFO L226 Difference]: Without dead ends: 573 [2020-01-16 19:00:11,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:11,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-01-16 19:00:11,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 387. [2020-01-16 19:00:11,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:00:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1356 transitions. [2020-01-16 19:00:11,667 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1356 transitions. Word has length 22 [2020-01-16 19:00:11,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:11,667 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1356 transitions. [2020-01-16 19:00:11,667 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:11,667 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1356 transitions. [2020-01-16 19:00:11,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:11,667 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:11,667 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:11,668 INFO L426 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:11,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:11,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1861648314, now seen corresponding path program 151 times [2020-01-16 19:00:11,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:11,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151445427] [2020-01-16 19:00:11,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:11,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:11,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151445427] [2020-01-16 19:00:11,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:11,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:11,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092920334] [2020-01-16 19:00:11,963 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:11,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:11,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:11,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:11,963 INFO L87 Difference]: Start difference. First operand 387 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:00:12,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:12,048 INFO L93 Difference]: Finished difference Result 614 states and 1824 transitions. [2020-01-16 19:00:12,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:12,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:12,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:12,050 INFO L225 Difference]: With dead ends: 614 [2020-01-16 19:00:12,050 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:00:12,051 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:12,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:00:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 395. [2020-01-16 19:00:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:00:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1376 transitions. [2020-01-16 19:00:12,060 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1376 transitions. Word has length 22 [2020-01-16 19:00:12,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:12,060 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1376 transitions. [2020-01-16 19:00:12,060 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:12,060 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1376 transitions. [2020-01-16 19:00:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:12,061 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:12,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, 1, 1, 1] [2020-01-16 19:00:12,061 INFO L426 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:12,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:12,061 INFO L82 PathProgramCache]: Analyzing trace with hash -271382428, now seen corresponding path program 152 times [2020-01-16 19:00:12,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:12,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058061143] [2020-01-16 19:00:12,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:12,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-01-16 19:00:12,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058061143] [2020-01-16 19:00:12,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:12,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:12,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078300184] [2020-01-16 19:00:12,332 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:12,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:12,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:12,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:12,333 INFO L87 Difference]: Start difference. First operand 395 states and 1376 transitions. Second operand 9 states. [2020-01-16 19:00:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:12,441 INFO L93 Difference]: Finished difference Result 609 states and 1811 transitions. [2020-01-16 19:00:12,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:12,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:12,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:12,443 INFO L225 Difference]: With dead ends: 609 [2020-01-16 19:00:12,443 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:00:12,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:00:12,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 391. [2020-01-16 19:00:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:00:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1366 transitions. [2020-01-16 19:00:12,452 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1366 transitions. Word has length 22 [2020-01-16 19:00:12,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:12,452 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1366 transitions. [2020-01-16 19:00:12,452 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1366 transitions. [2020-01-16 19:00:12,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:12,454 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:12,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, 1, 1, 1] [2020-01-16 19:00:12,454 INFO L426 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:12,454 INFO L82 PathProgramCache]: Analyzing trace with hash -529085386, now seen corresponding path program 153 times [2020-01-16 19:00:12,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:12,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753721439] [2020-01-16 19:00:12,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:12,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753721439] [2020-01-16 19:00:12,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:12,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:12,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841397369] [2020-01-16 19:00:12,743 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:12,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:12,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:12,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:12,743 INFO L87 Difference]: Start difference. First operand 391 states and 1366 transitions. Second operand 9 states. [2020-01-16 19:00:12,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:12,833 INFO L93 Difference]: Finished difference Result 618 states and 1830 transitions. [2020-01-16 19:00:12,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:12,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:12,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:12,835 INFO L225 Difference]: With dead ends: 618 [2020-01-16 19:00:12,835 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:00:12,835 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:12,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:00:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 397. [2020-01-16 19:00:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:00:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1376 transitions. [2020-01-16 19:00:12,845 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1376 transitions. Word has length 22 [2020-01-16 19:00:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:12,846 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1376 transitions. [2020-01-16 19:00:12,846 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1376 transitions. [2020-01-16 19:00:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:12,847 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:12,847 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:12,847 INFO L426 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:12,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:12,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2120185414, now seen corresponding path program 154 times [2020-01-16 19:00:12,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:12,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804931339] [2020-01-16 19:00:12,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:13,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-01-16 19:00:13,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804931339] [2020-01-16 19:00:13,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:13,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:13,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889898904] [2020-01-16 19:00:13,105 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:13,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:13,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:13,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:13,105 INFO L87 Difference]: Start difference. First operand 397 states and 1376 transitions. Second operand 9 states. [2020-01-16 19:00:13,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:13,214 INFO L93 Difference]: Finished difference Result 615 states and 1819 transitions. [2020-01-16 19:00:13,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:13,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:13,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:13,216 INFO L225 Difference]: With dead ends: 615 [2020-01-16 19:00:13,216 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 19:00:13,216 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:13,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 19:00:13,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 391. [2020-01-16 19:00:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:00:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-01-16 19:00:13,224 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-01-16 19:00:13,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:13,224 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-01-16 19:00:13,224 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-01-16 19:00:13,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:13,225 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:13,225 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:13,225 INFO L426 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:13,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:13,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1744381800, now seen corresponding path program 155 times [2020-01-16 19:00:13,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:13,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070917693] [2020-01-16 19:00:13,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:13,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:13,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070917693] [2020-01-16 19:00:13,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:13,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:13,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891283697] [2020-01-16 19:00:13,488 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:13,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:13,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:13,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:13,488 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:00:13,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:13,604 INFO L93 Difference]: Finished difference Result 605 states and 1800 transitions. [2020-01-16 19:00:13,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:13,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:13,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:13,606 INFO L225 Difference]: With dead ends: 605 [2020-01-16 19:00:13,606 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:00:13,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:00:13,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 394. [2020-01-16 19:00:13,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:00:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1367 transitions. [2020-01-16 19:00:13,616 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1367 transitions. Word has length 22 [2020-01-16 19:00:13,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:13,616 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1367 transitions. [2020-01-16 19:00:13,616 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:13,616 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1367 transitions. [2020-01-16 19:00:13,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:13,617 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:13,617 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:13,617 INFO L426 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:13,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:13,617 INFO L82 PathProgramCache]: Analyzing trace with hash -15334466, now seen corresponding path program 156 times [2020-01-16 19:00:13,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:13,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449419577] [2020-01-16 19:00:13,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:13,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-01-16 19:00:13,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449419577] [2020-01-16 19:00:13,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:13,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:13,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736365604] [2020-01-16 19:00:13,870 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:13,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:13,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:13,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:13,870 INFO L87 Difference]: Start difference. First operand 394 states and 1367 transitions. Second operand 9 states. [2020-01-16 19:00:14,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:14,003 INFO L93 Difference]: Finished difference Result 607 states and 1801 transitions. [2020-01-16 19:00:14,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:14,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:14,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:14,004 INFO L225 Difference]: With dead ends: 607 [2020-01-16 19:00:14,005 INFO L226 Difference]: Without dead ends: 587 [2020-01-16 19:00:14,005 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:14,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-01-16 19:00:14,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 387. [2020-01-16 19:00:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:00:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1354 transitions. [2020-01-16 19:00:14,014 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1354 transitions. Word has length 22 [2020-01-16 19:00:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:14,014 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1354 transitions. [2020-01-16 19:00:14,014 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1354 transitions. [2020-01-16 19:00:14,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:14,015 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:14,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, 1, 1, 1] [2020-01-16 19:00:14,015 INFO L426 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:14,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1145435970, now seen corresponding path program 157 times [2020-01-16 19:00:14,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:14,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716155713] [2020-01-16 19:00:14,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:14,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-01-16 19:00:14,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716155713] [2020-01-16 19:00:14,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:14,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:14,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519366938] [2020-01-16 19:00:14,270 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:14,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:14,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:14,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:14,271 INFO L87 Difference]: Start difference. First operand 387 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:00:14,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:14,377 INFO L93 Difference]: Finished difference Result 602 states and 1788 transitions. [2020-01-16 19:00:14,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:14,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:14,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:14,379 INFO L225 Difference]: With dead ends: 602 [2020-01-16 19:00:14,379 INFO L226 Difference]: Without dead ends: 586 [2020-01-16 19:00:14,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:14,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-01-16 19:00:14,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 391. [2020-01-16 19:00:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:00:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-01-16 19:00:14,389 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-01-16 19:00:14,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:14,389 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-01-16 19:00:14,389 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:14,389 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-01-16 19:00:14,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:14,390 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:14,390 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:14,390 INFO L426 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:14,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:14,390 INFO L82 PathProgramCache]: Analyzing trace with hash -584367478, now seen corresponding path program 158 times [2020-01-16 19:00:14,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:14,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944983682] [2020-01-16 19:00:14,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:14,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-01-16 19:00:14,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944983682] [2020-01-16 19:00:14,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:14,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:14,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366689496] [2020-01-16 19:00:14,639 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:14,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:14,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:14,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:14,639 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:00:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:14,723 INFO L93 Difference]: Finished difference Result 595 states and 1773 transitions. [2020-01-16 19:00:14,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:14,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:14,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:14,725 INFO L225 Difference]: With dead ends: 595 [2020-01-16 19:00:14,725 INFO L226 Difference]: Without dead ends: 584 [2020-01-16 19:00:14,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:14,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-01-16 19:00:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 389. [2020-01-16 19:00:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1358 transitions. [2020-01-16 19:00:14,733 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1358 transitions. Word has length 22 [2020-01-16 19:00:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:14,733 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1358 transitions. [2020-01-16 19:00:14,734 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1358 transitions. [2020-01-16 19:00:14,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:14,734 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:14,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:14,734 INFO L426 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:14,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:14,735 INFO L82 PathProgramCache]: Analyzing trace with hash 961348150, now seen corresponding path program 159 times [2020-01-16 19:00:14,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:14,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444012389] [2020-01-16 19:00:14,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:15,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-01-16 19:00:15,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444012389] [2020-01-16 19:00:15,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:15,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:15,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346855210] [2020-01-16 19:00:15,020 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:15,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:15,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:15,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:15,020 INFO L87 Difference]: Start difference. First operand 389 states and 1358 transitions. Second operand 9 states. [2020-01-16 19:00:15,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:15,106 INFO L93 Difference]: Finished difference Result 610 states and 1806 transitions. [2020-01-16 19:00:15,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:15,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:15,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:15,107 INFO L225 Difference]: With dead ends: 610 [2020-01-16 19:00:15,108 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:00:15,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:15,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:00:15,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 395. [2020-01-16 19:00:15,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:00:15,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1368 transitions. [2020-01-16 19:00:15,117 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1368 transitions. Word has length 22 [2020-01-16 19:00:15,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:15,118 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1368 transitions. [2020-01-16 19:00:15,118 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:15,118 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1368 transitions. [2020-01-16 19:00:15,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:15,118 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:15,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, 1, 1, 1] [2020-01-16 19:00:15,118 INFO L426 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:15,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:15,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1154168842, now seen corresponding path program 160 times [2020-01-16 19:00:15,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:15,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094709920] [2020-01-16 19:00:15,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:15,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-01-16 19:00:15,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094709920] [2020-01-16 19:00:15,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:15,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:15,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881923109] [2020-01-16 19:00:15,380 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:15,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:15,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:15,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:15,380 INFO L87 Difference]: Start difference. First operand 395 states and 1368 transitions. Second operand 9 states. [2020-01-16 19:00:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:15,505 INFO L93 Difference]: Finished difference Result 607 states and 1795 transitions. [2020-01-16 19:00:15,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:15,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:15,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:15,507 INFO L225 Difference]: With dead ends: 607 [2020-01-16 19:00:15,507 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 19:00:15,508 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:15,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 19:00:15,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 389. [2020-01-16 19:00:15,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-01-16 19:00:15,516 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-01-16 19:00:15,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:15,516 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-01-16 19:00:15,516 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-01-16 19:00:15,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:15,517 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:15,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, 1, 1, 1] [2020-01-16 19:00:15,517 INFO L426 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:15,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:15,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1016070376, now seen corresponding path program 161 times [2020-01-16 19:00:15,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:15,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949294014] [2020-01-16 19:00:15,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:15,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-01-16 19:00:15,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949294014] [2020-01-16 19:00:15,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:15,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:15,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313179653] [2020-01-16 19:00:15,774 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:15,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:15,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:15,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:15,775 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:00:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:15,871 INFO L93 Difference]: Finished difference Result 591 states and 1764 transitions. [2020-01-16 19:00:15,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:15,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:15,873 INFO L225 Difference]: With dead ends: 591 [2020-01-16 19:00:15,873 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 19:00:15,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 19:00:15,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 390. [2020-01-16 19:00:15,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:15,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1357 transitions. [2020-01-16 19:00:15,882 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1357 transitions. Word has length 22 [2020-01-16 19:00:15,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:15,883 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1357 transitions. [2020-01-16 19:00:15,883 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:15,883 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1357 transitions. [2020-01-16 19:00:15,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:15,883 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00: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, 1, 1, 1] [2020-01-16 19:00:15,883 INFO L426 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:15,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:15,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1132726160, now seen corresponding path program 162 times [2020-01-16 19:00:15,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:15,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978723949] [2020-01-16 19:00:15,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:16,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978723949] [2020-01-16 19:00:16,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:16,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:16,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535665141] [2020-01-16 19:00:16,135 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:16,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:16,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:16,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:16,136 INFO L87 Difference]: Start difference. First operand 390 states and 1357 transitions. Second operand 9 states. [2020-01-16 19:00:16,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:16,246 INFO L93 Difference]: Finished difference Result 595 states and 1771 transitions. [2020-01-16 19:00:16,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:16,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:16,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:16,248 INFO L225 Difference]: With dead ends: 595 [2020-01-16 19:00:16,248 INFO L226 Difference]: Without dead ends: 579 [2020-01-16 19:00:16,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:16,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-01-16 19:00:16,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 387. [2020-01-16 19:00:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:00:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1352 transitions. [2020-01-16 19:00:16,264 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1352 transitions. Word has length 22 [2020-01-16 19:00:16,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:16,264 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1352 transitions. [2020-01-16 19:00:16,264 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:16,264 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1352 transitions. [2020-01-16 19:00:16,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:16,264 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:16,265 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:16,265 INFO L426 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:16,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:16,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1512341980, now seen corresponding path program 163 times [2020-01-16 19:00:16,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:16,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816441687] [2020-01-16 19:00:16,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:16,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:16,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816441687] [2020-01-16 19:00:16,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:16,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:16,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302972867] [2020-01-16 19:00:16,527 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:16,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:16,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:16,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:16,527 INFO L87 Difference]: Start difference. First operand 387 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:00:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:16,637 INFO L93 Difference]: Finished difference Result 581 states and 1744 transitions. [2020-01-16 19:00:16,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:16,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:16,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:16,639 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:00:16,639 INFO L226 Difference]: Without dead ends: 570 [2020-01-16 19:00:16,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:16,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-01-16 19:00:16,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 389. [2020-01-16 19:00:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-01-16 19:00:16,648 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-01-16 19:00:16,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:16,649 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-01-16 19:00:16,649 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-01-16 19:00:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:16,649 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:16,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, 1, 1, 1] [2020-01-16 19:00:16,650 INFO L426 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:16,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:16,650 INFO L82 PathProgramCache]: Analyzing trace with hash 66824970, now seen corresponding path program 164 times [2020-01-16 19:00:16,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:16,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021691647] [2020-01-16 19:00:16,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:16,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-01-16 19:00:16,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021691647] [2020-01-16 19:00:16,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:16,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:16,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653058592] [2020-01-16 19:00:16,914 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:16,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:16,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:16,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:16,915 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:00:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:17,003 INFO L93 Difference]: Finished difference Result 579 states and 1739 transitions. [2020-01-16 19:00:17,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:17,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:17,005 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:00:17,005 INFO L226 Difference]: Without dead ends: 569 [2020-01-16 19:00:17,005 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-01-16 19:00:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 388. [2020-01-16 19:00:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:00:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1354 transitions. [2020-01-16 19:00:17,014 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1354 transitions. Word has length 22 [2020-01-16 19:00:17,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:17,014 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1354 transitions. [2020-01-16 19:00:17,015 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1354 transitions. [2020-01-16 19:00:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:17,015 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:17,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, 1, 1, 1] [2020-01-16 19:00:17,015 INFO L426 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:17,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:17,016 INFO L82 PathProgramCache]: Analyzing trace with hash -675841196, now seen corresponding path program 165 times [2020-01-16 19:00:17,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:17,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728321255] [2020-01-16 19:00:17,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:17,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728321255] [2020-01-16 19:00:17,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:17,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:17,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37071105] [2020-01-16 19:00:17,294 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:17,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:17,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:17,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:17,295 INFO L87 Difference]: Start difference. First operand 388 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:00:17,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:17,403 INFO L93 Difference]: Finished difference Result 587 states and 1757 transitions. [2020-01-16 19:00:17,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:17,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:17,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:17,405 INFO L225 Difference]: With dead ends: 587 [2020-01-16 19:00:17,405 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:00:17,405 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:17,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:00:17,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 391. [2020-01-16 19:00:17,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:00:17,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1359 transitions. [2020-01-16 19:00:17,415 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1359 transitions. Word has length 22 [2020-01-16 19:00:17,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:17,415 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1359 transitions. [2020-01-16 19:00:17,415 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1359 transitions. [2020-01-16 19:00:17,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:17,416 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:17,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, 1, 1, 1] [2020-01-16 19:00:17,416 INFO L426 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:17,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:17,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1457840438, now seen corresponding path program 166 times [2020-01-16 19:00:17,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:17,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039395885] [2020-01-16 19:00:17,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:17,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-01-16 19:00:17,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039395885] [2020-01-16 19:00:17,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:17,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:17,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202230008] [2020-01-16 19:00:17,670 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:17,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:17,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:17,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:17,671 INFO L87 Difference]: Start difference. First operand 391 states and 1359 transitions. Second operand 9 states. [2020-01-16 19:00:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:17,803 INFO L93 Difference]: Finished difference Result 589 states and 1758 transitions. [2020-01-16 19:00:17,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:17,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:17,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:17,805 INFO L225 Difference]: With dead ends: 589 [2020-01-16 19:00:17,805 INFO L226 Difference]: Without dead ends: 573 [2020-01-16 19:00:17,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:17,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-01-16 19:00:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 388. [2020-01-16 19:00:17,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:00:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1353 transitions. [2020-01-16 19:00:17,814 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1353 transitions. Word has length 22 [2020-01-16 19:00:17,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:17,815 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1353 transitions. [2020-01-16 19:00:17,815 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:17,815 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1353 transitions. [2020-01-16 19:00:17,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:17,815 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:17,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, 1, 1, 1] [2020-01-16 19:00:17,816 INFO L426 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:17,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:17,816 INFO L82 PathProgramCache]: Analyzing trace with hash 573171236, now seen corresponding path program 167 times [2020-01-16 19:00:17,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:17,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549788496] [2020-01-16 19:00:17,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:18,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-01-16 19:00:18,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549788496] [2020-01-16 19:00:18,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:18,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:18,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833816284] [2020-01-16 19:00:18,076 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:18,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:18,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:18,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:18,077 INFO L87 Difference]: Start difference. First operand 388 states and 1353 transitions. Second operand 9 states. [2020-01-16 19:00:18,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:18,188 INFO L93 Difference]: Finished difference Result 581 states and 1742 transitions. [2020-01-16 19:00:18,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:18,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:18,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:18,189 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:00:18,190 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:00:18,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:18,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:00:18,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 389. [2020-01-16 19:00:18,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1354 transitions. [2020-01-16 19:00:18,199 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1354 transitions. Word has length 22 [2020-01-16 19:00:18,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:18,199 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1354 transitions. [2020-01-16 19:00:18,199 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:18,199 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1354 transitions. [2020-01-16 19:00:18,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:18,200 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:18,200 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:18,200 INFO L426 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:18,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:18,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1575625300, now seen corresponding path program 168 times [2020-01-16 19:00:18,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:18,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871975305] [2020-01-16 19:00:18,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:18,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871975305] [2020-01-16 19:00:18,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:18,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:18,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470604180] [2020-01-16 19:00:18,452 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:18,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:18,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:18,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:18,453 INFO L87 Difference]: Start difference. First operand 389 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:00:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:18,561 INFO L93 Difference]: Finished difference Result 585 states and 1749 transitions. [2020-01-16 19:00:18,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:18,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:18,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:18,563 INFO L225 Difference]: With dead ends: 585 [2020-01-16 19:00:18,563 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:00:18,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:18,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:00:18,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 385. [2020-01-16 19:00:18,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:00:18,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1348 transitions. [2020-01-16 19:00:18,573 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1348 transitions. Word has length 22 [2020-01-16 19:00:18,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:18,573 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1348 transitions. [2020-01-16 19:00:18,573 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1348 transitions. [2020-01-16 19:00:18,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:18,574 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:18,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, 1, 1, 1] [2020-01-16 19:00:18,574 INFO L426 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:18,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:18,574 INFO L82 PathProgramCache]: Analyzing trace with hash 108734734, now seen corresponding path program 169 times [2020-01-16 19:00:18,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:18,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798213076] [2020-01-16 19:00:18,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:18,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798213076] [2020-01-16 19:00:18,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:18,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:18,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331344877] [2020-01-16 19:00:18,826 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:18,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:18,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:18,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:18,827 INFO L87 Difference]: Start difference. First operand 385 states and 1348 transitions. Second operand 9 states. [2020-01-16 19:00:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:18,932 INFO L93 Difference]: Finished difference Result 614 states and 1830 transitions. [2020-01-16 19:00:18,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:18,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:18,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:18,934 INFO L225 Difference]: With dead ends: 614 [2020-01-16 19:00:18,934 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:00:18,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:18,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:00:18,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 395. [2020-01-16 19:00:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:00:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1377 transitions. [2020-01-16 19:00:18,944 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1377 transitions. Word has length 22 [2020-01-16 19:00:18,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:18,944 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1377 transitions. [2020-01-16 19:00:18,944 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1377 transitions. [2020-01-16 19:00:18,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:18,944 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:18,945 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:18,945 INFO L426 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:18,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:18,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1699000620, now seen corresponding path program 170 times [2020-01-16 19:00:18,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:18,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492066589] [2020-01-16 19:00:18,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:19,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-01-16 19:00:19,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492066589] [2020-01-16 19:00:19,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:19,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:19,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817440778] [2020-01-16 19:00:19,224 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:19,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:19,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:19,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:19,224 INFO L87 Difference]: Start difference. First operand 395 states and 1377 transitions. Second operand 9 states. [2020-01-16 19:00:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:19,333 INFO L93 Difference]: Finished difference Result 609 states and 1817 transitions. [2020-01-16 19:00:19,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:19,333 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:19,334 INFO L225 Difference]: With dead ends: 609 [2020-01-16 19:00:19,335 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:00:19,335 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:19,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:00:19,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 391. [2020-01-16 19:00:19,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:00:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1368 transitions. [2020-01-16 19:00:19,344 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1368 transitions. Word has length 22 [2020-01-16 19:00:19,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:19,344 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1368 transitions. [2020-01-16 19:00:19,344 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1368 transitions. [2020-01-16 19:00:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:19,345 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:19,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, 1, 1, 1] [2020-01-16 19:00:19,345 INFO L426 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:19,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:19,345 INFO L82 PathProgramCache]: Analyzing trace with hash 209646906, now seen corresponding path program 171 times [2020-01-16 19:00:19,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:19,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895593135] [2020-01-16 19:00:19,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:19,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-01-16 19:00:19,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895593135] [2020-01-16 19:00:19,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:19,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:19,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106089325] [2020-01-16 19:00:19,675 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:19,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:19,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:19,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:19,676 INFO L87 Difference]: Start difference. First operand 391 states and 1368 transitions. Second operand 9 states. [2020-01-16 19:00:19,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:19,800 INFO L93 Difference]: Finished difference Result 612 states and 1822 transitions. [2020-01-16 19:00:19,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:19,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:19,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:19,802 INFO L225 Difference]: With dead ends: 612 [2020-01-16 19:00:19,803 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 19:00:19,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:19,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 19:00:19,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 394. [2020-01-16 19:00:19,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:00:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1372 transitions. [2020-01-16 19:00:19,817 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1372 transitions. Word has length 22 [2020-01-16 19:00:19,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:19,817 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1372 transitions. [2020-01-16 19:00:19,817 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:19,817 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1372 transitions. [2020-01-16 19:00:19,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:19,818 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:19,818 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:19,818 INFO L426 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:19,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:19,819 INFO L82 PathProgramCache]: Analyzing trace with hash 336283280, now seen corresponding path program 172 times [2020-01-16 19:00:19,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:19,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701676862] [2020-01-16 19:00:19,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:20,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:20,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701676862] [2020-01-16 19:00:20,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:20,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:20,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216037059] [2020-01-16 19:00:20,068 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:20,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:20,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:20,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:20,068 INFO L87 Difference]: Start difference. First operand 394 states and 1372 transitions. Second operand 9 states. [2020-01-16 19:00:20,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:20,175 INFO L93 Difference]: Finished difference Result 606 states and 1808 transitions. [2020-01-16 19:00:20,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:20,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:20,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:20,177 INFO L225 Difference]: With dead ends: 606 [2020-01-16 19:00:20,177 INFO L226 Difference]: Without dead ends: 593 [2020-01-16 19:00:20,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:20,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-01-16 19:00:20,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 391. [2020-01-16 19:00:20,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:00:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1365 transitions. [2020-01-16 19:00:20,186 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1365 transitions. Word has length 22 [2020-01-16 19:00:20,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:20,186 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1365 transitions. [2020-01-16 19:00:20,186 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:20,186 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1365 transitions. [2020-01-16 19:00:20,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:20,187 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:20,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, 1, 1, 1] [2020-01-16 19:00:20,187 INFO L426 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:20,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:20,187 INFO L82 PathProgramCache]: Analyzing trace with hash -2078734888, now seen corresponding path program 173 times [2020-01-16 19:00:20,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:20,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429768732] [2020-01-16 19:00:20,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:20,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-01-16 19:00:20,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429768732] [2020-01-16 19:00:20,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:20,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:20,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864523335] [2020-01-16 19:00:20,444 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:20,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:20,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:20,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:20,445 INFO L87 Difference]: Start difference. First operand 391 states and 1365 transitions. Second operand 9 states. [2020-01-16 19:00:20,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:20,551 INFO L93 Difference]: Finished difference Result 601 states and 1799 transitions. [2020-01-16 19:00:20,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:20,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:20,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:20,553 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:00:20,553 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 19:00:20,553 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:20,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 19:00:20,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 393. [2020-01-16 19:00:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:00:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1368 transitions. [2020-01-16 19:00:20,563 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1368 transitions. Word has length 22 [2020-01-16 19:00:20,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:20,563 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1368 transitions. [2020-01-16 19:00:20,563 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:20,563 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1368 transitions. [2020-01-16 19:00:20,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:20,564 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:20,564 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:20,564 INFO L426 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:20,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:20,564 INFO L82 PathProgramCache]: Analyzing trace with hash -736802100, now seen corresponding path program 174 times [2020-01-16 19:00:20,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:20,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550937403] [2020-01-16 19:00:20,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:20,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-01-16 19:00:20,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550937403] [2020-01-16 19:00:20,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:20,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:20,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107613378] [2020-01-16 19:00:20,822 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:20,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:20,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:20,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:20,823 INFO L87 Difference]: Start difference. First operand 393 states and 1368 transitions. Second operand 9 states. [2020-01-16 19:00:20,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:20,923 INFO L93 Difference]: Finished difference Result 600 states and 1795 transitions. [2020-01-16 19:00:20,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:20,923 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:20,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:20,925 INFO L225 Difference]: With dead ends: 600 [2020-01-16 19:00:20,925 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 19:00:20,925 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:20,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 19:00:20,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 388. [2020-01-16 19:00:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:00:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1358 transitions. [2020-01-16 19:00:20,936 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1358 transitions. Word has length 22 [2020-01-16 19:00:20,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:20,936 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1358 transitions. [2020-01-16 19:00:20,936 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1358 transitions. [2020-01-16 19:00:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:20,937 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:20,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, 1, 1, 1] [2020-01-16 19:00:20,938 INFO L426 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:20,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:20,938 INFO L82 PathProgramCache]: Analyzing trace with hash -2073803932, now seen corresponding path program 175 times [2020-01-16 19:00:20,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:20,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680078156] [2020-01-16 19:00:20,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:21,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-01-16 19:00:21,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680078156] [2020-01-16 19:00:21,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:21,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:21,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555085427] [2020-01-16 19:00:21,191 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:21,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:21,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:21,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:21,192 INFO L87 Difference]: Start difference. First operand 388 states and 1358 transitions. Second operand 9 states. [2020-01-16 19:00:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:21,273 INFO L93 Difference]: Finished difference Result 622 states and 1849 transitions. [2020-01-16 19:00:21,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:21,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:21,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:21,275 INFO L225 Difference]: With dead ends: 622 [2020-01-16 19:00:21,275 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 19:00:21,275 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:21,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 19:00:21,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 396. [2020-01-16 19:00:21,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:00:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1378 transitions. [2020-01-16 19:00:21,284 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1378 transitions. Word has length 22 [2020-01-16 19:00:21,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:21,284 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1378 transitions. [2020-01-16 19:00:21,284 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:21,284 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1378 transitions. [2020-01-16 19:00:21,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:21,285 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:21,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, 1, 1, 1] [2020-01-16 19:00:21,285 INFO L426 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:21,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:21,285 INFO L82 PathProgramCache]: Analyzing trace with hash -483538046, now seen corresponding path program 176 times [2020-01-16 19:00:21,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:21,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401782728] [2020-01-16 19:00:21,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:21,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401782728] [2020-01-16 19:00:21,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:21,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:21,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491688544] [2020-01-16 19:00:21,534 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:21,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:21,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:21,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:21,535 INFO L87 Difference]: Start difference. First operand 396 states and 1378 transitions. Second operand 9 states. [2020-01-16 19:00:21,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:21,634 INFO L93 Difference]: Finished difference Result 617 states and 1836 transitions. [2020-01-16 19:00:21,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:21,635 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:21,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:21,636 INFO L225 Difference]: With dead ends: 617 [2020-01-16 19:00:21,636 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:00:21,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:21,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:00:21,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 392. [2020-01-16 19:00:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:00:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1368 transitions. [2020-01-16 19:00:21,645 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1368 transitions. Word has length 22 [2020-01-16 19:00:21,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:21,645 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1368 transitions. [2020-01-16 19:00:21,645 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:21,645 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1368 transitions. [2020-01-16 19:00:21,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:21,646 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:21,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, 1, 1, 1] [2020-01-16 19:00:21,646 INFO L426 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:21,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:21,646 INFO L82 PathProgramCache]: Analyzing trace with hash -741241004, now seen corresponding path program 177 times [2020-01-16 19:00:21,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:21,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196546879] [2020-01-16 19:00:21,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00: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-01-16 19:00:21,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196546879] [2020-01-16 19:00:21,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:21,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:21,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614487766] [2020-01-16 19:00:21,917 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:21,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:21,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:21,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:21,917 INFO L87 Difference]: Start difference. First operand 392 states and 1368 transitions. Second operand 9 states. [2020-01-16 19:00:21,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:21,991 INFO L93 Difference]: Finished difference Result 626 states and 1855 transitions. [2020-01-16 19:00:21,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:21,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:21,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:21,993 INFO L225 Difference]: With dead ends: 626 [2020-01-16 19:00:21,993 INFO L226 Difference]: Without dead ends: 610 [2020-01-16 19:00:21,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:21,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-01-16 19:00:22,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 398. [2020-01-16 19:00:22,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 19:00:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1378 transitions. [2020-01-16 19:00:22,003 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1378 transitions. Word has length 22 [2020-01-16 19:00:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:22,003 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1378 transitions. [2020-01-16 19:00:22,003 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1378 transitions. [2020-01-16 19:00:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:22,003 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:22,004 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:22,004 INFO L426 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:22,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:22,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1962626264, now seen corresponding path program 178 times [2020-01-16 19:00:22,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:22,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385388799] [2020-01-16 19:00:22,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:22,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385388799] [2020-01-16 19:00:22,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:22,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:22,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022860936] [2020-01-16 19:00:22,263 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:22,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:22,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:22,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:22,264 INFO L87 Difference]: Start difference. First operand 398 states and 1378 transitions. Second operand 9 states. [2020-01-16 19:00:22,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:22,375 INFO L93 Difference]: Finished difference Result 623 states and 1844 transitions. [2020-01-16 19:00:22,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:22,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:22,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:22,376 INFO L225 Difference]: With dead ends: 623 [2020-01-16 19:00:22,377 INFO L226 Difference]: Without dead ends: 604 [2020-01-16 19:00:22,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:22,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-01-16 19:00:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 392. [2020-01-16 19:00:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:00:22,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1364 transitions. [2020-01-16 19:00:22,386 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1364 transitions. Word has length 22 [2020-01-16 19:00:22,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:22,386 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1364 transitions. [2020-01-16 19:00:22,386 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:22,386 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1364 transitions. [2020-01-16 19:00:22,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:22,387 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:22,387 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:22,387 INFO L426 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:22,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:22,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1956537418, now seen corresponding path program 179 times [2020-01-16 19:00:22,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:22,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409511520] [2020-01-16 19:00:22,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:22,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409511520] [2020-01-16 19:00:22,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:22,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:22,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423332114] [2020-01-16 19:00:22,633 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:22,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:22,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:22,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:22,633 INFO L87 Difference]: Start difference. First operand 392 states and 1364 transitions. Second operand 9 states. [2020-01-16 19:00:22,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:22,738 INFO L93 Difference]: Finished difference Result 613 states and 1825 transitions. [2020-01-16 19:00:22,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:22,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:22,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:22,740 INFO L225 Difference]: With dead ends: 613 [2020-01-16 19:00:22,740 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:00:22,741 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:22,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:00:22,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 395. [2020-01-16 19:00:22,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:00:22,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1369 transitions. [2020-01-16 19:00:22,749 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1369 transitions. Word has length 22 [2020-01-16 19:00:22,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:22,749 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1369 transitions. [2020-01-16 19:00:22,749 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:22,749 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1369 transitions. [2020-01-16 19:00:22,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:22,749 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:22,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, 1, 1, 1] [2020-01-16 19:00:22,750 INFO L426 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:22,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:22,750 INFO L82 PathProgramCache]: Analyzing trace with hash -227490084, now seen corresponding path program 180 times [2020-01-16 19:00:22,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:22,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820142559] [2020-01-16 19:00:22,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:23,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-01-16 19:00:23,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820142559] [2020-01-16 19:00:23,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:23,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:23,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142098418] [2020-01-16 19:00:23,002 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:23,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:23,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:23,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:23,002 INFO L87 Difference]: Start difference. First operand 395 states and 1369 transitions. Second operand 9 states. [2020-01-16 19:00:23,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:23,123 INFO L93 Difference]: Finished difference Result 615 states and 1826 transitions. [2020-01-16 19:00:23,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:23,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:23,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:23,125 INFO L225 Difference]: With dead ends: 615 [2020-01-16 19:00:23,125 INFO L226 Difference]: Without dead ends: 595 [2020-01-16 19:00:23,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-01-16 19:00:23,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 388. [2020-01-16 19:00:23,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:00:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1355 transitions. [2020-01-16 19:00:23,134 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1355 transitions. Word has length 22 [2020-01-16 19:00:23,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:23,134 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1355 transitions. [2020-01-16 19:00:23,134 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1355 transitions. [2020-01-16 19:00:23,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:23,135 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:23,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, 1, 1, 1] [2020-01-16 19:00:23,135 INFO L426 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:23,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:23,136 INFO L82 PathProgramCache]: Analyzing trace with hash -485724428, now seen corresponding path program 181 times [2020-01-16 19:00:23,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:23,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041335075] [2020-01-16 19:00:23,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:23,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-01-16 19:00:23,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041335075] [2020-01-16 19:00:23,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:23,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:23,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848433229] [2020-01-16 19:00:23,387 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:23,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:23,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:23,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:23,388 INFO L87 Difference]: Start difference. First operand 388 states and 1355 transitions. Second operand 9 states. [2020-01-16 19:00:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:23,467 INFO L93 Difference]: Finished difference Result 616 states and 1829 transitions. [2020-01-16 19:00:23,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:23,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:23,469 INFO L225 Difference]: With dead ends: 616 [2020-01-16 19:00:23,469 INFO L226 Difference]: Without dead ends: 600 [2020-01-16 19:00:23,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:23,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-01-16 19:00:23,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 394. [2020-01-16 19:00:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:00:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1369 transitions. [2020-01-16 19:00:23,479 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1369 transitions. Word has length 22 [2020-01-16 19:00:23,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:23,480 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1369 transitions. [2020-01-16 19:00:23,480 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1369 transitions. [2020-01-16 19:00:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:23,480 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:23,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, 1, 1, 1] [2020-01-16 19:00:23,480 INFO L426 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:23,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:23,481 INFO L82 PathProgramCache]: Analyzing trace with hash -359088054, now seen corresponding path program 182 times [2020-01-16 19:00:23,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:23,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890316641] [2020-01-16 19:00:23,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:23,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-01-16 19:00:23,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890316641] [2020-01-16 19:00:23,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:23,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:23,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466350605] [2020-01-16 19:00:23,815 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:23,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:23,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:23,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:23,816 INFO L87 Difference]: Start difference. First operand 394 states and 1369 transitions. Second operand 9 states. [2020-01-16 19:00:23,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:23,947 INFO L93 Difference]: Finished difference Result 610 states and 1815 transitions. [2020-01-16 19:00:23,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:23,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:23,950 INFO L225 Difference]: With dead ends: 610 [2020-01-16 19:00:23,950 INFO L226 Difference]: Without dead ends: 597 [2020-01-16 19:00:23,950 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-01-16 19:00:23,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 391. [2020-01-16 19:00:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:00:23,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-01-16 19:00:23,968 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-01-16 19:00:23,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:23,968 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-01-16 19:00:23,969 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:23,969 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-01-16 19:00:23,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:23,970 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:23,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, 1, 1, 1] [2020-01-16 19:00:23,970 INFO L426 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:23,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:23,970 INFO L82 PathProgramCache]: Analyzing trace with hash 49505374, now seen corresponding path program 183 times [2020-01-16 19:00:23,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:23,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224420411] [2020-01-16 19:00:23,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:24,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-01-16 19:00:24,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224420411] [2020-01-16 19:00:24,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:24,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:24,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16001388] [2020-01-16 19:00:24,233 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:24,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:24,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:24,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:24,233 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:00:24,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:24,308 INFO L93 Difference]: Finished difference Result 622 states and 1841 transitions. [2020-01-16 19:00:24,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:24,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:24,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:24,310 INFO L225 Difference]: With dead ends: 622 [2020-01-16 19:00:24,310 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 19:00:24,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 19:00:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 397. [2020-01-16 19:00:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:00:24,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1372 transitions. [2020-01-16 19:00:24,322 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1372 transitions. Word has length 22 [2020-01-16 19:00:24,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:24,322 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1372 transitions. [2020-01-16 19:00:24,322 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:24,322 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1372 transitions. [2020-01-16 19:00:24,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:24,323 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:24,323 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:24,323 INFO L426 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:24,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:24,323 INFO L82 PathProgramCache]: Analyzing trace with hash 795936300, now seen corresponding path program 184 times [2020-01-16 19:00:24,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:24,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129951653] [2020-01-16 19:00:24,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:24,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129951653] [2020-01-16 19:00:24,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:24,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:24,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745705667] [2020-01-16 19:00:24,583 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:24,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:24,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:24,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:24,587 INFO L87 Difference]: Start difference. First operand 397 states and 1372 transitions. Second operand 9 states. [2020-01-16 19:00:24,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:24,685 INFO L93 Difference]: Finished difference Result 619 states and 1830 transitions. [2020-01-16 19:00:24,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:24,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:24,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:24,688 INFO L225 Difference]: With dead ends: 619 [2020-01-16 19:00:24,689 INFO L226 Difference]: Without dead ends: 600 [2020-01-16 19:00:24,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:24,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-01-16 19:00:24,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 391. [2020-01-16 19:00:24,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:00:24,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1359 transitions. [2020-01-16 19:00:24,700 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1359 transitions. Word has length 22 [2020-01-16 19:00:24,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:24,700 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1359 transitions. [2020-01-16 19:00:24,700 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:24,701 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1359 transitions. [2020-01-16 19:00:24,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:24,701 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:24,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, 1, 1, 1] [2020-01-16 19:00:24,702 INFO L426 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:24,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:24,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1970029012, now seen corresponding path program 185 times [2020-01-16 19:00:24,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:24,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399950223] [2020-01-16 19:00:24,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:24,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-01-16 19:00:24,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399950223] [2020-01-16 19:00:24,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:24,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:24,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63916147] [2020-01-16 19:00:24,978 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:24,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:24,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:24,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:24,978 INFO L87 Difference]: Start difference. First operand 391 states and 1359 transitions. Second operand 9 states. [2020-01-16 19:00:25,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:25,081 INFO L93 Difference]: Finished difference Result 606 states and 1805 transitions. [2020-01-16 19:00:25,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:25,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:25,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:25,082 INFO L225 Difference]: With dead ends: 606 [2020-01-16 19:00:25,083 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 19:00:25,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:25,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 19:00:25,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 393. [2020-01-16 19:00:25,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:00:25,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1362 transitions. [2020-01-16 19:00:25,092 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1362 transitions. Word has length 22 [2020-01-16 19:00:25,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:25,092 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1362 transitions. [2020-01-16 19:00:25,092 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:25,093 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1362 transitions. [2020-01-16 19:00:25,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:25,093 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:25,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, 1, 1, 1] [2020-01-16 19:00:25,093 INFO L426 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:25,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:25,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1398574206, now seen corresponding path program 186 times [2020-01-16 19:00:25,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:25,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828906203] [2020-01-16 19:00:25,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:25,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-01-16 19:00:25,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828906203] [2020-01-16 19:00:25,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:25,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:25,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484206852] [2020-01-16 19:00:25,346 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:25,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:25,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:25,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:25,346 INFO L87 Difference]: Start difference. First operand 393 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:00:25,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:25,452 INFO L93 Difference]: Finished difference Result 609 states and 1809 transitions. [2020-01-16 19:00:25,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:25,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:25,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:25,453 INFO L225 Difference]: With dead ends: 609 [2020-01-16 19:00:25,454 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 19:00:25,454 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:25,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 19:00:25,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 388. [2020-01-16 19:00:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:00:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1352 transitions. [2020-01-16 19:00:25,463 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1352 transitions. Word has length 22 [2020-01-16 19:00:25,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:25,465 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1352 transitions. [2020-01-16 19:00:25,465 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1352 transitions. [2020-01-16 19:00:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:25,466 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:25,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, 1, 1, 1] [2020-01-16 19:00:25,466 INFO L426 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:25,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:25,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1680014634, now seen corresponding path program 187 times [2020-01-16 19:00:25,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:25,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434655388] [2020-01-16 19:00:25,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:25,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434655388] [2020-01-16 19:00:25,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:25,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:25,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971854155] [2020-01-16 19:00:25,724 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:25,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:25,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:25,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:25,725 INFO L87 Difference]: Start difference. First operand 388 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:00:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:25,833 INFO L93 Difference]: Finished difference Result 595 states and 1784 transitions. [2020-01-16 19:00:25,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:25,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:25,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:25,835 INFO L225 Difference]: With dead ends: 595 [2020-01-16 19:00:25,835 INFO L226 Difference]: Without dead ends: 584 [2020-01-16 19:00:25,835 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:25,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-01-16 19:00:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 392. [2020-01-16 19:00:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:00:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1362 transitions. [2020-01-16 19:00:25,844 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1362 transitions. Word has length 22 [2020-01-16 19:00:25,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:25,844 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1362 transitions. [2020-01-16 19:00:25,844 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:25,844 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1362 transitions. [2020-01-16 19:00:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:25,845 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:25,845 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:25,845 INFO L426 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:25,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:25,845 INFO L82 PathProgramCache]: Analyzing trace with hash -338081846, now seen corresponding path program 188 times [2020-01-16 19:00:25,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:25,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238156956] [2020-01-16 19:00:25,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:26,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-01-16 19:00:26,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238156956] [2020-01-16 19:00:26,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:26,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:26,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990105246] [2020-01-16 19:00:26,105 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:26,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:26,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:26,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:26,105 INFO L87 Difference]: Start difference. First operand 392 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:00:26,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:26,218 INFO L93 Difference]: Finished difference Result 594 states and 1780 transitions. [2020-01-16 19:00:26,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:26,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:26,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:26,220 INFO L225 Difference]: With dead ends: 594 [2020-01-16 19:00:26,220 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 19:00:26,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:26,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 19:00:26,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 390. [2020-01-16 19:00:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:26,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1357 transitions. [2020-01-16 19:00:26,230 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1357 transitions. Word has length 22 [2020-01-16 19:00:26,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:26,230 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1357 transitions. [2020-01-16 19:00:26,230 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1357 transitions. [2020-01-16 19:00:26,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:26,231 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:26,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, 1, 1, 1] [2020-01-16 19:00:26,231 INFO L426 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:26,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:26,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1144784832, now seen corresponding path program 189 times [2020-01-16 19:00:26,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:26,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989871302] [2020-01-16 19:00:26,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:26,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989871302] [2020-01-16 19:00:26,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:26,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:26,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283373161] [2020-01-16 19:00:26,483 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:26,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:26,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:26,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:26,484 INFO L87 Difference]: Start difference. First operand 390 states and 1357 transitions. Second operand 9 states. [2020-01-16 19:00:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:26,594 INFO L93 Difference]: Finished difference Result 599 states and 1791 transitions. [2020-01-16 19:00:26,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:26,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:26,596 INFO L225 Difference]: With dead ends: 599 [2020-01-16 19:00:26,596 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 19:00:26,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:26,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 19:00:26,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 393. [2020-01-16 19:00:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:00:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1362 transitions. [2020-01-16 19:00:26,605 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1362 transitions. Word has length 22 [2020-01-16 19:00:26,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:26,605 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1362 transitions. [2020-01-16 19:00:26,605 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1362 transitions. [2020-01-16 19:00:26,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:26,606 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:26,606 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:26,606 INFO L426 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:26,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:26,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1373173840, now seen corresponding path program 190 times [2020-01-16 19:00:26,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:26,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470361947] [2020-01-16 19:00:26,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:26,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470361947] [2020-01-16 19:00:26,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:26,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:26,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932274359] [2020-01-16 19:00:26,857 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:26,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:26,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:26,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:26,857 INFO L87 Difference]: Start difference. First operand 393 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:00:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:26,964 INFO L93 Difference]: Finished difference Result 601 states and 1792 transitions. [2020-01-16 19:00:26,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:26,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:26,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:26,966 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:00:26,966 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 19:00:26,967 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:26,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 19:00:26,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 390. [2020-01-16 19:00:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1355 transitions. [2020-01-16 19:00:26,977 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1355 transitions. Word has length 22 [2020-01-16 19:00:26,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:26,977 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1355 transitions. [2020-01-16 19:00:26,977 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:26,977 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1355 transitions. [2020-01-16 19:00:26,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:26,977 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:26,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, 1, 1, 1] [2020-01-16 19:00:26,978 INFO L426 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:26,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:26,978 INFO L82 PathProgramCache]: Analyzing trace with hash -875937424, now seen corresponding path program 191 times [2020-01-16 19:00:26,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:26,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154569382] [2020-01-16 19:00:26,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:27,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:27,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154569382] [2020-01-16 19:00:27,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:27,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:27,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895462136] [2020-01-16 19:00:27,231 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:27,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:27,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:27,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:27,232 INFO L87 Difference]: Start difference. First operand 390 states and 1355 transitions. Second operand 9 states. [2020-01-16 19:00:27,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:27,330 INFO L93 Difference]: Finished difference Result 596 states and 1782 transitions. [2020-01-16 19:00:27,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:27,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:27,332 INFO L225 Difference]: With dead ends: 596 [2020-01-16 19:00:27,332 INFO L226 Difference]: Without dead ends: 586 [2020-01-16 19:00:27,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:27,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-01-16 19:00:27,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 392. [2020-01-16 19:00:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:00:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1358 transitions. [2020-01-16 19:00:27,342 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1358 transitions. Word has length 22 [2020-01-16 19:00:27,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:27,342 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1358 transitions. [2020-01-16 19:00:27,342 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:27,342 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1358 transitions. [2020-01-16 19:00:27,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:27,343 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:27,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, 1, 1, 1] [2020-01-16 19:00:27,343 INFO L426 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:27,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:27,343 INFO L82 PathProgramCache]: Analyzing trace with hash -304482618, now seen corresponding path program 192 times [2020-01-16 19:00:27,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:27,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444842382] [2020-01-16 19:00:27,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:27,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-01-16 19:00:27,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444842382] [2020-01-16 19:00:27,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:27,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:27,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147091213] [2020-01-16 19:00:27,609 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:27,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:27,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:27,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:27,609 INFO L87 Difference]: Start difference. First operand 392 states and 1358 transitions. Second operand 9 states. [2020-01-16 19:00:27,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:27,719 INFO L93 Difference]: Finished difference Result 599 states and 1786 transitions. [2020-01-16 19:00:27,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:27,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:27,721 INFO L225 Difference]: With dead ends: 599 [2020-01-16 19:00:27,721 INFO L226 Difference]: Without dead ends: 579 [2020-01-16 19:00:27,721 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:27,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-01-16 19:00:27,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 385. [2020-01-16 19:00:27,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:00:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1346 transitions. [2020-01-16 19:00:27,730 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1346 transitions. Word has length 22 [2020-01-16 19:00:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:27,730 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1346 transitions. [2020-01-16 19:00:27,730 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1346 transitions. [2020-01-16 19:00:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:27,730 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:27,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, 1, 1, 1] [2020-01-16 19:00:27,731 INFO L426 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:27,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:27,731 INFO L82 PathProgramCache]: Analyzing trace with hash -681425196, now seen corresponding path program 193 times [2020-01-16 19:00:27,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:27,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254765689] [2020-01-16 19:00:27,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:27,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254765689] [2020-01-16 19:00:27,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:27,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:28,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805041221] [2020-01-16 19:00:28,000 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:28,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:28,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:28,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:28,001 INFO L87 Difference]: Start difference. First operand 385 states and 1346 transitions. Second operand 9 states. [2020-01-16 19:00:28,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:28,080 INFO L93 Difference]: Finished difference Result 592 states and 1761 transitions. [2020-01-16 19:00:28,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:28,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:28,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:28,082 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:00:28,082 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:00:28,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:28,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:00:28,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 391. [2020-01-16 19:00:28,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:00:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-01-16 19:00:28,091 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-01-16 19:00:28,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:28,092 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-01-16 19:00:28,092 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:28,092 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-01-16 19:00:28,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:28,092 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:28,092 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:28,093 INFO L426 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:28,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:28,093 INFO L82 PathProgramCache]: Analyzing trace with hash -120356704, now seen corresponding path program 194 times [2020-01-16 19:00:28,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:28,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237169314] [2020-01-16 19:00:28,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00: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-01-16 19:00:28,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237169314] [2020-01-16 19:00:28,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:28,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:28,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392052668] [2020-01-16 19:00:28,360 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:28,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:28,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:28,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:28,361 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:00:28,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:28,440 INFO L93 Difference]: Finished difference Result 585 states and 1746 transitions. [2020-01-16 19:00:28,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:28,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:28,442 INFO L225 Difference]: With dead ends: 585 [2020-01-16 19:00:28,442 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:00:28,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:00:28,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 389. [2020-01-16 19:00:28,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:28,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1358 transitions. [2020-01-16 19:00:28,451 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1358 transitions. Word has length 22 [2020-01-16 19:00:28,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:28,451 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1358 transitions. [2020-01-16 19:00:28,451 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:28,451 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1358 transitions. [2020-01-16 19:00:28,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:28,451 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:28,451 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:28,452 INFO L426 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:28,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:28,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2013104246, now seen corresponding path program 195 times [2020-01-16 19:00:28,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:28,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868434884] [2020-01-16 19:00:28,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:28,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-01-16 19:00:28,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868434884] [2020-01-16 19:00:28,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:28,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:28,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666519763] [2020-01-16 19:00:28,719 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:28,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:28,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:28,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:28,720 INFO L87 Difference]: Start difference. First operand 389 states and 1358 transitions. Second operand 9 states. [2020-01-16 19:00:28,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:28,796 INFO L93 Difference]: Finished difference Result 594 states and 1764 transitions. [2020-01-16 19:00:28,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:28,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:28,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:28,797 INFO L225 Difference]: With dead ends: 594 [2020-01-16 19:00:28,798 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:00:28,798 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:28,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:00:28,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 392. [2020-01-16 19:00:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:00:28,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1362 transitions. [2020-01-16 19:00:28,806 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1362 transitions. Word has length 22 [2020-01-16 19:00:28,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:28,807 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1362 transitions. [2020-01-16 19:00:28,807 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:28,807 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1362 transitions. [2020-01-16 19:00:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:28,807 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:28,807 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:28,807 INFO L426 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:28,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:28,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1050900584, now seen corresponding path program 196 times [2020-01-16 19:00:28,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:28,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043891740] [2020-01-16 19:00:28,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:29,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043891740] [2020-01-16 19:00:29,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:29,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:29,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495407097] [2020-01-16 19:00:29,066 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:29,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:29,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:29,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:29,067 INFO L87 Difference]: Start difference. First operand 392 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:00:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:29,177 INFO L93 Difference]: Finished difference Result 588 states and 1750 transitions. [2020-01-16 19:00:29,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:29,178 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:29,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:29,179 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:00:29,179 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:00:29,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:29,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:00:29,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 389. [2020-01-16 19:00:29,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:29,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-01-16 19:00:29,188 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-01-16 19:00:29,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:29,189 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-01-16 19:00:29,189 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:29,189 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-01-16 19:00:29,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:29,189 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:29,189 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:29,189 INFO L426 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:29,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:29,190 INFO L82 PathProgramCache]: Analyzing trace with hash 2067826472, now seen corresponding path program 197 times [2020-01-16 19:00:29,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:29,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450962342] [2020-01-16 19:00:29,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:29,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450962342] [2020-01-16 19:00:29,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:29,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:29,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676406354] [2020-01-16 19:00:29,470 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:29,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:29,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:29,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:29,470 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:00:29,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:29,554 INFO L93 Difference]: Finished difference Result 578 states and 1731 transitions. [2020-01-16 19:00:29,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:29,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:29,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:29,556 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:00:29,556 INFO L226 Difference]: Without dead ends: 569 [2020-01-16 19:00:29,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:29,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-01-16 19:00:29,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 390. [2020-01-16 19:00:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1357 transitions. [2020-01-16 19:00:29,564 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1357 transitions. Word has length 22 [2020-01-16 19:00:29,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:29,564 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1357 transitions. [2020-01-16 19:00:29,564 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:29,564 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1357 transitions. [2020-01-16 19:00:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:29,565 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:29,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, 1, 1, 1] [2020-01-16 19:00:29,565 INFO L426 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:29,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:29,565 INFO L82 PathProgramCache]: Analyzing trace with hash -616199866, now seen corresponding path program 198 times [2020-01-16 19:00:29,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:29,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250584466] [2020-01-16 19:00:29,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:29,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250584466] [2020-01-16 19:00:29,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:29,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:29,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118934843] [2020-01-16 19:00:29,844 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:29,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:29,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:29,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:29,844 INFO L87 Difference]: Start difference. First operand 390 states and 1357 transitions. Second operand 9 states. [2020-01-16 19:00:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:29,943 INFO L93 Difference]: Finished difference Result 579 states and 1732 transitions. [2020-01-16 19:00:29,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:29,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:29,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:29,945 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:00:29,945 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:00:29,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:29,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:00:29,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 387. [2020-01-16 19:00:29,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:00:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1352 transitions. [2020-01-16 19:00:29,955 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1352 transitions. Word has length 22 [2020-01-16 19:00:29,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:29,955 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1352 transitions. [2020-01-16 19:00:29,955 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:29,955 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1352 transitions. [2020-01-16 19:00:29,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:29,955 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:29,956 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:29,956 INFO L426 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:29,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:29,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1721660994, now seen corresponding path program 199 times [2020-01-16 19:00:29,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:29,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870377214] [2020-01-16 19:00:29,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:30,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870377214] [2020-01-16 19:00:30,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:30,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:30,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537918121] [2020-01-16 19:00:30,243 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:30,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:30,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:30,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:30,244 INFO L87 Difference]: Start difference. First operand 387 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:00:30,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:30,328 INFO L93 Difference]: Finished difference Result 598 states and 1774 transitions. [2020-01-16 19:00:30,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:30,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:30,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:30,329 INFO L225 Difference]: With dead ends: 598 [2020-01-16 19:00:30,330 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 19:00:30,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:30,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 19:00:30,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 391. [2020-01-16 19:00:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:00:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1360 transitions. [2020-01-16 19:00:30,339 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1360 transitions. Word has length 22 [2020-01-16 19:00:30,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:30,339 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1360 transitions. [2020-01-16 19:00:30,339 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:30,339 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1360 transitions. [2020-01-16 19:00:30,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:30,339 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:30,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:30,340 INFO L426 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:30,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:30,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1160592502, now seen corresponding path program 200 times [2020-01-16 19:00:30,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:30,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552013598] [2020-01-16 19:00:30,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:30,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552013598] [2020-01-16 19:00:30,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:30,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:30,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846315022] [2020-01-16 19:00:30,624 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:30,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:30,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:30,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:30,624 INFO L87 Difference]: Start difference. First operand 391 states and 1360 transitions. Second operand 9 states. [2020-01-16 19:00:30,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:30,702 INFO L93 Difference]: Finished difference Result 591 states and 1759 transitions. [2020-01-16 19:00:30,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:30,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:30,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:30,704 INFO L225 Difference]: With dead ends: 591 [2020-01-16 19:00:30,704 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:00:30,704 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:30,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:00:30,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 389. [2020-01-16 19:00:30,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-01-16 19:00:30,714 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-01-16 19:00:30,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:30,715 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-01-16 19:00:30,715 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-01-16 19:00:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:30,715 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:30,716 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:30,716 INFO L426 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:30,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:30,716 INFO L82 PathProgramCache]: Analyzing trace with hash 385123126, now seen corresponding path program 201 times [2020-01-16 19:00:30,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:30,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805826226] [2020-01-16 19:00:30,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:30,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-01-16 19:00:30,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805826226] [2020-01-16 19:00:30,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:30,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:30,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955986821] [2020-01-16 19:00:30,991 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:30,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:30,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:30,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:30,991 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:00:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:31,071 INFO L93 Difference]: Finished difference Result 606 states and 1792 transitions. [2020-01-16 19:00:31,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:31,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:31,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:31,073 INFO L225 Difference]: With dead ends: 606 [2020-01-16 19:00:31,073 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 19:00:31,074 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:31,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 19:00:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 395. [2020-01-16 19:00:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:00:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1366 transitions. [2020-01-16 19:00:31,083 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1366 transitions. Word has length 22 [2020-01-16 19:00:31,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:31,083 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1366 transitions. [2020-01-16 19:00:31,083 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:31,083 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1366 transitions. [2020-01-16 19:00:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:31,084 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00: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, 1, 1, 1] [2020-01-16 19:00:31,084 INFO L426 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:31,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:31,084 INFO L82 PathProgramCache]: Analyzing trace with hash 577943818, now seen corresponding path program 202 times [2020-01-16 19:00:31,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:31,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398916761] [2020-01-16 19:00:31,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:31,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398916761] [2020-01-16 19:00:31,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:31,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:31,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776180443] [2020-01-16 19:00:31,356 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:31,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:31,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:31,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:31,357 INFO L87 Difference]: Start difference. First operand 395 states and 1366 transitions. Second operand 9 states. [2020-01-16 19:00:31,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:31,469 INFO L93 Difference]: Finished difference Result 603 states and 1781 transitions. [2020-01-16 19:00:31,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:31,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:31,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:31,470 INFO L225 Difference]: With dead ends: 603 [2020-01-16 19:00:31,471 INFO L226 Difference]: Without dead ends: 584 [2020-01-16 19:00:31,471 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:31,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-01-16 19:00:31,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 389. [2020-01-16 19:00:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:31,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1354 transitions. [2020-01-16 19:00:31,481 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1354 transitions. Word has length 22 [2020-01-16 19:00:31,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:31,481 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1354 transitions. [2020-01-16 19:00:31,481 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:31,482 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1354 transitions. [2020-01-16 19:00:31,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:31,482 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:31,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, 1, 1, 1] [2020-01-16 19:00:31,483 INFO L426 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:31,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:31,483 INFO L82 PathProgramCache]: Analyzing trace with hash 439845352, now seen corresponding path program 203 times [2020-01-16 19:00:31,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:31,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644714426] [2020-01-16 19:00:31,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:31,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-01-16 19:00:31,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644714426] [2020-01-16 19:00:31,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:31,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:31,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825624588] [2020-01-16 19:00:31,769 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:31,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:31,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:31,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:31,770 INFO L87 Difference]: Start difference. First operand 389 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:00:31,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:31,858 INFO L93 Difference]: Finished difference Result 587 states and 1750 transitions. [2020-01-16 19:00:31,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:31,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:31,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:31,860 INFO L225 Difference]: With dead ends: 587 [2020-01-16 19:00:31,860 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:00:31,861 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:31,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:00:31,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 390. [2020-01-16 19:00:31,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1355 transitions. [2020-01-16 19:00:31,870 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1355 transitions. Word has length 22 [2020-01-16 19:00:31,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:31,870 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1355 transitions. [2020-01-16 19:00:31,870 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1355 transitions. [2020-01-16 19:00:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:31,871 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:31,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, 1, 1, 1] [2020-01-16 19:00:31,871 INFO L426 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:31,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:31,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1708951184, now seen corresponding path program 204 times [2020-01-16 19:00:31,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:31,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056902455] [2020-01-16 19:00:31,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:32,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-01-16 19:00:32,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056902455] [2020-01-16 19:00:32,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:32,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:32,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036241608] [2020-01-16 19:00:32,141 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:32,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:32,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:32,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:32,141 INFO L87 Difference]: Start difference. First operand 390 states and 1355 transitions. Second operand 9 states. [2020-01-16 19:00:32,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:32,245 INFO L93 Difference]: Finished difference Result 591 states and 1757 transitions. [2020-01-16 19:00:32,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:32,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:32,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:32,247 INFO L225 Difference]: With dead ends: 591 [2020-01-16 19:00:32,247 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:00:32,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:32,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:00:32,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 387. [2020-01-16 19:00:32,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:00:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1350 transitions. [2020-01-16 19:00:32,259 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1350 transitions. Word has length 22 [2020-01-16 19:00:32,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:32,259 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1350 transitions. [2020-01-16 19:00:32,259 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:32,259 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1350 transitions. [2020-01-16 19:00:32,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:32,260 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:32,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, 1, 1, 1] [2020-01-16 19:00:32,260 INFO L426 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:32,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:32,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1396064770, now seen corresponding path program 205 times [2020-01-16 19:00:32,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:32,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847200897] [2020-01-16 19:00:32,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:32,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:32,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847200897] [2020-01-16 19:00:32,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:32,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:32,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500988019] [2020-01-16 19:00:32,541 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:32,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:32,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:32,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:32,541 INFO L87 Difference]: Start difference. First operand 387 states and 1350 transitions. Second operand 9 states. [2020-01-16 19:00:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:32,620 INFO L93 Difference]: Finished difference Result 604 states and 1789 transitions. [2020-01-16 19:00:32,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:32,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:32,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:32,622 INFO L225 Difference]: With dead ends: 604 [2020-01-16 19:00:32,622 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 19:00:32,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:32,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 19:00:32,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 393. [2020-01-16 19:00:32,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:00:32,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1364 transitions. [2020-01-16 19:00:32,633 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1364 transitions. Word has length 22 [2020-01-16 19:00:32,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:32,633 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1364 transitions. [2020-01-16 19:00:32,634 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:32,634 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1364 transitions. [2020-01-16 19:00:32,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:32,634 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:32,634 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:32,634 INFO L426 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:32,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:32,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1936698864, now seen corresponding path program 206 times [2020-01-16 19:00:32,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:32,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985923735] [2020-01-16 19:00:32,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:32,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:32,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985923735] [2020-01-16 19:00:32,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:32,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:32,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342119056] [2020-01-16 19:00:32,921 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:32,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:32,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:32,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:32,922 INFO L87 Difference]: Start difference. First operand 393 states and 1364 transitions. Second operand 9 states. [2020-01-16 19:00:33,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:33,013 INFO L93 Difference]: Finished difference Result 598 states and 1775 transitions. [2020-01-16 19:00:33,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:33,013 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:33,015 INFO L225 Difference]: With dead ends: 598 [2020-01-16 19:00:33,015 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 19:00:33,015 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:33,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 19:00:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 390. [2020-01-16 19:00:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1357 transitions. [2020-01-16 19:00:33,024 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1357 transitions. Word has length 22 [2020-01-16 19:00:33,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:33,025 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1357 transitions. [2020-01-16 19:00:33,025 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:33,025 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1357 transitions. [2020-01-16 19:00:33,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:33,025 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:33,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, 1, 1, 1] [2020-01-16 19:00:33,025 INFO L426 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:33,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:33,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1983810092, now seen corresponding path program 207 times [2020-01-16 19:00:33,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:33,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856937654] [2020-01-16 19:00:33,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:33,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-01-16 19:00:33,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856937654] [2020-01-16 19:00:33,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:33,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:33,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541995242] [2020-01-16 19:00:33,298 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:33,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:33,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:33,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:33,298 INFO L87 Difference]: Start difference. First operand 390 states and 1357 transitions. Second operand 9 states. [2020-01-16 19:00:33,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:33,376 INFO L93 Difference]: Finished difference Result 610 states and 1801 transitions. [2020-01-16 19:00:33,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:33,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:33,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:33,378 INFO L225 Difference]: With dead ends: 610 [2020-01-16 19:00:33,378 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:00:33,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:33,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:00:33,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 396. [2020-01-16 19:00:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:00:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1367 transitions. [2020-01-16 19:00:33,388 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1367 transitions. Word has length 22 [2020-01-16 19:00:33,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:33,388 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1367 transitions. [2020-01-16 19:00:33,388 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:33,388 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1367 transitions. [2020-01-16 19:00:33,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:33,389 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:33,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, 1, 1, 1] [2020-01-16 19:00:33,389 INFO L426 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:33,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:33,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1790989400, now seen corresponding path program 208 times [2020-01-16 19:00:33,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:33,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567934305] [2020-01-16 19:00:33,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:33,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-01-16 19:00:33,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567934305] [2020-01-16 19:00:33,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:33,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:33,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836298538] [2020-01-16 19:00:33,658 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:33,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:33,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:33,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:33,658 INFO L87 Difference]: Start difference. First operand 396 states and 1367 transitions. Second operand 9 states. [2020-01-16 19:00:33,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:33,767 INFO L93 Difference]: Finished difference Result 607 states and 1790 transitions. [2020-01-16 19:00:33,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:33,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:33,769 INFO L225 Difference]: With dead ends: 607 [2020-01-16 19:00:33,769 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 19:00:33,770 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:33,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 19:00:33,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 390. [2020-01-16 19:00:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1354 transitions. [2020-01-16 19:00:33,779 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1354 transitions. Word has length 22 [2020-01-16 19:00:33,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:33,779 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1354 transitions. [2020-01-16 19:00:33,779 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1354 transitions. [2020-01-16 19:00:33,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:33,780 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:33,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, 1, 1, 1] [2020-01-16 19:00:33,780 INFO L426 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:33,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:33,780 INFO L82 PathProgramCache]: Analyzing trace with hash 343709836, now seen corresponding path program 209 times [2020-01-16 19:00:33,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:33,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522709106] [2020-01-16 19:00:33,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:34,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522709106] [2020-01-16 19:00:34,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:34,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:34,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816351098] [2020-01-16 19:00:34,051 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:34,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:34,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:34,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:34,052 INFO L87 Difference]: Start difference. First operand 390 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:00:34,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:34,152 INFO L93 Difference]: Finished difference Result 594 states and 1765 transitions. [2020-01-16 19:00:34,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:34,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:34,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:34,154 INFO L225 Difference]: With dead ends: 594 [2020-01-16 19:00:34,154 INFO L226 Difference]: Without dead ends: 584 [2020-01-16 19:00:34,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:34,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-01-16 19:00:34,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 392. [2020-01-16 19:00:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:00:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1357 transitions. [2020-01-16 19:00:34,163 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1357 transitions. Word has length 22 [2020-01-16 19:00:34,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:34,163 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1357 transitions. [2020-01-16 19:00:34,164 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:34,164 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1357 transitions. [2020-01-16 19:00:34,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:34,164 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:34,164 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:34,164 INFO L426 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:34,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:34,165 INFO L82 PathProgramCache]: Analyzing trace with hash 915164642, now seen corresponding path program 210 times [2020-01-16 19:00:34,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:34,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530826853] [2020-01-16 19:00:34,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:34,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-01-16 19:00:34,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530826853] [2020-01-16 19:00:34,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:34,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:34,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649347231] [2020-01-16 19:00:34,430 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:34,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:34,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:34,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:34,431 INFO L87 Difference]: Start difference. First operand 392 states and 1357 transitions. Second operand 9 states. [2020-01-16 19:00:34,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:34,546 INFO L93 Difference]: Finished difference Result 597 states and 1769 transitions. [2020-01-16 19:00:34,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:34,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:34,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:34,548 INFO L225 Difference]: With dead ends: 597 [2020-01-16 19:00:34,548 INFO L226 Difference]: Without dead ends: 579 [2020-01-16 19:00:34,549 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:34,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-01-16 19:00:34,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 387. [2020-01-16 19:00:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:00:34,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1348 transitions. [2020-01-16 19:00:34,558 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1348 transitions. Word has length 22 [2020-01-16 19:00:34,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:34,558 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1348 transitions. [2020-01-16 19:00:34,558 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:34,558 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1348 transitions. [2020-01-16 19:00:34,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:34,559 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:34,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, 1, 1, 1] [2020-01-16 19:00:34,559 INFO L426 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:34,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:34,559 INFO L82 PathProgramCache]: Analyzing trace with hash 141792394, now seen corresponding path program 211 times [2020-01-16 19:00:34,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:34,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813259834] [2020-01-16 19:00:34,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:34,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813259834] [2020-01-16 19:00:34,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:34,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:34,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665171122] [2020-01-16 19:00:34,841 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:34,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:34,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:34,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:34,842 INFO L87 Difference]: Start difference. First operand 387 states and 1348 transitions. Second operand 9 states. [2020-01-16 19:00:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:34,927 INFO L93 Difference]: Finished difference Result 572 states and 1717 transitions. [2020-01-16 19:00:34,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:34,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:34,929 INFO L225 Difference]: With dead ends: 572 [2020-01-16 19:00:34,929 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:00:34,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:34,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:00:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 389. [2020-01-16 19:00:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1352 transitions. [2020-01-16 19:00:34,941 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1352 transitions. Word has length 22 [2020-01-16 19:00:34,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:34,941 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1352 transitions. [2020-01-16 19:00:34,941 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1352 transitions. [2020-01-16 19:00:34,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:34,942 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:34,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:34,943 INFO L426 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:34,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:34,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1752733352, now seen corresponding path program 212 times [2020-01-16 19:00:34,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:34,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363627608] [2020-01-16 19:00:34,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:35,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-01-16 19:00:35,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363627608] [2020-01-16 19:00:35,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:35,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:35,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105642260] [2020-01-16 19:00:35,222 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:35,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:35,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:35,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:35,223 INFO L87 Difference]: Start difference. First operand 389 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:00:35,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:35,334 INFO L93 Difference]: Finished difference Result 573 states and 1718 transitions. [2020-01-16 19:00:35,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:35,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:35,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:35,336 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:00:35,336 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:00:35,337 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:35,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:00:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 388. [2020-01-16 19:00:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:00:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1350 transitions. [2020-01-16 19:00:35,346 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1350 transitions. Word has length 22 [2020-01-16 19:00:35,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:35,346 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1350 transitions. [2020-01-16 19:00:35,347 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:35,347 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1350 transitions. [2020-01-16 19:00:35,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:35,347 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:35,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, 1, 1, 1] [2020-01-16 19:00:35,347 INFO L426 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:35,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:35,348 INFO L82 PathProgramCache]: Analyzing trace with hash -445952928, now seen corresponding path program 213 times [2020-01-16 19:00:35,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:35,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087199409] [2020-01-16 19:00:35,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:35,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-01-16 19:00:35,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087199409] [2020-01-16 19:00:35,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:35,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:35,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465272211] [2020-01-16 19:00:35,622 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:35,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:35,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:35,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:35,622 INFO L87 Difference]: Start difference. First operand 388 states and 1350 transitions. Second operand 9 states. [2020-01-16 19:00:35,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:35,700 INFO L93 Difference]: Finished difference Result 575 states and 1722 transitions. [2020-01-16 19:00:35,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:35,700 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:35,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:35,701 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:00:35,702 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:00:35,702 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:35,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:00:35,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 389. [2020-01-16 19:00:35,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:35,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1351 transitions. [2020-01-16 19:00:35,711 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1351 transitions. Word has length 22 [2020-01-16 19:00:35,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:35,711 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1351 transitions. [2020-01-16 19:00:35,711 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:35,711 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1351 transitions. [2020-01-16 19:00:35,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:35,712 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:35,712 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:35,712 INFO L426 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:35,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:35,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1700217832, now seen corresponding path program 214 times [2020-01-16 19:00:35,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:35,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310558843] [2020-01-16 19:00:35,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:35,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-01-16 19:00:35,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310558843] [2020-01-16 19:00:35,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:35,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:35,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209557086] [2020-01-16 19:00:35,992 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:35,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:35,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:35,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:35,992 INFO L87 Difference]: Start difference. First operand 389 states and 1351 transitions. Second operand 9 states. [2020-01-16 19:00:36,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:36,092 INFO L93 Difference]: Finished difference Result 579 states and 1729 transitions. [2020-01-16 19:00:36,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:36,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:36,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:36,093 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:00:36,094 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:00:36,094 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:36,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:00:36,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 388. [2020-01-16 19:00:36,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:00:36,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1349 transitions. [2020-01-16 19:00:36,102 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1349 transitions. Word has length 22 [2020-01-16 19:00:36,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:36,102 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1349 transitions. [2020-01-16 19:00:36,102 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1349 transitions. [2020-01-16 19:00:36,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:36,103 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:36,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, 1, 1, 1] [2020-01-16 19:00:36,103 INFO L426 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:36,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:36,103 INFO L82 PathProgramCache]: Analyzing trace with hash -435449824, now seen corresponding path program 215 times [2020-01-16 19:00:36,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:36,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881320114] [2020-01-16 19:00:36,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:36,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881320114] [2020-01-16 19:00:36,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:36,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:36,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732291908] [2020-01-16 19:00:36,382 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:36,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:36,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:36,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:36,383 INFO L87 Difference]: Start difference. First operand 388 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:00:36,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:36,491 INFO L93 Difference]: Finished difference Result 578 states and 1728 transitions. [2020-01-16 19:00:36,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:36,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:36,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:36,493 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:00:36,493 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:00:36,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:36,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:00:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 390. [2020-01-16 19:00:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1352 transitions. [2020-01-16 19:00:36,502 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1352 transitions. Word has length 22 [2020-01-16 19:00:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:36,502 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1352 transitions. [2020-01-16 19:00:36,503 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:36,503 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1352 transitions. [2020-01-16 19:00:36,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:36,503 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:36,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, 1, 1, 1] [2020-01-16 19:00:36,503 INFO L426 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:36,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:36,504 INFO L82 PathProgramCache]: Analyzing trace with hash 99779978, now seen corresponding path program 216 times [2020-01-16 19:00:36,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:36,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962349821] [2020-01-16 19:00:36,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:36,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-01-16 19:00:36,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962349821] [2020-01-16 19:00:36,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:36,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:36,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038863870] [2020-01-16 19:00:36,771 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:36,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:36,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:36,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:36,771 INFO L87 Difference]: Start difference. First operand 390 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:00:36,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:36,874 INFO L93 Difference]: Finished difference Result 581 states and 1732 transitions. [2020-01-16 19:00:36,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:36,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:36,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:36,876 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:00:36,876 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:00:36,876 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:00:36,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 385. [2020-01-16 19:00:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:00:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1344 transitions. [2020-01-16 19:00:36,885 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1344 transitions. Word has length 22 [2020-01-16 19:00:36,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:36,885 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1344 transitions. [2020-01-16 19:00:36,885 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1344 transitions. [2020-01-16 19:00:36,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:36,886 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:36,886 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:36,886 INFO L426 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:36,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:36,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1131381302, now seen corresponding path program 217 times [2020-01-16 19:00:36,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:36,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436892709] [2020-01-16 19:00:36,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:37,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:37,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436892709] [2020-01-16 19:00:37,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:37,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:37,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644240997] [2020-01-16 19:00:37,179 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:37,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:37,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:37,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:37,180 INFO L87 Difference]: Start difference. First operand 385 states and 1344 transitions. Second operand 9 states. [2020-01-16 19:00:37,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:37,291 INFO L93 Difference]: Finished difference Result 559 states and 1689 transitions. [2020-01-16 19:00:37,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:37,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:37,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:37,292 INFO L225 Difference]: With dead ends: 559 [2020-01-16 19:00:37,293 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:00:37,293 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:37,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:00:37,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 388. [2020-01-16 19:00:37,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:00:37,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1352 transitions. [2020-01-16 19:00:37,302 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1352 transitions. Word has length 22 [2020-01-16 19:00:37,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:37,302 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1352 transitions. [2020-01-16 19:00:37,302 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1352 transitions. [2020-01-16 19:00:37,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:37,303 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:37,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, 1, 1, 1] [2020-01-16 19:00:37,303 INFO L426 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:37,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:37,303 INFO L82 PathProgramCache]: Analyzing trace with hash -314135708, now seen corresponding path program 218 times [2020-01-16 19:00:37,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:37,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977782123] [2020-01-16 19:00:37,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00: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-01-16 19:00:37,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977782123] [2020-01-16 19:00:37,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:37,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:37,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470382731] [2020-01-16 19:00:37,594 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:37,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:37,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:37,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:37,594 INFO L87 Difference]: Start difference. First operand 388 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:00:37,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:37,678 INFO L93 Difference]: Finished difference Result 557 states and 1684 transitions. [2020-01-16 19:00:37,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:37,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:37,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:37,680 INFO L225 Difference]: With dead ends: 557 [2020-01-16 19:00:37,680 INFO L226 Difference]: Without dead ends: 547 [2020-01-16 19:00:37,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-01-16 19:00:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 387. [2020-01-16 19:00:37,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:00:37,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1350 transitions. [2020-01-16 19:00:37,690 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1350 transitions. Word has length 22 [2020-01-16 19:00:37,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:37,690 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1350 transitions. [2020-01-16 19:00:37,690 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:37,691 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1350 transitions. [2020-01-16 19:00:37,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:37,691 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:37,691 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:37,691 INFO L426 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:37,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:37,691 INFO L82 PathProgramCache]: Analyzing trace with hash -469056552, now seen corresponding path program 219 times [2020-01-16 19:00:37,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:37,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069432310] [2020-01-16 19:00:37,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:37,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:37,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069432310] [2020-01-16 19:00:37,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:37,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:37,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950663721] [2020-01-16 19:00:37,973 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:37,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:37,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:37,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:37,973 INFO L87 Difference]: Start difference. First operand 387 states and 1350 transitions. Second operand 9 states. [2020-01-16 19:00:38,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:38,081 INFO L93 Difference]: Finished difference Result 561 states and 1693 transitions. [2020-01-16 19:00:38,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:38,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:38,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:38,083 INFO L225 Difference]: With dead ends: 561 [2020-01-16 19:00:38,083 INFO L226 Difference]: Without dead ends: 550 [2020-01-16 19:00:38,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:38,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-01-16 19:00:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 389. [2020-01-16 19:00:38,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1353 transitions. [2020-01-16 19:00:38,092 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1353 transitions. Word has length 22 [2020-01-16 19:00:38,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:38,092 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1353 transitions. [2020-01-16 19:00:38,093 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1353 transitions. [2020-01-16 19:00:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:38,093 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:38,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, 1, 1, 1] [2020-01-16 19:00:38,094 INFO L426 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:38,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:38,094 INFO L82 PathProgramCache]: Analyzing trace with hash -215963800, now seen corresponding path program 220 times [2020-01-16 19:00:38,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:38,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969103374] [2020-01-16 19:00:38,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:38,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-01-16 19:00:38,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969103374] [2020-01-16 19:00:38,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:38,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:38,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777417170] [2020-01-16 19:00:38,412 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:38,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:38,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:38,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:38,413 INFO L87 Difference]: Start difference. First operand 389 states and 1353 transitions. Second operand 9 states. [2020-01-16 19:00:38,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:38,530 INFO L93 Difference]: Finished difference Result 560 states and 1689 transitions. [2020-01-16 19:00:38,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:38,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:38,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:38,532 INFO L225 Difference]: With dead ends: 560 [2020-01-16 19:00:38,532 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:00:38,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:38,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:00:38,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 387. [2020-01-16 19:00:38,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:00:38,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1349 transitions. [2020-01-16 19:00:38,542 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1349 transitions. Word has length 22 [2020-01-16 19:00:38,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:38,542 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1349 transitions. [2020-01-16 19:00:38,542 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1349 transitions. [2020-01-16 19:00:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:38,543 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:38,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, 1, 1, 1] [2020-01-16 19:00:38,543 INFO L426 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:38,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:38,543 INFO L82 PathProgramCache]: Analyzing trace with hash 779955880, now seen corresponding path program 221 times [2020-01-16 19:00:38,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:38,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008575302] [2020-01-16 19:00:38,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:38,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008575302] [2020-01-16 19:00:38,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:38,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:38,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141492241] [2020-01-16 19:00:38,832 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:38,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:38,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:38,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:38,832 INFO L87 Difference]: Start difference. First operand 387 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:00:38,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:38,919 INFO L93 Difference]: Finished difference Result 556 states and 1681 transitions. [2020-01-16 19:00:38,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:38,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:38,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:38,921 INFO L225 Difference]: With dead ends: 556 [2020-01-16 19:00:38,921 INFO L226 Difference]: Without dead ends: 547 [2020-01-16 19:00:38,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:38,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-01-16 19:00:38,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 388. [2020-01-16 19:00:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:00:38,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1350 transitions. [2020-01-16 19:00:38,932 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1350 transitions. Word has length 22 [2020-01-16 19:00:38,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:38,932 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1350 transitions. [2020-01-16 19:00:38,932 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:38,932 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1350 transitions. [2020-01-16 19:00:38,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:38,933 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:38,933 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:38,933 INFO L426 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:38,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:38,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1904070458, now seen corresponding path program 222 times [2020-01-16 19:00:38,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:38,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877728380] [2020-01-16 19:00:38,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:39,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-01-16 19:00:39,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877728380] [2020-01-16 19:00:39,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:39,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:39,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479605424] [2020-01-16 19:00:39,233 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:39,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:39,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:39,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:39,234 INFO L87 Difference]: Start difference. First operand 388 states and 1350 transitions. Second operand 9 states. [2020-01-16 19:00:39,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:39,354 INFO L93 Difference]: Finished difference Result 557 states and 1682 transitions. [2020-01-16 19:00:39,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:39,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:39,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:39,356 INFO L225 Difference]: With dead ends: 557 [2020-01-16 19:00:39,356 INFO L226 Difference]: Without dead ends: 545 [2020-01-16 19:00:39,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:39,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-01-16 19:00:39,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 386. [2020-01-16 19:00:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:00:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1347 transitions. [2020-01-16 19:00:39,366 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1347 transitions. Word has length 22 [2020-01-16 19:00:39,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:39,366 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1347 transitions. [2020-01-16 19:00:39,366 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:39,366 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1347 transitions. [2020-01-16 19:00:39,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:39,367 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:39,367 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:39,367 INFO L426 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:39,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:39,367 INFO L82 PathProgramCache]: Analyzing trace with hash 91145504, now seen corresponding path program 223 times [2020-01-16 19:00:39,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:39,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927443026] [2020-01-16 19:00:39,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:39,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-01-16 19:00:39,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927443026] [2020-01-16 19:00:39,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:39,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:39,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199611014] [2020-01-16 19:00:39,643 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:39,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:39,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:39,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:39,644 INFO L87 Difference]: Start difference. First operand 386 states and 1347 transitions. Second operand 9 states. [2020-01-16 19:00:39,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:39,757 INFO L93 Difference]: Finished difference Result 563 states and 1697 transitions. [2020-01-16 19:00:39,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:39,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:39,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:39,759 INFO L225 Difference]: With dead ends: 563 [2020-01-16 19:00:39,759 INFO L226 Difference]: Without dead ends: 552 [2020-01-16 19:00:39,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:39,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-01-16 19:00:39,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 388. [2020-01-16 19:00:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:00:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1351 transitions. [2020-01-16 19:00:39,769 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1351 transitions. Word has length 22 [2020-01-16 19:00:39,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:39,770 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1351 transitions. [2020-01-16 19:00:39,770 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:39,770 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1351 transitions. [2020-01-16 19:00:39,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:39,771 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:39,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, 1, 1, 1] [2020-01-16 19:00:39,771 INFO L426 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:39,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:39,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1354371506, now seen corresponding path program 224 times [2020-01-16 19:00:39,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:39,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460346365] [2020-01-16 19:00:39,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:40,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:40,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460346365] [2020-01-16 19:00:40,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:40,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:40,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66688122] [2020-01-16 19:00:40,055 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:40,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:40,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:40,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:40,055 INFO L87 Difference]: Start difference. First operand 388 states and 1351 transitions. Second operand 9 states. [2020-01-16 19:00:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:40,147 INFO L93 Difference]: Finished difference Result 561 states and 1692 transitions. [2020-01-16 19:00:40,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:40,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:40,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:40,149 INFO L225 Difference]: With dead ends: 561 [2020-01-16 19:00:40,149 INFO L226 Difference]: Without dead ends: 551 [2020-01-16 19:00:40,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-01-16 19:00:40,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 387. [2020-01-16 19:00:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:00:40,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1349 transitions. [2020-01-16 19:00:40,158 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1349 transitions. Word has length 22 [2020-01-16 19:00:40,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:40,159 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1349 transitions. [2020-01-16 19:00:40,159 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:40,159 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1349 transitions. [2020-01-16 19:00:40,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:40,159 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:40,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, 1, 1, 1] [2020-01-16 19:00:40,159 INFO L426 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:40,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:40,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2097037672, now seen corresponding path program 225 times [2020-01-16 19:00:40,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:40,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834865613] [2020-01-16 19:00:40,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:40,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834865613] [2020-01-16 19:00:40,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:40,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:40,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558608845] [2020-01-16 19:00:40,421 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:40,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:40,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:40,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:40,422 INFO L87 Difference]: Start difference. First operand 387 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:00:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:40,535 INFO L93 Difference]: Finished difference Result 569 states and 1710 transitions. [2020-01-16 19:00:40,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:40,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:40,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:40,536 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:00:40,537 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:00:40,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:00:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 390. [2020-01-16 19:00:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:40,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1354 transitions. [2020-01-16 19:00:40,550 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1354 transitions. Word has length 22 [2020-01-16 19:00:40,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:40,550 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1354 transitions. [2020-01-16 19:00:40,550 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:40,550 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1354 transitions. [2020-01-16 19:00:40,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:40,551 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:40,551 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:40,551 INFO L426 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:40,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:40,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1415930382, now seen corresponding path program 226 times [2020-01-16 19:00:40,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:40,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600415611] [2020-01-16 19:00:40,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:40,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600415611] [2020-01-16 19:00:40,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:40,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:40,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871650562] [2020-01-16 19:00:40,841 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:40,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:40,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:40,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:40,842 INFO L87 Difference]: Start difference. First operand 390 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:00:40,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:40,965 INFO L93 Difference]: Finished difference Result 571 states and 1711 transitions. [2020-01-16 19:00:40,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:40,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:40,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:40,967 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:00:40,967 INFO L226 Difference]: Without dead ends: 555 [2020-01-16 19:00:40,967 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:40,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-01-16 19:00:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 387. [2020-01-16 19:00:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:00:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1348 transitions. [2020-01-16 19:00:40,977 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1348 transitions. Word has length 22 [2020-01-16 19:00:40,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:40,977 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1348 transitions. [2020-01-16 19:00:40,977 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:40,977 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1348 transitions. [2020-01-16 19:00:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:40,978 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:40,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, 1, 1, 1] [2020-01-16 19:00:40,978 INFO L426 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:40,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:40,978 INFO L82 PathProgramCache]: Analyzing trace with hash -848025240, now seen corresponding path program 227 times [2020-01-16 19:00:40,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:40,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873157520] [2020-01-16 19:00:40,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:41,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-01-16 19:00:41,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873157520] [2020-01-16 19:00:41,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:41,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:41,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803248998] [2020-01-16 19:00:41,250 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:41,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:41,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:41,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:41,251 INFO L87 Difference]: Start difference. First operand 387 states and 1348 transitions. Second operand 9 states. [2020-01-16 19:00:41,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:41,340 INFO L93 Difference]: Finished difference Result 563 states and 1695 transitions. [2020-01-16 19:00:41,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:41,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:41,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:41,341 INFO L225 Difference]: With dead ends: 563 [2020-01-16 19:00:41,342 INFO L226 Difference]: Without dead ends: 554 [2020-01-16 19:00:41,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:41,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-01-16 19:00:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 388. [2020-01-16 19:00:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:00:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1349 transitions. [2020-01-16 19:00:41,350 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1349 transitions. Word has length 22 [2020-01-16 19:00:41,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:41,350 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1349 transitions. [2020-01-16 19:00:41,350 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:41,350 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1349 transitions. [2020-01-16 19:00:41,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:41,351 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:41,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, 1, 1, 1] [2020-01-16 19:00:41,351 INFO L426 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:41,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:41,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1298145520, now seen corresponding path program 228 times [2020-01-16 19:00:41,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:41,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837299865] [2020-01-16 19:00:41,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:41,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-01-16 19:00:41,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837299865] [2020-01-16 19:00:41,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:41,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:41,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794887168] [2020-01-16 19:00:41,612 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:41,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:41,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:41,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:41,612 INFO L87 Difference]: Start difference. First operand 388 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:00:41,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:41,713 INFO L93 Difference]: Finished difference Result 567 states and 1702 transitions. [2020-01-16 19:00:41,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:41,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:41,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:41,715 INFO L225 Difference]: With dead ends: 567 [2020-01-16 19:00:41,715 INFO L226 Difference]: Without dead ends: 552 [2020-01-16 19:00:41,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:41,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-01-16 19:00:41,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 386. [2020-01-16 19:00:41,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:00:41,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1346 transitions. [2020-01-16 19:00:41,724 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1346 transitions. Word has length 22 [2020-01-16 19:00:41,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:41,724 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1346 transitions. [2020-01-16 19:00:41,725 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:41,725 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1346 transitions. [2020-01-16 19:00:41,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:41,725 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:41,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, 1, 1, 1] [2020-01-16 19:00:41,725 INFO L426 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:41,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:41,725 INFO L82 PathProgramCache]: Analyzing trace with hash 416741728, now seen corresponding path program 229 times [2020-01-16 19:00:41,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:41,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465949397] [2020-01-16 19:00:41,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:42,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465949397] [2020-01-16 19:00:42,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:42,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:42,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722924931] [2020-01-16 19:00:42,001 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:42,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:42,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:42,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:42,001 INFO L87 Difference]: Start difference. First operand 386 states and 1346 transitions. Second operand 9 states. [2020-01-16 19:00:42,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:42,115 INFO L93 Difference]: Finished difference Result 569 states and 1713 transitions. [2020-01-16 19:00:42,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:42,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:42,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:42,116 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:00:42,117 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:00:42,117 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:42,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:00:42,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 390. [2020-01-16 19:00:42,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1356 transitions. [2020-01-16 19:00:42,126 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1356 transitions. Word has length 22 [2020-01-16 19:00:42,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:42,126 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1356 transitions. [2020-01-16 19:00:42,126 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:42,126 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1356 transitions. [2020-01-16 19:00:42,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:42,127 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:42,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, 1, 1, 1] [2020-01-16 19:00:42,127 INFO L426 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:42,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:42,127 INFO L82 PathProgramCache]: Analyzing trace with hash 669834480, now seen corresponding path program 230 times [2020-01-16 19:00:42,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:42,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800038399] [2020-01-16 19:00:42,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:42,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-01-16 19:00:42,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800038399] [2020-01-16 19:00:42,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:42,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:42,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319935561] [2020-01-16 19:00:42,407 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:42,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:42,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:42,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:42,407 INFO L87 Difference]: Start difference. First operand 390 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:00:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:42,520 INFO L93 Difference]: Finished difference Result 568 states and 1709 transitions. [2020-01-16 19:00:42,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:42,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:42,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:42,522 INFO L225 Difference]: With dead ends: 568 [2020-01-16 19:00:42,522 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:00:42,522 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:42,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:00:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 388. [2020-01-16 19:00:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:00:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1351 transitions. [2020-01-16 19:00:42,532 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1351 transitions. Word has length 22 [2020-01-16 19:00:42,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:42,532 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1351 transitions. [2020-01-16 19:00:42,532 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1351 transitions. [2020-01-16 19:00:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:42,533 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:42,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, 1, 1, 1] [2020-01-16 19:00:42,533 INFO L426 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:42,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:42,533 INFO L82 PathProgramCache]: Analyzing trace with hash -171003594, now seen corresponding path program 231 times [2020-01-16 19:00:42,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:42,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20678895] [2020-01-16 19:00:42,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:42,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20678895] [2020-01-16 19:00:42,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:42,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:42,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213979366] [2020-01-16 19:00:42,795 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:42,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:42,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:42,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:42,795 INFO L87 Difference]: Start difference. First operand 388 states and 1351 transitions. Second operand 9 states. [2020-01-16 19:00:42,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:42,897 INFO L93 Difference]: Finished difference Result 573 states and 1720 transitions. [2020-01-16 19:00:42,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:42,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:42,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:42,899 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:00:42,899 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:00:42,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:42,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:00:42,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 391. [2020-01-16 19:00:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:00:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1356 transitions. [2020-01-16 19:00:42,911 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1356 transitions. Word has length 22 [2020-01-16 19:00:42,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:42,911 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1356 transitions. [2020-01-16 19:00:42,911 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:42,911 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1356 transitions. [2020-01-16 19:00:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:42,912 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:42,912 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:42,912 INFO L426 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:42,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:42,912 INFO L82 PathProgramCache]: Analyzing trace with hash -953002836, now seen corresponding path program 232 times [2020-01-16 19:00:42,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:42,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220048386] [2020-01-16 19:00:42,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:43,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:43,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220048386] [2020-01-16 19:00:43,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:43,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:43,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301802956] [2020-01-16 19:00:43,182 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:43,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:43,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:43,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:43,182 INFO L87 Difference]: Start difference. First operand 391 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:00:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:43,292 INFO L93 Difference]: Finished difference Result 575 states and 1721 transitions. [2020-01-16 19:00:43,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:43,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:43,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:43,294 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:00:43,294 INFO L226 Difference]: Without dead ends: 559 [2020-01-16 19:00:43,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-01-16 19:00:43,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 388. [2020-01-16 19:00:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:00:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1349 transitions. [2020-01-16 19:00:43,304 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1349 transitions. Word has length 22 [2020-01-16 19:00:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:43,304 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1349 transitions. [2020-01-16 19:00:43,304 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1349 transitions. [2020-01-16 19:00:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:43,305 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:43,305 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:43,305 INFO L426 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:43,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:43,305 INFO L82 PathProgramCache]: Analyzing trace with hash 149930832, now seen corresponding path program 233 times [2020-01-16 19:00:43,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:43,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921270541] [2020-01-16 19:00:43,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:43,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-01-16 19:00:43,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921270541] [2020-01-16 19:00:43,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:43,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:43,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462211225] [2020-01-16 19:00:43,571 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:43,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:43,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:43,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:43,572 INFO L87 Difference]: Start difference. First operand 388 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:00:43,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:43,697 INFO L93 Difference]: Finished difference Result 570 states and 1711 transitions. [2020-01-16 19:00:43,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:43,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:43,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:43,699 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:00:43,699 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:00:43,699 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:43,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:00:43,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 390. [2020-01-16 19:00:43,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1352 transitions. [2020-01-16 19:00:43,709 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1352 transitions. Word has length 22 [2020-01-16 19:00:43,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:43,709 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1352 transitions. [2020-01-16 19:00:43,709 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:43,709 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1352 transitions. [2020-01-16 19:00:43,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:43,710 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:43,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, 1, 1, 1] [2020-01-16 19:00:43,710 INFO L426 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:43,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:43,711 INFO L82 PathProgramCache]: Analyzing trace with hash 721385638, now seen corresponding path program 234 times [2020-01-16 19:00:43,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:43,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480493815] [2020-01-16 19:00:43,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:43,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-01-16 19:00:43,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480493815] [2020-01-16 19:00:43,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:43,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:43,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845295879] [2020-01-16 19:00:43,960 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:43,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:43,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:43,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:43,961 INFO L87 Difference]: Start difference. First operand 390 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:00:44,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:44,061 INFO L93 Difference]: Finished difference Result 573 states and 1715 transitions. [2020-01-16 19:00:44,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:44,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:44,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:44,062 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:00:44,063 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:00:44,063 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:00:44,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 386. [2020-01-16 19:00:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:00:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1345 transitions. [2020-01-16 19:00:44,072 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1345 transitions. Word has length 22 [2020-01-16 19:00:44,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:44,072 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1345 transitions. [2020-01-16 19:00:44,072 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:44,072 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1345 transitions. [2020-01-16 19:00:44,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:44,073 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:44,073 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:44,073 INFO L426 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:44,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:44,073 INFO L82 PathProgramCache]: Analyzing trace with hash -703179058, now seen corresponding path program 235 times [2020-01-16 19:00:44,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:44,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637478852] [2020-01-16 19:00:44,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:44,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637478852] [2020-01-16 19:00:44,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:44,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:44,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606665260] [2020-01-16 19:00:44,356 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:44,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:44,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:44,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:44,357 INFO L87 Difference]: Start difference. First operand 386 states and 1345 transitions. Second operand 9 states. [2020-01-16 19:00:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:44,447 INFO L93 Difference]: Finished difference Result 558 states and 1684 transitions. [2020-01-16 19:00:44,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:44,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:44,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:44,449 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:00:44,449 INFO L226 Difference]: Without dead ends: 549 [2020-01-16 19:00:44,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:44,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-01-16 19:00:44,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 388. [2020-01-16 19:00:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:00:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1349 transitions. [2020-01-16 19:00:44,458 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1349 transitions. Word has length 22 [2020-01-16 19:00:44,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:44,459 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1349 transitions. [2020-01-16 19:00:44,459 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:44,459 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1349 transitions. [2020-01-16 19:00:44,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:44,459 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:44,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, 1, 1, 1] [2020-01-16 19:00:44,459 INFO L426 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:44,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:44,460 INFO L82 PathProgramCache]: Analyzing trace with hash 907761900, now seen corresponding path program 236 times [2020-01-16 19:00:44,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:44,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608926447] [2020-01-16 19:00:44,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:44,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608926447] [2020-01-16 19:00:44,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:44,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:44,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596820799] [2020-01-16 19:00:44,741 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:44,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:44,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:44,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:44,742 INFO L87 Difference]: Start difference. First operand 388 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:00:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:44,847 INFO L93 Difference]: Finished difference Result 559 states and 1685 transitions. [2020-01-16 19:00:44,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:44,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:44,849 INFO L225 Difference]: With dead ends: 559 [2020-01-16 19:00:44,849 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:00:44,849 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:44,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:00:44,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 387. [2020-01-16 19:00:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:00:44,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1347 transitions. [2020-01-16 19:00:44,859 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1347 transitions. Word has length 22 [2020-01-16 19:00:44,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:44,859 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1347 transitions. [2020-01-16 19:00:44,859 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:44,859 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1347 transitions. [2020-01-16 19:00:44,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:44,860 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:44,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, 1, 1, 1] [2020-01-16 19:00:44,860 INFO L426 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:44,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:44,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1290924380, now seen corresponding path program 237 times [2020-01-16 19:00:44,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:44,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26758968] [2020-01-16 19:00:44,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:45,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26758968] [2020-01-16 19:00:45,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:45,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:45,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107487961] [2020-01-16 19:00:45,137 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:45,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:45,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:45,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:45,137 INFO L87 Difference]: Start difference. First operand 387 states and 1347 transitions. Second operand 9 states. [2020-01-16 19:00:45,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:45,223 INFO L93 Difference]: Finished difference Result 561 states and 1689 transitions. [2020-01-16 19:00:45,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:45,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:45,224 INFO L225 Difference]: With dead ends: 561 [2020-01-16 19:00:45,225 INFO L226 Difference]: Without dead ends: 552 [2020-01-16 19:00:45,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:45,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-01-16 19:00:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 388. [2020-01-16 19:00:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:00:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1348 transitions. [2020-01-16 19:00:45,234 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1348 transitions. Word has length 22 [2020-01-16 19:00:45,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:45,234 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1348 transitions. [2020-01-16 19:00:45,234 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:45,235 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1348 transitions. [2020-01-16 19:00:45,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:45,235 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:45,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, 1, 1, 1] [2020-01-16 19:00:45,235 INFO L426 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:45,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:45,235 INFO L82 PathProgramCache]: Analyzing trace with hash 855246380, now seen corresponding path program 238 times [2020-01-16 19:00:45,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:45,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54613604] [2020-01-16 19:00:45,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:45,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-01-16 19:00:45,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54613604] [2020-01-16 19:00:45,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:45,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:45,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819351680] [2020-01-16 19:00:45,510 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:45,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:45,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:45,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:45,510 INFO L87 Difference]: Start difference. First operand 388 states and 1348 transitions. Second operand 9 states. [2020-01-16 19:00:45,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:45,618 INFO L93 Difference]: Finished difference Result 565 states and 1696 transitions. [2020-01-16 19:00:45,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:45,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:45,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:45,619 INFO L225 Difference]: With dead ends: 565 [2020-01-16 19:00:45,619 INFO L226 Difference]: Without dead ends: 551 [2020-01-16 19:00:45,620 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-01-16 19:00:45,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 387. [2020-01-16 19:00:45,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:00:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1346 transitions. [2020-01-16 19:00:45,629 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1346 transitions. Word has length 22 [2020-01-16 19:00:45,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:45,629 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1346 transitions. [2020-01-16 19:00:45,629 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:45,629 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1346 transitions. [2020-01-16 19:00:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:45,630 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:45,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, 1, 1, 1] [2020-01-16 19:00:45,630 INFO L426 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:45,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:45,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1280421276, now seen corresponding path program 239 times [2020-01-16 19:00:45,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:45,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941661149] [2020-01-16 19:00:45,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:45,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-01-16 19:00:45,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941661149] [2020-01-16 19:00:45,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:45,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:45,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002558859] [2020-01-16 19:00:45,903 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:45,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:45,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:45,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:45,904 INFO L87 Difference]: Start difference. First operand 387 states and 1346 transitions. Second operand 9 states. [2020-01-16 19:00:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:46,026 INFO L93 Difference]: Finished difference Result 564 states and 1695 transitions. [2020-01-16 19:00:46,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:46,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:46,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:46,028 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:00:46,028 INFO L226 Difference]: Without dead ends: 554 [2020-01-16 19:00:46,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-01-16 19:00:46,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 389. [2020-01-16 19:00:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1349 transitions. [2020-01-16 19:00:46,038 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1349 transitions. Word has length 22 [2020-01-16 19:00:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:46,038 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1349 transitions. [2020-01-16 19:00:46,038 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1349 transitions. [2020-01-16 19:00:46,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:46,038 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:46,039 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:46,039 INFO L426 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:46,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:46,039 INFO L82 PathProgramCache]: Analyzing trace with hash -745191474, now seen corresponding path program 240 times [2020-01-16 19:00:46,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:46,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217098762] [2020-01-16 19:00:46,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00: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-01-16 19:00:46,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217098762] [2020-01-16 19:00:46,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:46,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:46,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596342640] [2020-01-16 19:00:46,309 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:46,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:46,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:46,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:46,310 INFO L87 Difference]: Start difference. First operand 389 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:00:46,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:46,428 INFO L93 Difference]: Finished difference Result 567 states and 1699 transitions. [2020-01-16 19:00:46,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:46,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:46,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:46,430 INFO L225 Difference]: With dead ends: 567 [2020-01-16 19:00:46,430 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:00:46,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:00:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 383. [2020-01-16 19:00:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:00:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1340 transitions. [2020-01-16 19:00:46,439 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1340 transitions. Word has length 22 [2020-01-16 19:00:46,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:46,439 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1340 transitions. [2020-01-16 19:00:46,439 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1340 transitions. [2020-01-16 19:00:46,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:46,440 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:46,440 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:46,440 INFO L426 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:46,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:46,440 INFO L82 PathProgramCache]: Analyzing trace with hash -39183836, now seen corresponding path program 241 times [2020-01-16 19:00:46,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:46,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114531885] [2020-01-16 19:00:46,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:46,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-01-16 19:00:46,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114531885] [2020-01-16 19:00:46,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:46,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:46,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143351095] [2020-01-16 19:00:46,714 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:46,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:46,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:46,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:46,715 INFO L87 Difference]: Start difference. First operand 383 states and 1340 transitions. Second operand 9 states. [2020-01-16 19:00:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:46,814 INFO L93 Difference]: Finished difference Result 638 states and 1890 transitions. [2020-01-16 19:00:46,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:46,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:46,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:46,815 INFO L225 Difference]: With dead ends: 638 [2020-01-16 19:00:46,816 INFO L226 Difference]: Without dead ends: 622 [2020-01-16 19:00:46,816 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:46,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-01-16 19:00:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 396. [2020-01-16 19:00:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:00:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1380 transitions. [2020-01-16 19:00:46,825 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1380 transitions. Word has length 22 [2020-01-16 19:00:46,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:46,825 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1380 transitions. [2020-01-16 19:00:46,825 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1380 transitions. [2020-01-16 19:00:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:46,826 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:46,826 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:46,826 INFO L426 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:46,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:46,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1551082050, now seen corresponding path program 242 times [2020-01-16 19:00:46,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:46,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483814355] [2020-01-16 19:00:46,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:47,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:47,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483814355] [2020-01-16 19:00:47,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:47,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:47,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372464111] [2020-01-16 19:00:47,093 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:47,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:47,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:47,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:47,094 INFO L87 Difference]: Start difference. First operand 396 states and 1380 transitions. Second operand 9 states. [2020-01-16 19:00:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:47,200 INFO L93 Difference]: Finished difference Result 633 states and 1877 transitions. [2020-01-16 19:00:47,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:47,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:47,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:47,202 INFO L225 Difference]: With dead ends: 633 [2020-01-16 19:00:47,202 INFO L226 Difference]: Without dead ends: 618 [2020-01-16 19:00:47,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:47,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-01-16 19:00:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 392. [2020-01-16 19:00:47,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:00:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1372 transitions. [2020-01-16 19:00:47,212 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1372 transitions. Word has length 22 [2020-01-16 19:00:47,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:47,213 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1372 transitions. [2020-01-16 19:00:47,213 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1372 transitions. [2020-01-16 19:00:47,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:47,213 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:47,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, 1, 1, 1] [2020-01-16 19:00:47,214 INFO L426 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:47,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:47,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1313366484, now seen corresponding path program 243 times [2020-01-16 19:00:47,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:47,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363598428] [2020-01-16 19:00:47,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:47,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-01-16 19:00:47,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363598428] [2020-01-16 19:00:47,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:47,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:47,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664613570] [2020-01-16 19:00:47,486 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:47,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:47,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:47,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:47,486 INFO L87 Difference]: Start difference. First operand 392 states and 1372 transitions. Second operand 9 states. [2020-01-16 19:00:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:47,570 INFO L93 Difference]: Finished difference Result 634 states and 1878 transitions. [2020-01-16 19:00:47,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:47,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:47,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:47,572 INFO L225 Difference]: With dead ends: 634 [2020-01-16 19:00:47,572 INFO L226 Difference]: Without dead ends: 618 [2020-01-16 19:00:47,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:47,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-01-16 19:00:47,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 394. [2020-01-16 19:00:47,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:00:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1374 transitions. [2020-01-16 19:00:47,582 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1374 transitions. Word has length 22 [2020-01-16 19:00:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:47,582 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1374 transitions. [2020-01-16 19:00:47,582 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:47,582 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1374 transitions. [2020-01-16 19:00:47,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:47,583 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:47,583 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:47,583 INFO L426 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:47,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:47,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1874434976, now seen corresponding path program 244 times [2020-01-16 19:00:47,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:47,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267102349] [2020-01-16 19:00:47,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:47,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267102349] [2020-01-16 19:00:47,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:47,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:47,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350298515] [2020-01-16 19:00:47,849 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:47,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:47,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:47,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:47,849 INFO L87 Difference]: Start difference. First operand 394 states and 1374 transitions. Second operand 9 states. [2020-01-16 19:00:47,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:47,945 INFO L93 Difference]: Finished difference Result 627 states and 1863 transitions. [2020-01-16 19:00:47,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:47,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:47,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:47,947 INFO L225 Difference]: With dead ends: 627 [2020-01-16 19:00:47,947 INFO L226 Difference]: Without dead ends: 616 [2020-01-16 19:00:47,947 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-01-16 19:00:47,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 392. [2020-01-16 19:00:47,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:00:47,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1370 transitions. [2020-01-16 19:00:47,957 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1370 transitions. Word has length 22 [2020-01-16 19:00:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:47,957 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1370 transitions. [2020-01-16 19:00:47,957 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1370 transitions. [2020-01-16 19:00:47,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:47,958 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:47,958 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:47,958 INFO L426 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:47,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:47,958 INFO L82 PathProgramCache]: Analyzing trace with hash 119076278, now seen corresponding path program 245 times [2020-01-16 19:00:47,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:47,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020670225] [2020-01-16 19:00:47,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:48,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020670225] [2020-01-16 19:00:48,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:48,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:48,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729073273] [2020-01-16 19:00:48,241 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:48,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:48,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:48,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:48,242 INFO L87 Difference]: Start difference. First operand 392 states and 1370 transitions. Second operand 9 states. [2020-01-16 19:00:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:48,352 INFO L93 Difference]: Finished difference Result 623 states and 1856 transitions. [2020-01-16 19:00:48,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:48,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:48,354 INFO L225 Difference]: With dead ends: 623 [2020-01-16 19:00:48,354 INFO L226 Difference]: Without dead ends: 612 [2020-01-16 19:00:48,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:48,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-01-16 19:00:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 393. [2020-01-16 19:00:48,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:00:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1371 transitions. [2020-01-16 19:00:48,363 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1371 transitions. Word has length 22 [2020-01-16 19:00:48,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:48,363 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1371 transitions. [2020-01-16 19:00:48,363 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1371 transitions. [2020-01-16 19:00:48,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:48,364 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:48,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:48,364 INFO L426 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:48,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:48,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1326440732, now seen corresponding path program 246 times [2020-01-16 19:00:48,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:48,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879374948] [2020-01-16 19:00:48,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:48,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:48,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879374948] [2020-01-16 19:00:48,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:48,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:48,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109425947] [2020-01-16 19:00:48,652 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:48,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:48,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:48,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:48,652 INFO L87 Difference]: Start difference. First operand 393 states and 1371 transitions. Second operand 9 states. [2020-01-16 19:00:48,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:48,733 INFO L93 Difference]: Finished difference Result 621 states and 1851 transitions. [2020-01-16 19:00:48,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:48,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:48,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:48,735 INFO L225 Difference]: With dead ends: 621 [2020-01-16 19:00:48,735 INFO L226 Difference]: Without dead ends: 609 [2020-01-16 19:00:48,735 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:48,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-01-16 19:00:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 390. [2020-01-16 19:00:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1366 transitions. [2020-01-16 19:00:48,744 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1366 transitions. Word has length 22 [2020-01-16 19:00:48,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:48,744 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1366 transitions. [2020-01-16 19:00:48,744 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:48,744 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1366 transitions. [2020-01-16 19:00:48,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:48,745 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:48,745 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:48,745 INFO L426 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:48,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:48,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1799236776, now seen corresponding path program 247 times [2020-01-16 19:00:48,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:48,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520966934] [2020-01-16 19:00:48,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:49,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-01-16 19:00:49,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520966934] [2020-01-16 19:00:49,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:49,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:49,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509468205] [2020-01-16 19:00:49,024 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:49,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:49,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:49,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:49,024 INFO L87 Difference]: Start difference. First operand 390 states and 1366 transitions. Second operand 9 states. [2020-01-16 19:00:49,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:49,111 INFO L93 Difference]: Finished difference Result 654 states and 1930 transitions. [2020-01-16 19:00:49,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:49,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:49,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:49,113 INFO L225 Difference]: With dead ends: 654 [2020-01-16 19:00:49,113 INFO L226 Difference]: Without dead ends: 638 [2020-01-16 19:00:49,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:49,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-01-16 19:00:49,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 399. [2020-01-16 19:00:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:00:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1388 transitions. [2020-01-16 19:00:49,122 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1388 transitions. Word has length 22 [2020-01-16 19:00:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:49,122 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1388 transitions. [2020-01-16 19:00:49,122 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:49,122 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1388 transitions. [2020-01-16 19:00:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:49,123 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:49,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, 1, 1, 1] [2020-01-16 19:00:49,123 INFO L426 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:49,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:49,123 INFO L82 PathProgramCache]: Analyzing trace with hash -208970890, now seen corresponding path program 248 times [2020-01-16 19:00:49,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:49,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112332442] [2020-01-16 19:00:49,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:49,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112332442] [2020-01-16 19:00:49,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:49,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:49,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320744265] [2020-01-16 19:00:49,396 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:49,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:49,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:49,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:49,397 INFO L87 Difference]: Start difference. First operand 399 states and 1388 transitions. Second operand 9 states. [2020-01-16 19:00:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:49,524 INFO L93 Difference]: Finished difference Result 649 states and 1917 transitions. [2020-01-16 19:00:49,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:49,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:49,525 INFO L225 Difference]: With dead ends: 649 [2020-01-16 19:00:49,526 INFO L226 Difference]: Without dead ends: 634 [2020-01-16 19:00:49,526 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:49,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-01-16 19:00:49,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 395. [2020-01-16 19:00:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:00:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1378 transitions. [2020-01-16 19:00:49,535 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1378 transitions. Word has length 22 [2020-01-16 19:00:49,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:49,535 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1378 transitions. [2020-01-16 19:00:49,535 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1378 transitions. [2020-01-16 19:00:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:49,536 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:49,536 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:49,536 INFO L426 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:49,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:49,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1534185912, now seen corresponding path program 249 times [2020-01-16 19:00:49,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:49,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450607330] [2020-01-16 19:00:49,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:49,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-01-16 19:00:49,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450607330] [2020-01-16 19:00:49,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:49,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:49,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830167475] [2020-01-16 19:00:49,814 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:49,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:49,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:49,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:49,815 INFO L87 Difference]: Start difference. First operand 395 states and 1378 transitions. Second operand 9 states. [2020-01-16 19:00:49,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:49,899 INFO L93 Difference]: Finished difference Result 661 states and 1942 transitions. [2020-01-16 19:00:49,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:49,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:49,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:49,901 INFO L225 Difference]: With dead ends: 661 [2020-01-16 19:00:49,901 INFO L226 Difference]: Without dead ends: 645 [2020-01-16 19:00:49,902 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:49,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-01-16 19:00:49,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 403. [2020-01-16 19:00:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-01-16 19:00:49,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1391 transitions. [2020-01-16 19:00:49,911 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1391 transitions. Word has length 22 [2020-01-16 19:00:49,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:49,911 INFO L478 AbstractCegarLoop]: Abstraction has 403 states and 1391 transitions. [2020-01-16 19:00:49,911 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:49,911 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1391 transitions. [2020-01-16 19:00:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:49,912 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:49,912 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:49,913 INFO L426 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:49,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:49,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1263209834, now seen corresponding path program 250 times [2020-01-16 19:00:49,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:49,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719443704] [2020-01-16 19:00:49,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:50,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-01-16 19:00:50,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719443704] [2020-01-16 19:00:50,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:50,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:50,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789021834] [2020-01-16 19:00:50,195 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:50,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:50,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:50,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:50,196 INFO L87 Difference]: Start difference. First operand 403 states and 1391 transitions. Second operand 9 states. [2020-01-16 19:00:50,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:50,332 INFO L93 Difference]: Finished difference Result 659 states and 1932 transitions. [2020-01-16 19:00:50,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:50,333 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:50,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:50,335 INFO L225 Difference]: With dead ends: 659 [2020-01-16 19:00:50,335 INFO L226 Difference]: Without dead ends: 637 [2020-01-16 19:00:50,335 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-01-16 19:00:50,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 395. [2020-01-16 19:00:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:00:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1373 transitions. [2020-01-16 19:00:50,347 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1373 transitions. Word has length 22 [2020-01-16 19:00:50,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:50,347 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1373 transitions. [2020-01-16 19:00:50,347 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:50,347 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1373 transitions. [2020-01-16 19:00:50,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:50,348 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:50,348 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:50,348 INFO L426 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:50,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:50,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1545484970, now seen corresponding path program 251 times [2020-01-16 19:00:50,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:50,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248328229] [2020-01-16 19:00:50,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:50,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-01-16 19:00:50,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248328229] [2020-01-16 19:00:50,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:50,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:50,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230348709] [2020-01-16 19:00:50,622 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:50,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:50,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:50,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:50,622 INFO L87 Difference]: Start difference. First operand 395 states and 1373 transitions. Second operand 9 states. [2020-01-16 19:00:50,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:50,723 INFO L93 Difference]: Finished difference Result 646 states and 1907 transitions. [2020-01-16 19:00:50,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:50,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:50,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:50,725 INFO L225 Difference]: With dead ends: 646 [2020-01-16 19:00:50,726 INFO L226 Difference]: Without dead ends: 635 [2020-01-16 19:00:50,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:50,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-01-16 19:00:50,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 398. [2020-01-16 19:00:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 19:00:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1378 transitions. [2020-01-16 19:00:50,735 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1378 transitions. Word has length 22 [2020-01-16 19:00:50,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:50,735 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1378 transitions. [2020-01-16 19:00:50,735 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:50,735 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1378 transitions. [2020-01-16 19:00:50,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:50,736 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:50,736 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:50,736 INFO L426 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:50,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:50,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1563918996, now seen corresponding path program 252 times [2020-01-16 19:00:50,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:50,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634234862] [2020-01-16 19:00:50,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:51,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-01-16 19:00:51,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634234862] [2020-01-16 19:00:51,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:51,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:51,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865186921] [2020-01-16 19:00:51,005 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:51,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:51,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:51,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:51,005 INFO L87 Difference]: Start difference. First operand 398 states and 1378 transitions. Second operand 9 states. [2020-01-16 19:00:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:51,118 INFO L93 Difference]: Finished difference Result 649 states and 1910 transitions. [2020-01-16 19:00:51,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:51,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:51,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:51,120 INFO L225 Difference]: With dead ends: 649 [2020-01-16 19:00:51,120 INFO L226 Difference]: Without dead ends: 627 [2020-01-16 19:00:51,121 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:51,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-01-16 19:00:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 390. [2020-01-16 19:00:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1363 transitions. [2020-01-16 19:00:51,131 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1363 transitions. Word has length 22 [2020-01-16 19:00:51,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:51,131 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1363 transitions. [2020-01-16 19:00:51,131 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:51,131 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1363 transitions. [2020-01-16 19:00:51,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:51,131 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:51,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, 1, 1, 1] [2020-01-16 19:00:51,132 INFO L426 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:51,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:51,132 INFO L82 PathProgramCache]: Analyzing trace with hash -640125292, now seen corresponding path program 253 times [2020-01-16 19:00:51,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:51,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280625534] [2020-01-16 19:00:51,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:51,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:51,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280625534] [2020-01-16 19:00:51,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:51,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:51,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609026966] [2020-01-16 19:00:51,395 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:51,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:51,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:51,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:51,396 INFO L87 Difference]: Start difference. First operand 390 states and 1363 transitions. Second operand 9 states. [2020-01-16 19:00:51,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:51,482 INFO L93 Difference]: Finished difference Result 642 states and 1893 transitions. [2020-01-16 19:00:51,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:51,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:51,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:51,484 INFO L225 Difference]: With dead ends: 642 [2020-01-16 19:00:51,484 INFO L226 Difference]: Without dead ends: 626 [2020-01-16 19:00:51,485 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:51,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-01-16 19:00:51,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 395. [2020-01-16 19:00:51,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:00:51,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1373 transitions. [2020-01-16 19:00:51,494 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1373 transitions. Word has length 22 [2020-01-16 19:00:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:51,494 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1373 transitions. [2020-01-16 19:00:51,494 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1373 transitions. [2020-01-16 19:00:51,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:51,494 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:51,494 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:51,495 INFO L426 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:51,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:51,495 INFO L82 PathProgramCache]: Analyzing trace with hash -79056800, now seen corresponding path program 254 times [2020-01-16 19:00:51,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:51,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487343375] [2020-01-16 19:00:51,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:51,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487343375] [2020-01-16 19:00:51,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:51,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:51,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551822541] [2020-01-16 19:00:51,763 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:51,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:51,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:51,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:51,763 INFO L87 Difference]: Start difference. First operand 395 states and 1373 transitions. Second operand 9 states. [2020-01-16 19:00:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:51,838 INFO L93 Difference]: Finished difference Result 635 states and 1878 transitions. [2020-01-16 19:00:51,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:51,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:51,840 INFO L225 Difference]: With dead ends: 635 [2020-01-16 19:00:51,840 INFO L226 Difference]: Without dead ends: 624 [2020-01-16 19:00:51,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-01-16 19:00:51,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 393. [2020-01-16 19:00:51,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:00:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1369 transitions. [2020-01-16 19:00:51,851 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1369 transitions. Word has length 22 [2020-01-16 19:00:51,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:51,851 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1369 transitions. [2020-01-16 19:00:51,851 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:51,851 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1369 transitions. [2020-01-16 19:00:51,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:51,852 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:51,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, 1, 1, 1] [2020-01-16 19:00:51,852 INFO L426 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:51,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:51,852 INFO L82 PathProgramCache]: Analyzing trace with hash 372567240, now seen corresponding path program 255 times [2020-01-16 19:00:51,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:51,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806908164] [2020-01-16 19:00:51,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:52,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-01-16 19:00:52,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806908164] [2020-01-16 19:00:52,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:52,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:52,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567602068] [2020-01-16 19:00:52,147 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:52,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:52,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:52,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:52,148 INFO L87 Difference]: Start difference. First operand 393 states and 1369 transitions. Second operand 9 states. [2020-01-16 19:00:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:52,244 INFO L93 Difference]: Finished difference Result 653 states and 1917 transitions. [2020-01-16 19:00:52,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:52,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:52,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:52,245 INFO L225 Difference]: With dead ends: 653 [2020-01-16 19:00:52,246 INFO L226 Difference]: Without dead ends: 637 [2020-01-16 19:00:52,246 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-01-16 19:00:52,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 401. [2020-01-16 19:00:52,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-01-16 19:00:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1382 transitions. [2020-01-16 19:00:52,255 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1382 transitions. Word has length 22 [2020-01-16 19:00:52,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:52,255 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 1382 transitions. [2020-01-16 19:00:52,255 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1382 transitions. [2020-01-16 19:00:52,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:52,256 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:52,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, 1, 1, 1] [2020-01-16 19:00:52,256 INFO L426 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:52,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:52,256 INFO L82 PathProgramCache]: Analyzing trace with hash 242596794, now seen corresponding path program 256 times [2020-01-16 19:00:52,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:52,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332994121] [2020-01-16 19:00:52,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:52,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-01-16 19:00:52,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332994121] [2020-01-16 19:00:52,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:52,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:52,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003287620] [2020-01-16 19:00:52,530 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:52,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:52,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:52,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:52,530 INFO L87 Difference]: Start difference. First operand 401 states and 1382 transitions. Second operand 9 states. [2020-01-16 19:00:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:52,632 INFO L93 Difference]: Finished difference Result 651 states and 1907 transitions. [2020-01-16 19:00:52,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:52,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:52,634 INFO L225 Difference]: With dead ends: 651 [2020-01-16 19:00:52,634 INFO L226 Difference]: Without dead ends: 629 [2020-01-16 19:00:52,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-01-16 19:00:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 393. [2020-01-16 19:00:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:00:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1366 transitions. [2020-01-16 19:00:52,644 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1366 transitions. Word has length 22 [2020-01-16 19:00:52,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:52,644 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1366 transitions. [2020-01-16 19:00:52,644 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1366 transitions. [2020-01-16 19:00:52,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:52,645 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:52,645 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:52,645 INFO L426 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:52,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:52,645 INFO L82 PathProgramCache]: Analyzing trace with hash 427289466, now seen corresponding path program 257 times [2020-01-16 19:00:52,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:52,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172045403] [2020-01-16 19:00:52,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:52,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-01-16 19:00:52,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172045403] [2020-01-16 19:00:52,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:52,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:52,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105275844] [2020-01-16 19:00:52,926 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:52,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:52,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:52,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:52,927 INFO L87 Difference]: Start difference. First operand 393 states and 1366 transitions. Second operand 9 states. [2020-01-16 19:00:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:53,011 INFO L93 Difference]: Finished difference Result 632 states and 1870 transitions. [2020-01-16 19:00:53,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:53,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:53,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:53,013 INFO L225 Difference]: With dead ends: 632 [2020-01-16 19:00:53,013 INFO L226 Difference]: Without dead ends: 623 [2020-01-16 19:00:53,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:53,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-01-16 19:00:53,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 394. [2020-01-16 19:00:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:00:53,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1367 transitions. [2020-01-16 19:00:53,022 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1367 transitions. Word has length 22 [2020-01-16 19:00:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:53,022 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1367 transitions. [2020-01-16 19:00:53,022 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:53,022 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1367 transitions. [2020-01-16 19:00:53,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:53,023 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:53,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, 1, 1, 1] [2020-01-16 19:00:53,023 INFO L426 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:53,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:53,023 INFO L82 PathProgramCache]: Analyzing trace with hash -648421690, now seen corresponding path program 258 times [2020-01-16 19:00:53,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:53,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786461313] [2020-01-16 19:00:53,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:53,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-01-16 19:00:53,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786461313] [2020-01-16 19:00:53,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:53,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:53,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029791705] [2020-01-16 19:00:53,276 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:53,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:53,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:53,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:53,277 INFO L87 Difference]: Start difference. First operand 394 states and 1367 transitions. Second operand 9 states. [2020-01-16 19:00:53,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:53,383 INFO L93 Difference]: Finished difference Result 637 states and 1879 transitions. [2020-01-16 19:00:53,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:53,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:53,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:53,385 INFO L225 Difference]: With dead ends: 637 [2020-01-16 19:00:53,385 INFO L226 Difference]: Without dead ends: 619 [2020-01-16 19:00:53,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-01-16 19:00:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 390. [2020-01-16 19:00:53,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:00:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1360 transitions. [2020-01-16 19:00:53,394 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1360 transitions. Word has length 22 [2020-01-16 19:00:53,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:53,394 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1360 transitions. [2020-01-16 19:00:53,394 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1360 transitions. [2020-01-16 19:00:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:53,395 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:53,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, 1, 1, 1] [2020-01-16 19:00:53,395 INFO L426 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:53,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:53,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2017652658, now seen corresponding path program 259 times [2020-01-16 19:00:53,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:53,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540930298] [2020-01-16 19:00:53,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:53,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540930298] [2020-01-16 19:00:53,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:53,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:53,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347105065] [2020-01-16 19:00:53,668 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:53,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:53,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:53,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:53,668 INFO L87 Difference]: Start difference. First operand 390 states and 1360 transitions. Second operand 9 states. [2020-01-16 19:00:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:53,782 INFO L93 Difference]: Finished difference Result 618 states and 1842 transitions. [2020-01-16 19:00:53,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:53,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:53,784 INFO L225 Difference]: With dead ends: 618 [2020-01-16 19:00:53,784 INFO L226 Difference]: Without dead ends: 607 [2020-01-16 19:00:53,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:53,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-01-16 19:00:53,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 392. [2020-01-16 19:00:53,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:00:53,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1364 transitions. [2020-01-16 19:00:53,795 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1364 transitions. Word has length 22 [2020-01-16 19:00:53,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:53,796 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1364 transitions. [2020-01-16 19:00:53,796 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:53,796 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1364 transitions. [2020-01-16 19:00:53,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:53,796 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:53,796 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:53,796 INFO L426 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:53,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:53,797 INFO L82 PathProgramCache]: Analyzing trace with hash 572135648, now seen corresponding path program 260 times [2020-01-16 19:00:53,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:53,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094836618] [2020-01-16 19:00:53,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:54,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-01-16 19:00:54,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094836618] [2020-01-16 19:00:54,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:54,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:54,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452651335] [2020-01-16 19:00:54,077 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:54,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:54,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:54,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:54,077 INFO L87 Difference]: Start difference. First operand 392 states and 1364 transitions. Second operand 9 states. [2020-01-16 19:00:54,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:54,164 INFO L93 Difference]: Finished difference Result 616 states and 1837 transitions. [2020-01-16 19:00:54,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:54,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:54,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:54,166 INFO L225 Difference]: With dead ends: 616 [2020-01-16 19:00:54,166 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 19:00:54,166 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:54,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 19:00:54,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 391. [2020-01-16 19:00:54,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:00:54,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-01-16 19:00:54,176 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-01-16 19:00:54,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:54,177 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-01-16 19:00:54,177 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:54,177 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-01-16 19:00:54,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:54,177 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:54,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, 1, 1, 1] [2020-01-16 19:00:54,177 INFO L426 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:54,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:54,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1264622106, now seen corresponding path program 261 times [2020-01-16 19:00:54,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:54,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770322483] [2020-01-16 19:00:54,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:54,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:54,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770322483] [2020-01-16 19:00:54,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:54,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:54,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393501636] [2020-01-16 19:00:54,451 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:54,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:54,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:54,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:54,452 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:00:54,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:54,567 INFO L93 Difference]: Finished difference Result 625 states and 1857 transitions. [2020-01-16 19:00:54,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:54,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:54,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:54,569 INFO L225 Difference]: With dead ends: 625 [2020-01-16 19:00:54,569 INFO L226 Difference]: Without dead ends: 614 [2020-01-16 19:00:54,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:54,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-01-16 19:00:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 394. [2020-01-16 19:00:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:00:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1367 transitions. [2020-01-16 19:00:54,579 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1367 transitions. Word has length 22 [2020-01-16 19:00:54,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:54,579 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1367 transitions. [2020-01-16 19:00:54,579 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1367 transitions. [2020-01-16 19:00:54,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:54,580 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:54,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, 1, 1, 1] [2020-01-16 19:00:54,580 INFO L426 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:54,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:54,580 INFO L82 PathProgramCache]: Analyzing trace with hash 121413024, now seen corresponding path program 262 times [2020-01-16 19:00:54,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:54,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837608545] [2020-01-16 19:00:54,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:54,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:54,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837608545] [2020-01-16 19:00:54,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:54,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:54,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070155321] [2020-01-16 19:00:54,844 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:54,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:54,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:54,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:54,844 INFO L87 Difference]: Start difference. First operand 394 states and 1367 transitions. Second operand 9 states. [2020-01-16 19:00:54,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:54,962 INFO L93 Difference]: Finished difference Result 628 states and 1860 transitions. [2020-01-16 19:00:54,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:54,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:54,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:54,964 INFO L225 Difference]: With dead ends: 628 [2020-01-16 19:00:54,964 INFO L226 Difference]: Without dead ends: 611 [2020-01-16 19:00:54,965 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:54,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-01-16 19:00:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 391. [2020-01-16 19:00:54,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:00:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1361 transitions. [2020-01-16 19:00:54,974 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1361 transitions. Word has length 22 [2020-01-16 19:00:54,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:54,974 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1361 transitions. [2020-01-16 19:00:54,974 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:54,974 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1361 transitions. [2020-01-16 19:00:54,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:54,974 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:54,974 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:54,975 INFO L426 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:54,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:54,975 INFO L82 PathProgramCache]: Analyzing trace with hash -15609674, now seen corresponding path program 263 times [2020-01-16 19:00:54,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:54,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485890920] [2020-01-16 19:00:54,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:55,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485890920] [2020-01-16 19:00:55,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:55,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:55,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33623195] [2020-01-16 19:00:55,237 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:55,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:55,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:55,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:55,237 INFO L87 Difference]: Start difference. First operand 391 states and 1361 transitions. Second operand 9 states. [2020-01-16 19:00:55,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:55,336 INFO L93 Difference]: Finished difference Result 619 states and 1842 transitions. [2020-01-16 19:00:55,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:55,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:55,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:55,338 INFO L225 Difference]: With dead ends: 619 [2020-01-16 19:00:55,338 INFO L226 Difference]: Without dead ends: 610 [2020-01-16 19:00:55,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:55,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-01-16 19:00:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 392. [2020-01-16 19:00:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:00:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1362 transitions. [2020-01-16 19:00:55,348 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1362 transitions. Word has length 22 [2020-01-16 19:00:55,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:55,348 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1362 transitions. [2020-01-16 19:00:55,348 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1362 transitions. [2020-01-16 19:00:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:55,349 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:55,349 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:55,349 INFO L426 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:55,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1091320830, now seen corresponding path program 264 times [2020-01-16 19:00:55,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:55,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615321264] [2020-01-16 19:00:55,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:55,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615321264] [2020-01-16 19:00:55,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:55,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:55,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747850635] [2020-01-16 19:00:55,604 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:55,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:55,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:55,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:55,604 INFO L87 Difference]: Start difference. First operand 392 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:00:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:55,715 INFO L93 Difference]: Finished difference Result 624 states and 1851 transitions. [2020-01-16 19:00:55,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:55,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:55,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:55,717 INFO L225 Difference]: With dead ends: 624 [2020-01-16 19:00:55,717 INFO L226 Difference]: Without dead ends: 605 [2020-01-16 19:00:55,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:55,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-01-16 19:00:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 387. [2020-01-16 19:00:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:00:55,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1354 transitions. [2020-01-16 19:00:55,728 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1354 transitions. Word has length 22 [2020-01-16 19:00:55,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:55,728 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1354 transitions. [2020-01-16 19:00:55,728 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1354 transitions. [2020-01-16 19:00:55,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:55,728 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:55,728 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:55,729 INFO L426 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:55,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:55,729 INFO L82 PathProgramCache]: Analyzing trace with hash -463495072, now seen corresponding path program 265 times [2020-01-16 19:00:55,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:55,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624959468] [2020-01-16 19:00:55,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:55,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:55,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624959468] [2020-01-16 19:00:55,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:55,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:55,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877807025] [2020-01-16 19:00:55,982 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:55,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:55,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:55,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:55,982 INFO L87 Difference]: Start difference. First operand 387 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:00:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:56,064 INFO L93 Difference]: Finished difference Result 632 states and 1874 transitions. [2020-01-16 19:00:56,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:56,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:56,066 INFO L225 Difference]: With dead ends: 632 [2020-01-16 19:00:56,066 INFO L226 Difference]: Without dead ends: 616 [2020-01-16 19:00:56,066 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:56,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-01-16 19:00:56,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 395. [2020-01-16 19:00:56,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:00:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1374 transitions. [2020-01-16 19:00:56,076 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1374 transitions. Word has length 22 [2020-01-16 19:00:56,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:56,076 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1374 transitions. [2020-01-16 19:00:56,076 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1374 transitions. [2020-01-16 19:00:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:56,077 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:56,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, 1, 1, 1] [2020-01-16 19:00:56,077 INFO L426 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:56,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:56,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1126770814, now seen corresponding path program 266 times [2020-01-16 19:00:56,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:56,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206861773] [2020-01-16 19:00:56,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:56,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-01-16 19:00:56,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206861773] [2020-01-16 19:00:56,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:56,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:56,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635088131] [2020-01-16 19:00:56,329 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:56,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:56,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:56,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:56,329 INFO L87 Difference]: Start difference. First operand 395 states and 1374 transitions. Second operand 9 states. [2020-01-16 19:00:56,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:56,449 INFO L93 Difference]: Finished difference Result 627 states and 1861 transitions. [2020-01-16 19:00:56,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:56,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:56,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:56,451 INFO L225 Difference]: With dead ends: 627 [2020-01-16 19:00:56,452 INFO L226 Difference]: Without dead ends: 612 [2020-01-16 19:00:56,452 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:56,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-01-16 19:00:56,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 391. [2020-01-16 19:00:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:00:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1366 transitions. [2020-01-16 19:00:56,461 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1366 transitions. Word has length 22 [2020-01-16 19:00:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:56,461 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1366 transitions. [2020-01-16 19:00:56,462 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1366 transitions. [2020-01-16 19:00:56,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:56,462 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:56,462 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:56,462 INFO L426 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:56,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:56,463 INFO L82 PathProgramCache]: Analyzing trace with hash 889055248, now seen corresponding path program 267 times [2020-01-16 19:00:56,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:56,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887630589] [2020-01-16 19:00:56,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00: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-01-16 19:00:56,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887630589] [2020-01-16 19:00:56,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:56,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:56,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585770304] [2020-01-16 19:00:56,713 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:56,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:56,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:56,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:56,713 INFO L87 Difference]: Start difference. First operand 391 states and 1366 transitions. Second operand 9 states. [2020-01-16 19:00:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:56,799 INFO L93 Difference]: Finished difference Result 628 states and 1862 transitions. [2020-01-16 19:00:56,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:56,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:56,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:56,801 INFO L225 Difference]: With dead ends: 628 [2020-01-16 19:00:56,801 INFO L226 Difference]: Without dead ends: 612 [2020-01-16 19:00:56,801 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:56,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-01-16 19:00:56,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 393. [2020-01-16 19:00:56,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:00:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1368 transitions. [2020-01-16 19:00:56,813 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1368 transitions. Word has length 22 [2020-01-16 19:00:56,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:56,814 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1368 transitions. [2020-01-16 19:00:56,814 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1368 transitions. [2020-01-16 19:00:56,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:56,815 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:56,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, 1, 1, 1] [2020-01-16 19:00:56,815 INFO L426 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:56,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:56,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1450123740, now seen corresponding path program 268 times [2020-01-16 19:00:56,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:56,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783410043] [2020-01-16 19:00:56,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:57,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783410043] [2020-01-16 19:00:57,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:57,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:57,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788430289] [2020-01-16 19:00:57,074 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:57,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:57,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:57,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:57,075 INFO L87 Difference]: Start difference. First operand 393 states and 1368 transitions. Second operand 9 states. [2020-01-16 19:00:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:57,171 INFO L93 Difference]: Finished difference Result 621 states and 1847 transitions. [2020-01-16 19:00:57,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:57,172 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:57,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:57,173 INFO L225 Difference]: With dead ends: 621 [2020-01-16 19:00:57,173 INFO L226 Difference]: Without dead ends: 610 [2020-01-16 19:00:57,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:57,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-01-16 19:00:57,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 391. [2020-01-16 19:00:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:00:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1364 transitions. [2020-01-16 19:00:57,183 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1364 transitions. Word has length 22 [2020-01-16 19:00:57,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:57,183 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1364 transitions. [2020-01-16 19:00:57,184 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:57,184 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1364 transitions. [2020-01-16 19:00:57,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:57,184 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:57,184 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:57,184 INFO L426 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:57,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:57,185 INFO L82 PathProgramCache]: Analyzing trace with hash -305234958, now seen corresponding path program 269 times [2020-01-16 19:00:57,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:57,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889119686] [2020-01-16 19:00:57,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:57,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889119686] [2020-01-16 19:00:57,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:57,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:57,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221673424] [2020-01-16 19:00:57,447 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:57,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:57,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:57,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:57,447 INFO L87 Difference]: Start difference. First operand 391 states and 1364 transitions. Second operand 9 states. [2020-01-16 19:00:57,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:57,565 INFO L93 Difference]: Finished difference Result 617 states and 1840 transitions. [2020-01-16 19:00:57,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:57,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:57,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:57,567 INFO L225 Difference]: With dead ends: 617 [2020-01-16 19:00:57,568 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 19:00:57,568 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:57,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 19:00:57,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 392. [2020-01-16 19:00:57,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:00:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1365 transitions. [2020-01-16 19:00:57,577 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1365 transitions. Word has length 22 [2020-01-16 19:00:57,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:57,577 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1365 transitions. [2020-01-16 19:00:57,577 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1365 transitions. [2020-01-16 19:00:57,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:57,577 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:57,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, 1, 1, 1] [2020-01-16 19:00:57,578 INFO L426 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:57,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:57,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1750751968, now seen corresponding path program 270 times [2020-01-16 19:00:57,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:57,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452439832] [2020-01-16 19:00:57,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:57,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452439832] [2020-01-16 19:00:57,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:57,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:57,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284924164] [2020-01-16 19:00:57,838 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:57,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:57,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:57,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:57,838 INFO L87 Difference]: Start difference. First operand 392 states and 1365 transitions. Second operand 9 states. [2020-01-16 19:00:57,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:57,922 INFO L93 Difference]: Finished difference Result 615 states and 1835 transitions. [2020-01-16 19:00:57,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:57,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:57,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:57,923 INFO L225 Difference]: With dead ends: 615 [2020-01-16 19:00:57,924 INFO L226 Difference]: Without dead ends: 603 [2020-01-16 19:00:57,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-01-16 19:00:57,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 389. [2020-01-16 19:00:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:00:57,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1360 transitions. [2020-01-16 19:00:57,933 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1360 transitions. Word has length 22 [2020-01-16 19:00:57,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:57,933 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1360 transitions. [2020-01-16 19:00:57,933 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:57,933 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1360 transitions. [2020-01-16 19:00:57,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:57,934 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:57,934 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:57,934 INFO L426 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:57,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:57,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1226447832, now seen corresponding path program 271 times [2020-01-16 19:00:57,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:57,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502221162] [2020-01-16 19:00:57,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:58,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-01-16 19:00:58,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502221162] [2020-01-16 19:00:58,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:58,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:58,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285895969] [2020-01-16 19:00:58,189 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:58,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:58,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:58,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:58,189 INFO L87 Difference]: Start difference. First operand 389 states and 1360 transitions. Second operand 9 states. [2020-01-16 19:00:58,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:58,285 INFO L93 Difference]: Finished difference Result 644 states and 1906 transitions. [2020-01-16 19:00:58,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:58,286 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:58,287 INFO L225 Difference]: With dead ends: 644 [2020-01-16 19:00:58,287 INFO L226 Difference]: Without dead ends: 628 [2020-01-16 19:00:58,288 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:58,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-01-16 19:00:58,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 397. [2020-01-16 19:00:58,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:00:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1380 transitions. [2020-01-16 19:00:58,297 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1380 transitions. Word has length 22 [2020-01-16 19:00:58,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:58,297 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1380 transitions. [2020-01-16 19:00:58,297 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:58,297 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1380 transitions. [2020-01-16 19:00:58,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:58,298 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:58,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, 1, 1, 1] [2020-01-16 19:00:58,298 INFO L426 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:58,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:58,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1478253578, now seen corresponding path program 272 times [2020-01-16 19:00:58,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:58,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947160873] [2020-01-16 19:00:58,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:58,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947160873] [2020-01-16 19:00:58,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:58,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:58,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573815875] [2020-01-16 19:00:58,546 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:58,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:58,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:58,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:58,547 INFO L87 Difference]: Start difference. First operand 397 states and 1380 transitions. Second operand 9 states. [2020-01-16 19:00:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:58,656 INFO L93 Difference]: Finished difference Result 639 states and 1893 transitions. [2020-01-16 19:00:58,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:58,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:58,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:58,658 INFO L225 Difference]: With dead ends: 639 [2020-01-16 19:00:58,658 INFO L226 Difference]: Without dead ends: 624 [2020-01-16 19:00:58,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:58,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-01-16 19:00:58,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 393. [2020-01-16 19:00:58,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:00:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1370 transitions. [2020-01-16 19:00:58,667 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1370 transitions. Word has length 22 [2020-01-16 19:00:58,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:58,667 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1370 transitions. [2020-01-16 19:00:58,667 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1370 transitions. [2020-01-16 19:00:58,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:58,668 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:58,668 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:58,668 INFO L426 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:58,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:58,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1735956536, now seen corresponding path program 273 times [2020-01-16 19:00:58,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:58,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271103655] [2020-01-16 19:00:58,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:58,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271103655] [2020-01-16 19:00:58,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:58,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:58,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306845274] [2020-01-16 19:00:58,925 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:58,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:58,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:58,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:58,926 INFO L87 Difference]: Start difference. First operand 393 states and 1370 transitions. Second operand 9 states. [2020-01-16 19:00:59,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:59,005 INFO L93 Difference]: Finished difference Result 648 states and 1912 transitions. [2020-01-16 19:00:59,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:59,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:59,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:59,006 INFO L225 Difference]: With dead ends: 648 [2020-01-16 19:00:59,006 INFO L226 Difference]: Without dead ends: 632 [2020-01-16 19:00:59,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:59,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-01-16 19:00:59,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 399. [2020-01-16 19:00:59,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:00:59,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1380 transitions. [2020-01-16 19:00:59,018 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1380 transitions. Word has length 22 [2020-01-16 19:00:59,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:59,018 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1380 transitions. [2020-01-16 19:00:59,018 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1380 transitions. [2020-01-16 19:00:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:59,019 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:59,020 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:59,020 INFO L426 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:59,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:59,020 INFO L82 PathProgramCache]: Analyzing trace with hash 967910732, now seen corresponding path program 274 times [2020-01-16 19:00:59,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:59,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683564788] [2020-01-16 19:00:59,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:59,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683564788] [2020-01-16 19:00:59,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:59,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:59,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016808072] [2020-01-16 19:00:59,276 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:59,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:59,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:59,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:59,279 INFO L87 Difference]: Start difference. First operand 399 states and 1380 transitions. Second operand 9 states. [2020-01-16 19:00:59,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:59,381 INFO L93 Difference]: Finished difference Result 645 states and 1901 transitions. [2020-01-16 19:00:59,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:59,381 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:59,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:59,382 INFO L225 Difference]: With dead ends: 645 [2020-01-16 19:00:59,383 INFO L226 Difference]: Without dead ends: 626 [2020-01-16 19:00:59,383 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:59,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-01-16 19:00:59,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 393. [2020-01-16 19:00:59,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:00:59,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1366 transitions. [2020-01-16 19:00:59,392 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1366 transitions. Word has length 22 [2020-01-16 19:00:59,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:59,392 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1366 transitions. [2020-01-16 19:00:59,393 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1366 transitions. [2020-01-16 19:00:59,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:59,393 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00: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, 1, 1, 1] [2020-01-16 19:00:59,393 INFO L426 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:59,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:59,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1343714346, now seen corresponding path program 275 times [2020-01-16 19:00:59,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:59,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651385853] [2020-01-16 19:00:59,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:59,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-01-16 19:00:59,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651385853] [2020-01-16 19:00:59,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:59,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:00:59,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310237365] [2020-01-16 19:00:59,645 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:00:59,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:59,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:00:59,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:59,646 INFO L87 Difference]: Start difference. First operand 393 states and 1366 transitions. Second operand 9 states. [2020-01-16 19:00:59,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:59,758 INFO L93 Difference]: Finished difference Result 635 states and 1882 transitions. [2020-01-16 19:00:59,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:00:59,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:00:59,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:59,760 INFO L225 Difference]: With dead ends: 635 [2020-01-16 19:00:59,760 INFO L226 Difference]: Without dead ends: 624 [2020-01-16 19:00:59,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:00:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-01-16 19:00:59,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 396. [2020-01-16 19:00:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:00:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1371 transitions. [2020-01-16 19:00:59,770 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1371 transitions. Word has length 22 [2020-01-16 19:00:59,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:59,771 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1371 transitions. [2020-01-16 19:00:59,771 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:00:59,771 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1371 transitions. [2020-01-16 19:00:59,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:00:59,771 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:59,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, 1, 1, 1] [2020-01-16 19:00:59,771 INFO L426 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:00:59,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:59,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1222205616, now seen corresponding path program 276 times [2020-01-16 19:00:59,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:59,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516635454] [2020-01-16 19:00:59,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:00,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-01-16 19:01:00,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516635454] [2020-01-16 19:01:00,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:00,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:00,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042860179] [2020-01-16 19:01:00,022 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:00,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:00,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:00,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:00,022 INFO L87 Difference]: Start difference. First operand 396 states and 1371 transitions. Second operand 9 states. [2020-01-16 19:01:00,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:00,127 INFO L93 Difference]: Finished difference Result 637 states and 1883 transitions. [2020-01-16 19:01:00,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:00,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:00,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:00,129 INFO L225 Difference]: With dead ends: 637 [2020-01-16 19:01:00,129 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 19:01:00,130 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:00,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 19:01:00,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 389. [2020-01-16 19:01:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:01:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1358 transitions. [2020-01-16 19:01:00,138 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1358 transitions. Word has length 22 [2020-01-16 19:01:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:00,139 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1358 transitions. [2020-01-16 19:01:00,139 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1358 transitions. [2020-01-16 19:01:00,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:00,139 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:00,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, 1, 1, 1] [2020-01-16 19:01:00,140 INFO L426 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:00,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:00,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1942660176, now seen corresponding path program 277 times [2020-01-16 19:01:00,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:00,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708451244] [2020-01-16 19:01:00,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:00,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-01-16 19:01:00,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708451244] [2020-01-16 19:01:00,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:00,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:00,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21949981] [2020-01-16 19:01:00,401 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:00,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:00,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:00,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:00,401 INFO L87 Difference]: Start difference. First operand 389 states and 1358 transitions. Second operand 9 states. [2020-01-16 19:01:00,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:00,485 INFO L93 Difference]: Finished difference Result 632 states and 1870 transitions. [2020-01-16 19:01:00,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:00,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:00,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:00,487 INFO L225 Difference]: With dead ends: 632 [2020-01-16 19:01:00,487 INFO L226 Difference]: Without dead ends: 616 [2020-01-16 19:01:00,487 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:00,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-01-16 19:01:00,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 393. [2020-01-16 19:01:00,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:01:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1366 transitions. [2020-01-16 19:01:00,497 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1366 transitions. Word has length 22 [2020-01-16 19:01:00,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:00,497 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1366 transitions. [2020-01-16 19:01:00,497 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:00,497 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1366 transitions. [2020-01-16 19:01:00,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:00,498 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:00,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:00,498 INFO L426 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:00,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:00,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1791238628, now seen corresponding path program 278 times [2020-01-16 19:01:00,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:00,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783397448] [2020-01-16 19:01:00,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:00,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783397448] [2020-01-16 19:01:00,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:00,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:00,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131740319] [2020-01-16 19:01:00,743 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:00,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:00,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:00,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:00,744 INFO L87 Difference]: Start difference. First operand 393 states and 1366 transitions. Second operand 9 states. [2020-01-16 19:01:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:00,829 INFO L93 Difference]: Finished difference Result 625 states and 1855 transitions. [2020-01-16 19:01:00,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:00,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:00,831 INFO L225 Difference]: With dead ends: 625 [2020-01-16 19:01:00,831 INFO L226 Difference]: Without dead ends: 614 [2020-01-16 19:01:00,831 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:00,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-01-16 19:01:00,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 391. [2020-01-16 19:01:00,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:01:00,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-01-16 19:01:00,841 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-01-16 19:01:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:00,841 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-01-16 19:01:00,841 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-01-16 19:01:00,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:00,842 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:00,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, 1, 1, 1] [2020-01-16 19:01:00,842 INFO L426 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:00,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:00,842 INFO L82 PathProgramCache]: Analyzing trace with hash -245523000, now seen corresponding path program 279 times [2020-01-16 19:01:00,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:00,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234858077] [2020-01-16 19:01:00,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:01,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234858077] [2020-01-16 19:01:01,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:01,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:01,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295786143] [2020-01-16 19:01:01,102 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:01,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:01,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:01,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:01,102 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:01:01,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:01,178 INFO L93 Difference]: Finished difference Result 640 states and 1888 transitions. [2020-01-16 19:01:01,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:01,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:01,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:01,180 INFO L225 Difference]: With dead ends: 640 [2020-01-16 19:01:01,180 INFO L226 Difference]: Without dead ends: 624 [2020-01-16 19:01:01,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-01-16 19:01:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 397. [2020-01-16 19:01:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:01:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1372 transitions. [2020-01-16 19:01:01,190 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1372 transitions. Word has length 22 [2020-01-16 19:01:01,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:01,190 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1372 transitions. [2020-01-16 19:01:01,190 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1372 transitions. [2020-01-16 19:01:01,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:01,191 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:01,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, 1, 1, 1] [2020-01-16 19:01:01,191 INFO L426 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:01,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:01,191 INFO L82 PathProgramCache]: Analyzing trace with hash -52702308, now seen corresponding path program 280 times [2020-01-16 19:01:01,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:01,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462011101] [2020-01-16 19:01:01,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:01,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-01-16 19:01:01,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462011101] [2020-01-16 19:01:01,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:01,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:01,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236428134] [2020-01-16 19:01:01,452 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:01,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:01,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:01,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:01,452 INFO L87 Difference]: Start difference. First operand 397 states and 1372 transitions. Second operand 9 states. [2020-01-16 19:01:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:01,577 INFO L93 Difference]: Finished difference Result 637 states and 1877 transitions. [2020-01-16 19:01:01,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:01,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:01,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:01,579 INFO L225 Difference]: With dead ends: 637 [2020-01-16 19:01:01,580 INFO L226 Difference]: Without dead ends: 618 [2020-01-16 19:01:01,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:01,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-01-16 19:01:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 391. [2020-01-16 19:01:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:01:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1360 transitions. [2020-01-16 19:01:01,599 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1360 transitions. Word has length 22 [2020-01-16 19:01:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:01,599 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1360 transitions. [2020-01-16 19:01:01,599 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1360 transitions. [2020-01-16 19:01:01,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:01,601 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:01,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, 1, 1, 1] [2020-01-16 19:01:01,601 INFO L426 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:01,602 INFO L82 PathProgramCache]: Analyzing trace with hash -190800774, now seen corresponding path program 281 times [2020-01-16 19:01:01,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:01,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932357737] [2020-01-16 19:01:01,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:01,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932357737] [2020-01-16 19:01:01,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:01,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:01,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307811193] [2020-01-16 19:01:01,928 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:01,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:01,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:01,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:01,929 INFO L87 Difference]: Start difference. First operand 391 states and 1360 transitions. Second operand 9 states. [2020-01-16 19:01:02,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:02,023 INFO L93 Difference]: Finished difference Result 621 states and 1846 transitions. [2020-01-16 19:01:02,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:02,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:02,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:02,025 INFO L225 Difference]: With dead ends: 621 [2020-01-16 19:01:02,025 INFO L226 Difference]: Without dead ends: 612 [2020-01-16 19:01:02,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:02,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-01-16 19:01:02,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 392. [2020-01-16 19:01:02,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:01:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1361 transitions. [2020-01-16 19:01:02,035 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1361 transitions. Word has length 22 [2020-01-16 19:01:02,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:02,036 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1361 transitions. [2020-01-16 19:01:02,036 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1361 transitions. [2020-01-16 19:01:02,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:02,037 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:02,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, 1, 1, 1] [2020-01-16 19:01:02,037 INFO L426 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:02,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:02,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1955369986, now seen corresponding path program 282 times [2020-01-16 19:01:02,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:02,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599549785] [2020-01-16 19:01:02,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:02,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-01-16 19:01:02,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599549785] [2020-01-16 19:01:02,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:02,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:02,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930701334] [2020-01-16 19:01:02,287 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:02,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:02,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:02,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:02,287 INFO L87 Difference]: Start difference. First operand 392 states and 1361 transitions. Second operand 9 states. [2020-01-16 19:01:02,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:02,406 INFO L93 Difference]: Finished difference Result 625 states and 1853 transitions. [2020-01-16 19:01:02,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:02,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:02,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:02,407 INFO L225 Difference]: With dead ends: 625 [2020-01-16 19:01:02,408 INFO L226 Difference]: Without dead ends: 609 [2020-01-16 19:01:02,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:02,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-01-16 19:01:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 389. [2020-01-16 19:01:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:01:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1356 transitions. [2020-01-16 19:01:02,416 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1356 transitions. Word has length 22 [2020-01-16 19:01:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:02,416 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1356 transitions. [2020-01-16 19:01:02,416 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1356 transitions. [2020-01-16 19:01:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:02,417 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:02,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, 1, 1, 1] [2020-01-16 19:01:02,417 INFO L426 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:02,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:02,417 INFO L82 PathProgramCache]: Analyzing trace with hash 305470830, now seen corresponding path program 283 times [2020-01-16 19:01:02,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:02,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096316099] [2020-01-16 19:01:02,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:02,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-01-16 19:01:02,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096316099] [2020-01-16 19:01:02,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:02,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:02,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622264629] [2020-01-16 19:01:02,682 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:02,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:02,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:02,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:02,682 INFO L87 Difference]: Start difference. First operand 389 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:01:02,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:02,801 INFO L93 Difference]: Finished difference Result 611 states and 1826 transitions. [2020-01-16 19:01:02,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:02,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:02,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:02,802 INFO L225 Difference]: With dead ends: 611 [2020-01-16 19:01:02,803 INFO L226 Difference]: Without dead ends: 600 [2020-01-16 19:01:02,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:02,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-01-16 19:01:02,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 391. [2020-01-16 19:01:02,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:01:02,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1360 transitions. [2020-01-16 19:01:02,812 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1360 transitions. Word has length 22 [2020-01-16 19:01:02,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:02,812 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1360 transitions. [2020-01-16 19:01:02,812 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1360 transitions. [2020-01-16 19:01:02,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:02,813 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:02,813 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:02,813 INFO L426 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:02,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:02,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1140046180, now seen corresponding path program 284 times [2020-01-16 19:01:02,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:02,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126829788] [2020-01-16 19:01:02,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:03,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-01-16 19:01:03,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126829788] [2020-01-16 19:01:03,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:03,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:03,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760153064] [2020-01-16 19:01:03,077 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:03,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:03,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:03,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:03,078 INFO L87 Difference]: Start difference. First operand 391 states and 1360 transitions. Second operand 9 states. [2020-01-16 19:01:03,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:03,173 INFO L93 Difference]: Finished difference Result 609 states and 1821 transitions. [2020-01-16 19:01:03,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:03,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:03,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:03,175 INFO L225 Difference]: With dead ends: 609 [2020-01-16 19:01:03,175 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 19:01:03,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:03,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 19:01:03,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 390. [2020-01-16 19:01:03,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:01:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1358 transitions. [2020-01-16 19:01:03,185 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1358 transitions. Word has length 22 [2020-01-16 19:01:03,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:03,185 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1358 transitions. [2020-01-16 19:01:03,185 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:03,185 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1358 transitions. [2020-01-16 19:01:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:03,186 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:03,186 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:03,186 INFO L426 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:03,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:03,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1882712346, now seen corresponding path program 285 times [2020-01-16 19:01:03,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:03,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441608983] [2020-01-16 19:01:03,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:03,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441608983] [2020-01-16 19:01:03,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:03,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:03,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802331450] [2020-01-16 19:01:03,438 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:03,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:03,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:03,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:03,438 INFO L87 Difference]: Start difference. First operand 390 states and 1358 transitions. Second operand 9 states. [2020-01-16 19:01:03,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:03,541 INFO L93 Difference]: Finished difference Result 617 states and 1839 transitions. [2020-01-16 19:01:03,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:03,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:03,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:03,549 INFO L225 Difference]: With dead ends: 617 [2020-01-16 19:01:03,549 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 19:01:03,549 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:03,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 19:01:03,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 393. [2020-01-16 19:01:03,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:01:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1363 transitions. [2020-01-16 19:01:03,557 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1363 transitions. Word has length 22 [2020-01-16 19:01:03,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:03,557 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1363 transitions. [2020-01-16 19:01:03,557 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:03,557 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1363 transitions. [2020-01-16 19:01:03,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:03,558 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:03,558 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:03,558 INFO L426 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:03,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:03,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1630255708, now seen corresponding path program 286 times [2020-01-16 19:01:03,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:03,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845556350] [2020-01-16 19:01:03,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:03,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-01-16 19:01:03,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845556350] [2020-01-16 19:01:03,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:03,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:03,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125303784] [2020-01-16 19:01:03,814 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:03,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:03,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:03,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:03,814 INFO L87 Difference]: Start difference. First operand 393 states and 1363 transitions. Second operand 9 states. [2020-01-16 19:01:03,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:03,933 INFO L93 Difference]: Finished difference Result 619 states and 1840 transitions. [2020-01-16 19:01:03,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:03,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:03,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:03,935 INFO L225 Difference]: With dead ends: 619 [2020-01-16 19:01:03,935 INFO L226 Difference]: Without dead ends: 603 [2020-01-16 19:01:03,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:03,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-01-16 19:01:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 390. [2020-01-16 19:01:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:01:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1357 transitions. [2020-01-16 19:01:03,944 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1357 transitions. Word has length 22 [2020-01-16 19:01:03,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:03,944 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1357 transitions. [2020-01-16 19:01:03,944 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1357 transitions. [2020-01-16 19:01:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:03,945 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:03,945 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:03,945 INFO L426 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:03,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:03,945 INFO L82 PathProgramCache]: Analyzing trace with hash -633699914, now seen corresponding path program 287 times [2020-01-16 19:01:03,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:03,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327317796] [2020-01-16 19:01:03,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:04,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-01-16 19:01:04,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327317796] [2020-01-16 19:01:04,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:04,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:04,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984268281] [2020-01-16 19:01:04,206 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:04,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:04,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:04,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:04,207 INFO L87 Difference]: Start difference. First operand 390 states and 1357 transitions. Second operand 9 states. [2020-01-16 19:01:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:04,300 INFO L93 Difference]: Finished difference Result 611 states and 1824 transitions. [2020-01-16 19:01:04,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:04,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:04,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:04,302 INFO L225 Difference]: With dead ends: 611 [2020-01-16 19:01:04,302 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:01:04,302 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:04,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:01:04,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 391. [2020-01-16 19:01:04,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:01:04,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1358 transitions. [2020-01-16 19:01:04,311 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1358 transitions. Word has length 22 [2020-01-16 19:01:04,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:04,311 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1358 transitions. [2020-01-16 19:01:04,311 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1358 transitions. [2020-01-16 19:01:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:04,312 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:04,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, 1, 1, 1] [2020-01-16 19:01:04,312 INFO L426 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:04,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:04,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1512470846, now seen corresponding path program 288 times [2020-01-16 19:01:04,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:04,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618985160] [2020-01-16 19:01:04,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:04,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-01-16 19:01:04,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618985160] [2020-01-16 19:01:04,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:04,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:04,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567186556] [2020-01-16 19:01:04,563 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:04,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:04,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:04,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:04,563 INFO L87 Difference]: Start difference. First operand 391 states and 1358 transitions. Second operand 9 states. [2020-01-16 19:01:04,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:04,677 INFO L93 Difference]: Finished difference Result 615 states and 1831 transitions. [2020-01-16 19:01:04,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:04,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:04,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:04,679 INFO L225 Difference]: With dead ends: 615 [2020-01-16 19:01:04,679 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:01:04,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:01:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 387. [2020-01-16 19:01:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:01:04,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1352 transitions. [2020-01-16 19:01:04,688 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1352 transitions. Word has length 22 [2020-01-16 19:01:04,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:04,688 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1352 transitions. [2020-01-16 19:01:04,688 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:04,688 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1352 transitions. [2020-01-16 19:01:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:04,689 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:04,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, 1, 1, 1] [2020-01-16 19:01:04,689 INFO L426 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:04,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:04,690 INFO L82 PathProgramCache]: Analyzing trace with hash -950614304, now seen corresponding path program 289 times [2020-01-16 19:01:04,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:04,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324949659] [2020-01-16 19:01:04,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:04,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324949659] [2020-01-16 19:01:04,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:04,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:04,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131362100] [2020-01-16 19:01:04,971 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:04,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:04,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:04,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:04,972 INFO L87 Difference]: Start difference. First operand 387 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:01:05,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:05,067 INFO L93 Difference]: Finished difference Result 680 states and 2010 transitions. [2020-01-16 19:01:05,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:05,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:05,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:05,069 INFO L225 Difference]: With dead ends: 680 [2020-01-16 19:01:05,069 INFO L226 Difference]: Without dead ends: 664 [2020-01-16 19:01:05,069 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:05,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-01-16 19:01:05,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 402. [2020-01-16 19:01:05,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-01-16 19:01:05,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1397 transitions. [2020-01-16 19:01:05,079 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1397 transitions. Word has length 22 [2020-01-16 19:01:05,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:05,079 INFO L478 AbstractCegarLoop]: Abstraction has 402 states and 1397 transitions. [2020-01-16 19:01:05,079 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:05,079 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1397 transitions. [2020-01-16 19:01:05,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:05,080 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:05,080 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:05,080 INFO L426 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:05,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:05,080 INFO L82 PathProgramCache]: Analyzing trace with hash 639651582, now seen corresponding path program 290 times [2020-01-16 19:01:05,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:05,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410217027] [2020-01-16 19:01:05,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:05,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-01-16 19:01:05,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410217027] [2020-01-16 19:01:05,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:05,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:05,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395925760] [2020-01-16 19:01:05,355 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:05,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:05,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:05,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:05,355 INFO L87 Difference]: Start difference. First operand 402 states and 1397 transitions. Second operand 9 states. [2020-01-16 19:01:05,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:05,453 INFO L93 Difference]: Finished difference Result 675 states and 1997 transitions. [2020-01-16 19:01:05,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:05,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:05,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:05,455 INFO L225 Difference]: With dead ends: 675 [2020-01-16 19:01:05,455 INFO L226 Difference]: Without dead ends: 660 [2020-01-16 19:01:05,456 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:05,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2020-01-16 19:01:05,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 398. [2020-01-16 19:01:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 19:01:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1387 transitions. [2020-01-16 19:01:05,465 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1387 transitions. Word has length 22 [2020-01-16 19:01:05,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:05,466 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1387 transitions. [2020-01-16 19:01:05,466 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1387 transitions. [2020-01-16 19:01:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:05,466 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:05,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, 1, 1, 1] [2020-01-16 19:01:05,466 INFO L426 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:05,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:05,467 INFO L82 PathProgramCache]: Analyzing trace with hash -685563440, now seen corresponding path program 291 times [2020-01-16 19:01:05,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:05,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073878454] [2020-01-16 19:01:05,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:05,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-01-16 19:01:05,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073878454] [2020-01-16 19:01:05,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:05,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:05,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216004727] [2020-01-16 19:01:05,751 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:05,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:05,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:05,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:05,751 INFO L87 Difference]: Start difference. First operand 398 states and 1387 transitions. Second operand 9 states. [2020-01-16 19:01:05,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:05,836 INFO L93 Difference]: Finished difference Result 687 states and 2022 transitions. [2020-01-16 19:01:05,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:05,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:05,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:05,837 INFO L225 Difference]: With dead ends: 687 [2020-01-16 19:01:05,837 INFO L226 Difference]: Without dead ends: 671 [2020-01-16 19:01:05,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:05,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2020-01-16 19:01:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 406. [2020-01-16 19:01:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-01-16 19:01:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1400 transitions. [2020-01-16 19:01:05,847 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1400 transitions. Word has length 22 [2020-01-16 19:01:05,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:05,847 INFO L478 AbstractCegarLoop]: Abstraction has 406 states and 1400 transitions. [2020-01-16 19:01:05,848 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:05,848 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1400 transitions. [2020-01-16 19:01:05,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:05,848 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:05,848 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:05,848 INFO L426 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:05,849 INFO L82 PathProgramCache]: Analyzing trace with hash 2111832306, now seen corresponding path program 292 times [2020-01-16 19:01:05,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:05,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009082349] [2020-01-16 19:01:05,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:06,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:06,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009082349] [2020-01-16 19:01:06,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:06,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:06,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106593453] [2020-01-16 19:01:06,127 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:06,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:06,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:06,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:06,127 INFO L87 Difference]: Start difference. First operand 406 states and 1400 transitions. Second operand 9 states. [2020-01-16 19:01:06,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:06,228 INFO L93 Difference]: Finished difference Result 685 states and 2012 transitions. [2020-01-16 19:01:06,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:06,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:06,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:06,230 INFO L225 Difference]: With dead ends: 685 [2020-01-16 19:01:06,230 INFO L226 Difference]: Without dead ends: 663 [2020-01-16 19:01:06,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:06,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2020-01-16 19:01:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 398. [2020-01-16 19:01:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 19:01:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1382 transitions. [2020-01-16 19:01:06,241 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1382 transitions. Word has length 22 [2020-01-16 19:01:06,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:06,241 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1382 transitions. [2020-01-16 19:01:06,241 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1382 transitions. [2020-01-16 19:01:06,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:06,241 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:06,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, 1, 1, 1] [2020-01-16 19:01:06,242 INFO L426 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:06,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:06,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1900859854, now seen corresponding path program 293 times [2020-01-16 19:01:06,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:06,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326454566] [2020-01-16 19:01:06,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:06,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:06,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326454566] [2020-01-16 19:01:06,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:06,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:06,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310035952] [2020-01-16 19:01:06,514 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:06,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:06,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:06,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:06,515 INFO L87 Difference]: Start difference. First operand 398 states and 1382 transitions. Second operand 9 states. [2020-01-16 19:01:06,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:06,622 INFO L93 Difference]: Finished difference Result 672 states and 1987 transitions. [2020-01-16 19:01:06,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:06,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:06,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:06,624 INFO L225 Difference]: With dead ends: 672 [2020-01-16 19:01:06,625 INFO L226 Difference]: Without dead ends: 661 [2020-01-16 19:01:06,625 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:06,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2020-01-16 19:01:06,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 401. [2020-01-16 19:01:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-01-16 19:01:06,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1387 transitions. [2020-01-16 19:01:06,634 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1387 transitions. Word has length 22 [2020-01-16 19:01:06,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:06,634 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 1387 transitions. [2020-01-16 19:01:06,634 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1387 transitions. [2020-01-16 19:01:06,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:06,635 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:06,635 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:06,635 INFO L426 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:06,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:06,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1882425828, now seen corresponding path program 294 times [2020-01-16 19:01:06,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:06,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209926904] [2020-01-16 19:01:06,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:06,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:06,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209926904] [2020-01-16 19:01:06,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:06,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:06,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078672220] [2020-01-16 19:01:06,925 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:06,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:06,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:06,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:06,926 INFO L87 Difference]: Start difference. First operand 401 states and 1387 transitions. Second operand 9 states. [2020-01-16 19:01:07,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:07,039 INFO L93 Difference]: Finished difference Result 675 states and 1990 transitions. [2020-01-16 19:01:07,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:07,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:07,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:07,041 INFO L225 Difference]: With dead ends: 675 [2020-01-16 19:01:07,041 INFO L226 Difference]: Without dead ends: 653 [2020-01-16 19:01:07,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:07,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-01-16 19:01:07,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 393. [2020-01-16 19:01:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:01:07,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1370 transitions. [2020-01-16 19:01:07,054 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1370 transitions. Word has length 22 [2020-01-16 19:01:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:07,055 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1370 transitions. [2020-01-16 19:01:07,055 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:07,055 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1370 transitions. [2020-01-16 19:01:07,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:07,055 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:07,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, 1, 1, 1] [2020-01-16 19:01:07,056 INFO L426 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:07,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:07,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1795585756, now seen corresponding path program 295 times [2020-01-16 19:01:07,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:07,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207992570] [2020-01-16 19:01:07,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:07,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-01-16 19:01:07,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207992570] [2020-01-16 19:01:07,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:07,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:07,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031608747] [2020-01-16 19:01:07,335 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:07,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:07,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:07,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:07,335 INFO L87 Difference]: Start difference. First operand 393 states and 1370 transitions. Second operand 9 states. [2020-01-16 19:01:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:07,424 INFO L93 Difference]: Finished difference Result 676 states and 1997 transitions. [2020-01-16 19:01:07,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:07,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:07,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:07,426 INFO L225 Difference]: With dead ends: 676 [2020-01-16 19:01:07,426 INFO L226 Difference]: Without dead ends: 660 [2020-01-16 19:01:07,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:07,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2020-01-16 19:01:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 401. [2020-01-16 19:01:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-01-16 19:01:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1390 transitions. [2020-01-16 19:01:07,435 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1390 transitions. Word has length 22 [2020-01-16 19:01:07,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:07,435 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 1390 transitions. [2020-01-16 19:01:07,436 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1390 transitions. [2020-01-16 19:01:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:07,436 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:07,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, 1, 1, 1] [2020-01-16 19:01:07,436 INFO L426 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:07,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:07,437 INFO L82 PathProgramCache]: Analyzing trace with hash -205319870, now seen corresponding path program 296 times [2020-01-16 19:01:07,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:07,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794245980] [2020-01-16 19:01:07,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:07,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-01-16 19:01:07,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794245980] [2020-01-16 19:01:07,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:07,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:07,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017522962] [2020-01-16 19:01:07,702 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:07,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:07,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:07,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:07,702 INFO L87 Difference]: Start difference. First operand 401 states and 1390 transitions. Second operand 9 states. [2020-01-16 19:01:07,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:07,815 INFO L93 Difference]: Finished difference Result 671 states and 1984 transitions. [2020-01-16 19:01:07,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:07,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:07,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:07,817 INFO L225 Difference]: With dead ends: 671 [2020-01-16 19:01:07,817 INFO L226 Difference]: Without dead ends: 656 [2020-01-16 19:01:07,817 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:07,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-01-16 19:01:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 397. [2020-01-16 19:01:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:01:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1380 transitions. [2020-01-16 19:01:07,827 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1380 transitions. Word has length 22 [2020-01-16 19:01:07,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:07,827 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1380 transitions. [2020-01-16 19:01:07,827 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:07,827 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1380 transitions. [2020-01-16 19:01:07,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:07,827 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:07,827 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:07,827 INFO L426 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:07,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:07,828 INFO L82 PathProgramCache]: Analyzing trace with hash -463022828, now seen corresponding path program 297 times [2020-01-16 19:01:07,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:07,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075518835] [2020-01-16 19:01:07,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:08,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075518835] [2020-01-16 19:01:08,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:08,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:08,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680353800] [2020-01-16 19:01:08,099 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:08,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:08,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:08,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:08,099 INFO L87 Difference]: Start difference. First operand 397 states and 1380 transitions. Second operand 9 states. [2020-01-16 19:01:08,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:08,203 INFO L93 Difference]: Finished difference Result 680 states and 2003 transitions. [2020-01-16 19:01:08,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:08,203 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:08,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:08,205 INFO L225 Difference]: With dead ends: 680 [2020-01-16 19:01:08,205 INFO L226 Difference]: Without dead ends: 664 [2020-01-16 19:01:08,205 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:08,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-01-16 19:01:08,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 403. [2020-01-16 19:01:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-01-16 19:01:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1390 transitions. [2020-01-16 19:01:08,214 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1390 transitions. Word has length 22 [2020-01-16 19:01:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:08,214 INFO L478 AbstractCegarLoop]: Abstraction has 403 states and 1390 transitions. [2020-01-16 19:01:08,214 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:08,214 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1390 transitions. [2020-01-16 19:01:08,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:08,215 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:08,215 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:08,215 INFO L426 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:08,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:08,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2054122856, now seen corresponding path program 298 times [2020-01-16 19:01:08,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:08,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824798783] [2020-01-16 19:01:08,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:08,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-01-16 19:01:08,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824798783] [2020-01-16 19:01:08,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:08,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:08,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045792870] [2020-01-16 19:01:08,486 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:08,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:08,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:08,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:08,486 INFO L87 Difference]: Start difference. First operand 403 states and 1390 transitions. Second operand 9 states. [2020-01-16 19:01:08,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:08,590 INFO L93 Difference]: Finished difference Result 677 states and 1992 transitions. [2020-01-16 19:01:08,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:08,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:08,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:08,592 INFO L225 Difference]: With dead ends: 677 [2020-01-16 19:01:08,592 INFO L226 Difference]: Without dead ends: 658 [2020-01-16 19:01:08,592 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:08,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-01-16 19:01:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 397. [2020-01-16 19:01:08,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:01:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1376 transitions. [2020-01-16 19:01:08,602 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1376 transitions. Word has length 22 [2020-01-16 19:01:08,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:08,602 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1376 transitions. [2020-01-16 19:01:08,602 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:08,602 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1376 transitions. [2020-01-16 19:01:08,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:08,602 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:08,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, 1, 1, 1] [2020-01-16 19:01:08,603 INFO L426 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:08,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:08,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1678319242, now seen corresponding path program 299 times [2020-01-16 19:01:08,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:08,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524245947] [2020-01-16 19:01:08,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:08,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-01-16 19:01:08,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524245947] [2020-01-16 19:01:08,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:08,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:08,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194943919] [2020-01-16 19:01:08,870 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:08,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:08,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:08,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:08,870 INFO L87 Difference]: Start difference. First operand 397 states and 1376 transitions. Second operand 9 states. [2020-01-16 19:01:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:08,989 INFO L93 Difference]: Finished difference Result 667 states and 1973 transitions. [2020-01-16 19:01:08,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:08,990 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:08,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:08,991 INFO L225 Difference]: With dead ends: 667 [2020-01-16 19:01:08,991 INFO L226 Difference]: Without dead ends: 656 [2020-01-16 19:01:08,992 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:08,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-01-16 19:01:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 400. [2020-01-16 19:01:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-01-16 19:01:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1381 transitions. [2020-01-16 19:01:09,004 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1381 transitions. Word has length 22 [2020-01-16 19:01:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:09,004 INFO L478 AbstractCegarLoop]: Abstraction has 400 states and 1381 transitions. [2020-01-16 19:01:09,004 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1381 transitions. [2020-01-16 19:01:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:09,005 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:09,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, 1, 1, 1] [2020-01-16 19:01:09,005 INFO L426 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:09,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:09,005 INFO L82 PathProgramCache]: Analyzing trace with hash 50728092, now seen corresponding path program 300 times [2020-01-16 19:01:09,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:09,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623686049] [2020-01-16 19:01:09,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:09,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-01-16 19:01:09,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623686049] [2020-01-16 19:01:09,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:09,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:09,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872462059] [2020-01-16 19:01:09,270 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:09,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:09,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:09,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:09,271 INFO L87 Difference]: Start difference. First operand 400 states and 1381 transitions. Second operand 9 states. [2020-01-16 19:01:09,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:09,376 INFO L93 Difference]: Finished difference Result 669 states and 1974 transitions. [2020-01-16 19:01:09,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:09,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:09,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:09,378 INFO L225 Difference]: With dead ends: 669 [2020-01-16 19:01:09,378 INFO L226 Difference]: Without dead ends: 649 [2020-01-16 19:01:09,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:09,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2020-01-16 19:01:09,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 393. [2020-01-16 19:01:09,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:01:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1366 transitions. [2020-01-16 19:01:09,388 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1366 transitions. Word has length 22 [2020-01-16 19:01:09,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:09,388 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1366 transitions. [2020-01-16 19:01:09,388 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:09,388 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1366 transitions. [2020-01-16 19:01:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:09,389 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:09,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, 1, 1, 1] [2020-01-16 19:01:09,389 INFO L426 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:09,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:09,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1969181664, now seen corresponding path program 301 times [2020-01-16 19:01:09,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:09,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641508708] [2020-01-16 19:01:09,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:09,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-01-16 19:01:09,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641508708] [2020-01-16 19:01:09,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:09,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:09,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004070913] [2020-01-16 19:01:09,674 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:09,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:09,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:09,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:09,675 INFO L87 Difference]: Start difference. First operand 393 states and 1366 transitions. Second operand 9 states. [2020-01-16 19:01:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:09,770 INFO L93 Difference]: Finished difference Result 696 states and 2042 transitions. [2020-01-16 19:01:09,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:09,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:09,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:09,772 INFO L225 Difference]: With dead ends: 696 [2020-01-16 19:01:09,772 INFO L226 Difference]: Without dead ends: 680 [2020-01-16 19:01:09,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:09,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-01-16 19:01:09,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 409. [2020-01-16 19:01:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2020-01-16 19:01:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1404 transitions. [2020-01-16 19:01:09,783 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1404 transitions. Word has length 22 [2020-01-16 19:01:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:09,784 INFO L478 AbstractCegarLoop]: Abstraction has 409 states and 1404 transitions. [2020-01-16 19:01:09,784 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1404 transitions. [2020-01-16 19:01:09,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:09,785 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:09,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, 1, 1, 1] [2020-01-16 19:01:09,785 INFO L426 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:09,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:09,785 INFO L82 PathProgramCache]: Analyzing trace with hash 471610114, now seen corresponding path program 302 times [2020-01-16 19:01:09,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:09,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597434051] [2020-01-16 19:01:09,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:10,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597434051] [2020-01-16 19:01:10,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:10,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:10,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960456801] [2020-01-16 19:01:10,093 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:10,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:10,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:10,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:10,093 INFO L87 Difference]: Start difference. First operand 409 states and 1404 transitions. Second operand 9 states. [2020-01-16 19:01:10,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:10,192 INFO L93 Difference]: Finished difference Result 694 states and 2032 transitions. [2020-01-16 19:01:10,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:10,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:10,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:10,194 INFO L225 Difference]: With dead ends: 694 [2020-01-16 19:01:10,194 INFO L226 Difference]: Without dead ends: 672 [2020-01-16 19:01:10,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2020-01-16 19:01:10,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 401. [2020-01-16 19:01:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-01-16 19:01:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1384 transitions. [2020-01-16 19:01:10,204 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1384 transitions. Word has length 22 [2020-01-16 19:01:10,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:10,204 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 1384 transitions. [2020-01-16 19:01:10,204 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:10,204 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1384 transitions. [2020-01-16 19:01:10,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:10,205 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:10,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, 1, 1, 1] [2020-01-16 19:01:10,205 INFO L426 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:10,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:10,205 INFO L82 PathProgramCache]: Analyzing trace with hash -836380636, now seen corresponding path program 303 times [2020-01-16 19:01:10,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:10,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712446585] [2020-01-16 19:01:10,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:10,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-01-16 19:01:10,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712446585] [2020-01-16 19:01:10,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:10,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:10,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520528036] [2020-01-16 19:01:10,488 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:10,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:10,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:10,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:10,489 INFO L87 Difference]: Start difference. First operand 401 states and 1384 transitions. Second operand 9 states. [2020-01-16 19:01:10,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:10,578 INFO L93 Difference]: Finished difference Result 693 states and 2029 transitions. [2020-01-16 19:01:10,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:10,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:10,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:10,580 INFO L225 Difference]: With dead ends: 693 [2020-01-16 19:01:10,580 INFO L226 Difference]: Without dead ends: 677 [2020-01-16 19:01:10,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:10,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2020-01-16 19:01:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 407. [2020-01-16 19:01:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-01-16 19:01:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1394 transitions. [2020-01-16 19:01:10,591 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1394 transitions. Word has length 22 [2020-01-16 19:01:10,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:10,591 INFO L478 AbstractCegarLoop]: Abstraction has 407 states and 1394 transitions. [2020-01-16 19:01:10,591 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1394 transitions. [2020-01-16 19:01:10,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:10,592 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:10,592 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:10,592 INFO L426 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:10,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:10,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1867486632, now seen corresponding path program 304 times [2020-01-16 19:01:10,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:10,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054575656] [2020-01-16 19:01:10,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:10,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-01-16 19:01:10,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054575656] [2020-01-16 19:01:10,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:10,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:10,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798141370] [2020-01-16 19:01:10,874 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:10,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:10,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:10,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:10,875 INFO L87 Difference]: Start difference. First operand 407 states and 1394 transitions. Second operand 9 states. [2020-01-16 19:01:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:10,977 INFO L93 Difference]: Finished difference Result 690 states and 2018 transitions. [2020-01-16 19:01:10,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:10,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:10,979 INFO L225 Difference]: With dead ends: 690 [2020-01-16 19:01:10,980 INFO L226 Difference]: Without dead ends: 671 [2020-01-16 19:01:10,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:10,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2020-01-16 19:01:10,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 401. [2020-01-16 19:01:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-01-16 19:01:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1378 transitions. [2020-01-16 19:01:10,989 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1378 transitions. Word has length 22 [2020-01-16 19:01:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:10,989 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 1378 transitions. [2020-01-16 19:01:10,989 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1378 transitions. [2020-01-16 19:01:10,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:10,990 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01: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, 1, 1, 1] [2020-01-16 19:01:10,990 INFO L426 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:10,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:10,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1582826058, now seen corresponding path program 305 times [2020-01-16 19:01:10,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:10,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164774836] [2020-01-16 19:01:10,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01: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-01-16 19:01:11,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164774836] [2020-01-16 19:01:11,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:11,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:11,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083395970] [2020-01-16 19:01:11,267 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:11,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:11,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:11,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:11,267 INFO L87 Difference]: Start difference. First operand 401 states and 1378 transitions. Second operand 9 states. [2020-01-16 19:01:11,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:11,372 INFO L93 Difference]: Finished difference Result 688 states and 2015 transitions. [2020-01-16 19:01:11,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:11,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:11,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:11,374 INFO L225 Difference]: With dead ends: 688 [2020-01-16 19:01:11,374 INFO L226 Difference]: Without dead ends: 674 [2020-01-16 19:01:11,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:11,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2020-01-16 19:01:11,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 406. [2020-01-16 19:01:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-01-16 19:01:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1387 transitions. [2020-01-16 19:01:11,384 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1387 transitions. Word has length 22 [2020-01-16 19:01:11,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:11,385 INFO L478 AbstractCegarLoop]: Abstraction has 406 states and 1387 transitions. [2020-01-16 19:01:11,385 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:11,385 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1387 transitions. [2020-01-16 19:01:11,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:11,385 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:11,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, 1, 1, 1] [2020-01-16 19:01:11,385 INFO L426 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:11,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:11,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1527414798, now seen corresponding path program 306 times [2020-01-16 19:01:11,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:11,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502103995] [2020-01-16 19:01:11,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:11,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-01-16 19:01:11,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502103995] [2020-01-16 19:01:11,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:11,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:11,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715055375] [2020-01-16 19:01:11,675 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:11,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:11,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:11,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:11,675 INFO L87 Difference]: Start difference. First operand 406 states and 1387 transitions. Second operand 9 states. [2020-01-16 19:01:11,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:11,801 INFO L93 Difference]: Finished difference Result 687 states and 2008 transitions. [2020-01-16 19:01:11,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:11,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:11,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:11,803 INFO L225 Difference]: With dead ends: 687 [2020-01-16 19:01:11,803 INFO L226 Difference]: Without dead ends: 661 [2020-01-16 19:01:11,804 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:11,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2020-01-16 19:01:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 393. [2020-01-16 19:01:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:01:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1360 transitions. [2020-01-16 19:01:11,813 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1360 transitions. Word has length 22 [2020-01-16 19:01:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:11,813 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1360 transitions. [2020-01-16 19:01:11,813 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1360 transitions. [2020-01-16 19:01:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:11,814 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:11,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, 1, 1, 1] [2020-01-16 19:01:11,814 INFO L426 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:11,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:11,814 INFO L82 PathProgramCache]: Analyzing trace with hash -319200130, now seen corresponding path program 307 times [2020-01-16 19:01:11,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:11,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196947291] [2020-01-16 19:01:11,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:12,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-01-16 19:01:12,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196947291] [2020-01-16 19:01:12,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:12,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:12,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745474152] [2020-01-16 19:01:12,082 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:12,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:12,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:12,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:12,082 INFO L87 Difference]: Start difference. First operand 393 states and 1360 transitions. Second operand 9 states. [2020-01-16 19:01:12,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:12,198 INFO L93 Difference]: Finished difference Result 663 states and 1963 transitions. [2020-01-16 19:01:12,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:12,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:12,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:12,200 INFO L225 Difference]: With dead ends: 663 [2020-01-16 19:01:12,200 INFO L226 Difference]: Without dead ends: 652 [2020-01-16 19:01:12,200 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:12,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2020-01-16 19:01:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 399. [2020-01-16 19:01:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:01:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1376 transitions. [2020-01-16 19:01:12,209 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1376 transitions. Word has length 22 [2020-01-16 19:01:12,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:12,209 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1376 transitions. [2020-01-16 19:01:12,209 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:12,209 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1376 transitions. [2020-01-16 19:01:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:12,210 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:12,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, 1, 1, 1] [2020-01-16 19:01:12,210 INFO L426 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:12,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:12,210 INFO L82 PathProgramCache]: Analyzing trace with hash -300766104, now seen corresponding path program 308 times [2020-01-16 19:01:12,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:12,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804764144] [2020-01-16 19:01:12,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:12,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804764144] [2020-01-16 19:01:12,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:12,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:12,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437882932] [2020-01-16 19:01:12,471 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:12,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:12,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:12,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:12,471 INFO L87 Difference]: Start difference. First operand 399 states and 1376 transitions. Second operand 9 states. [2020-01-16 19:01:12,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:12,587 INFO L93 Difference]: Finished difference Result 666 states and 1966 transitions. [2020-01-16 19:01:12,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:12,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:12,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:12,589 INFO L225 Difference]: With dead ends: 666 [2020-01-16 19:01:12,590 INFO L226 Difference]: Without dead ends: 649 [2020-01-16 19:01:12,590 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:12,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2020-01-16 19:01:12,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 396. [2020-01-16 19:01:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:01:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1368 transitions. [2020-01-16 19:01:12,601 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1368 transitions. Word has length 22 [2020-01-16 19:01:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:12,601 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1368 transitions. [2020-01-16 19:01:12,601 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1368 transitions. [2020-01-16 19:01:12,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:12,601 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:12,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, 1, 1, 1] [2020-01-16 19:01:12,602 INFO L426 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:12,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:12,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1170204866, now seen corresponding path program 309 times [2020-01-16 19:01:12,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:12,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761699925] [2020-01-16 19:01:12,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:12,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761699925] [2020-01-16 19:01:12,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:12,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:12,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621168419] [2020-01-16 19:01:12,867 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:12,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:12,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:12,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:12,867 INFO L87 Difference]: Start difference. First operand 396 states and 1368 transitions. Second operand 9 states. [2020-01-16 19:01:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:12,967 INFO L93 Difference]: Finished difference Result 662 states and 1958 transitions. [2020-01-16 19:01:12,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:12,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:12,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:12,968 INFO L225 Difference]: With dead ends: 662 [2020-01-16 19:01:12,968 INFO L226 Difference]: Without dead ends: 651 [2020-01-16 19:01:12,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:12,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2020-01-16 19:01:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 399. [2020-01-16 19:01:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:01:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1373 transitions. [2020-01-16 19:01:12,978 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1373 transitions. Word has length 22 [2020-01-16 19:01:12,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:12,978 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1373 transitions. [2020-01-16 19:01:12,978 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1373 transitions. [2020-01-16 19:01:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:12,979 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:12,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, 1, 1, 1] [2020-01-16 19:01:12,979 INFO L426 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:12,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:12,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1395715096, now seen corresponding path program 310 times [2020-01-16 19:01:12,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:12,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059413933] [2020-01-16 19:01:12,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:13,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059413933] [2020-01-16 19:01:13,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:13,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:13,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657563620] [2020-01-16 19:01:13,253 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:13,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:13,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:13,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:13,253 INFO L87 Difference]: Start difference. First operand 399 states and 1373 transitions. Second operand 9 states. [2020-01-16 19:01:13,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:13,361 INFO L93 Difference]: Finished difference Result 664 states and 1959 transitions. [2020-01-16 19:01:13,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:13,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:13,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:13,363 INFO L225 Difference]: With dead ends: 664 [2020-01-16 19:01:13,363 INFO L226 Difference]: Without dead ends: 648 [2020-01-16 19:01:13,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:13,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-01-16 19:01:13,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 396. [2020-01-16 19:01:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:01:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1365 transitions. [2020-01-16 19:01:13,373 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1365 transitions. Word has length 22 [2020-01-16 19:01:13,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:13,373 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1365 transitions. [2020-01-16 19:01:13,373 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:13,373 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1365 transitions. [2020-01-16 19:01:13,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:13,374 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:13,374 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:13,374 INFO L426 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:13,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:13,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1760093698, now seen corresponding path program 311 times [2020-01-16 19:01:13,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:13,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519733567] [2020-01-16 19:01:13,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:13,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-01-16 19:01:13,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519733567] [2020-01-16 19:01:13,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:13,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:13,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971652359] [2020-01-16 19:01:13,642 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:13,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:13,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:13,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:13,642 INFO L87 Difference]: Start difference. First operand 396 states and 1365 transitions. Second operand 9 states. [2020-01-16 19:01:13,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:13,750 INFO L93 Difference]: Finished difference Result 670 states and 1973 transitions. [2020-01-16 19:01:13,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:13,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:13,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:13,752 INFO L225 Difference]: With dead ends: 670 [2020-01-16 19:01:13,752 INFO L226 Difference]: Without dead ends: 656 [2020-01-16 19:01:13,753 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:13,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-01-16 19:01:13,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 401. [2020-01-16 19:01:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-01-16 19:01:13,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1374 transitions. [2020-01-16 19:01:13,762 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1374 transitions. Word has length 22 [2020-01-16 19:01:13,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:13,762 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 1374 transitions. [2020-01-16 19:01:13,762 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1374 transitions. [2020-01-16 19:01:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:13,763 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:13,763 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:13,763 INFO L426 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:13,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:13,763 INFO L82 PathProgramCache]: Analyzing trace with hash -824260290, now seen corresponding path program 312 times [2020-01-16 19:01:13,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:13,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918180074] [2020-01-16 19:01:13,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:14,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918180074] [2020-01-16 19:01:14,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:14,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:14,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443275471] [2020-01-16 19:01:14,035 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:14,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:14,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:14,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:14,035 INFO L87 Difference]: Start difference. First operand 401 states and 1374 transitions. Second operand 9 states. [2020-01-16 19:01:14,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:14,172 INFO L93 Difference]: Finished difference Result 669 states and 1966 transitions. [2020-01-16 19:01:14,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:14,172 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:14,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:14,173 INFO L225 Difference]: With dead ends: 669 [2020-01-16 19:01:14,174 INFO L226 Difference]: Without dead ends: 642 [2020-01-16 19:01:14,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:14,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-01-16 19:01:14,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 387. [2020-01-16 19:01:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:01:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1348 transitions. [2020-01-16 19:01:14,183 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1348 transitions. Word has length 22 [2020-01-16 19:01:14,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:14,183 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1348 transitions. [2020-01-16 19:01:14,183 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:14,183 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1348 transitions. [2020-01-16 19:01:14,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:14,184 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:14,184 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:14,184 INFO L426 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:14,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:14,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1956856404, now seen corresponding path program 313 times [2020-01-16 19:01:14,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:14,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963603118] [2020-01-16 19:01:14,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:14,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963603118] [2020-01-16 19:01:14,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:14,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:14,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255059855] [2020-01-16 19:01:14,440 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:14,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:14,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:14,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:14,441 INFO L87 Difference]: Start difference. First operand 387 states and 1348 transitions. Second operand 9 states. [2020-01-16 19:01:14,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:14,533 INFO L93 Difference]: Finished difference Result 652 states and 1916 transitions. [2020-01-16 19:01:14,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:14,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:14,535 INFO L225 Difference]: With dead ends: 652 [2020-01-16 19:01:14,535 INFO L226 Difference]: Without dead ends: 636 [2020-01-16 19:01:14,536 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:14,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2020-01-16 19:01:14,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 396. [2020-01-16 19:01:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:01:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1371 transitions. [2020-01-16 19:01:14,545 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1371 transitions. Word has length 22 [2020-01-16 19:01:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:14,545 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1371 transitions. [2020-01-16 19:01:14,545 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1371 transitions. [2020-01-16 19:01:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:14,546 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:14,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, 1, 1, 1] [2020-01-16 19:01:14,546 INFO L426 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:14,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:14,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1777042400, now seen corresponding path program 314 times [2020-01-16 19:01:14,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:14,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939912877] [2020-01-16 19:01:14,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:14,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939912877] [2020-01-16 19:01:14,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:14,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:14,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385599122] [2020-01-16 19:01:14,811 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:14,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:14,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:14,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:14,811 INFO L87 Difference]: Start difference. First operand 396 states and 1371 transitions. Second operand 9 states. [2020-01-16 19:01:14,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:14,895 INFO L93 Difference]: Finished difference Result 645 states and 1901 transitions. [2020-01-16 19:01:14,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:14,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:14,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:14,897 INFO L225 Difference]: With dead ends: 645 [2020-01-16 19:01:14,897 INFO L226 Difference]: Without dead ends: 634 [2020-01-16 19:01:14,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:14,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-01-16 19:01:14,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 394. [2020-01-16 19:01:14,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:01:14,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1367 transitions. [2020-01-16 19:01:14,906 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1367 transitions. Word has length 22 [2020-01-16 19:01:14,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:14,906 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1367 transitions. [2020-01-16 19:01:14,906 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:14,906 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1367 transitions. [2020-01-16 19:01:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:14,907 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:14,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, 1, 1, 1] [2020-01-16 19:01:14,907 INFO L426 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:14,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:14,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1325418360, now seen corresponding path program 315 times [2020-01-16 19:01:14,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:14,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479289582] [2020-01-16 19:01:14,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:15,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479289582] [2020-01-16 19:01:15,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:15,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:15,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123892220] [2020-01-16 19:01:15,182 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:15,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:15,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:15,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:15,182 INFO L87 Difference]: Start difference. First operand 394 states and 1367 transitions. Second operand 9 states. [2020-01-16 19:01:15,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:15,286 INFO L93 Difference]: Finished difference Result 663 states and 1940 transitions. [2020-01-16 19:01:15,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:15,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:15,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:15,288 INFO L225 Difference]: With dead ends: 663 [2020-01-16 19:01:15,288 INFO L226 Difference]: Without dead ends: 647 [2020-01-16 19:01:15,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:15,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2020-01-16 19:01:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 402. [2020-01-16 19:01:15,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-01-16 19:01:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1380 transitions. [2020-01-16 19:01:15,298 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1380 transitions. Word has length 22 [2020-01-16 19:01:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:15,298 INFO L478 AbstractCegarLoop]: Abstraction has 402 states and 1380 transitions. [2020-01-16 19:01:15,299 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:15,299 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1380 transitions. [2020-01-16 19:01:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:15,299 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01: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, 1, 1, 1] [2020-01-16 19:01:15,299 INFO L426 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:15,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:15,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1455388806, now seen corresponding path program 316 times [2020-01-16 19:01:15,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:15,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456930537] [2020-01-16 19:01:15,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:15,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-01-16 19:01:15,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456930537] [2020-01-16 19:01:15,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:15,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:15,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574606510] [2020-01-16 19:01:15,583 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:15,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:15,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:15,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:15,584 INFO L87 Difference]: Start difference. First operand 402 states and 1380 transitions. Second operand 9 states. [2020-01-16 19:01:15,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:15,715 INFO L93 Difference]: Finished difference Result 661 states and 1930 transitions. [2020-01-16 19:01:15,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:15,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:15,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:15,717 INFO L225 Difference]: With dead ends: 661 [2020-01-16 19:01:15,717 INFO L226 Difference]: Without dead ends: 639 [2020-01-16 19:01:15,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:15,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-01-16 19:01:15,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 394. [2020-01-16 19:01:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:01:15,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1364 transitions. [2020-01-16 19:01:15,726 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1364 transitions. Word has length 22 [2020-01-16 19:01:15,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:15,726 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1364 transitions. [2020-01-16 19:01:15,726 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:15,726 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1364 transitions. [2020-01-16 19:01:15,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:15,726 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:15,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, 1, 1, 1] [2020-01-16 19:01:15,727 INFO L426 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:15,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:15,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1270696134, now seen corresponding path program 317 times [2020-01-16 19:01:15,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:15,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786943390] [2020-01-16 19:01:15,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:15,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786943390] [2020-01-16 19:01:15,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:15,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:15,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907614763] [2020-01-16 19:01:15,994 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:15,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:15,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:15,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:15,994 INFO L87 Difference]: Start difference. First operand 394 states and 1364 transitions. Second operand 9 states. [2020-01-16 19:01:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:16,078 INFO L93 Difference]: Finished difference Result 642 states and 1893 transitions. [2020-01-16 19:01:16,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:16,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:16,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:16,080 INFO L225 Difference]: With dead ends: 642 [2020-01-16 19:01:16,080 INFO L226 Difference]: Without dead ends: 633 [2020-01-16 19:01:16,080 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-01-16 19:01:16,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 395. [2020-01-16 19:01:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:01:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1365 transitions. [2020-01-16 19:01:16,089 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1365 transitions. Word has length 22 [2020-01-16 19:01:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:16,090 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1365 transitions. [2020-01-16 19:01:16,090 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1365 transitions. [2020-01-16 19:01:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:16,090 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:16,090 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:16,090 INFO L426 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:16,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:16,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1948560006, now seen corresponding path program 318 times [2020-01-16 19:01:16,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:16,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670442217] [2020-01-16 19:01:16,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:16,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-01-16 19:01:16,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670442217] [2020-01-16 19:01:16,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:16,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:16,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565463633] [2020-01-16 19:01:16,350 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:16,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:16,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:16,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:16,351 INFO L87 Difference]: Start difference. First operand 395 states and 1365 transitions. Second operand 9 states. [2020-01-16 19:01:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:16,465 INFO L93 Difference]: Finished difference Result 647 states and 1902 transitions. [2020-01-16 19:01:16,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:16,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:16,467 INFO L225 Difference]: With dead ends: 647 [2020-01-16 19:01:16,467 INFO L226 Difference]: Without dead ends: 629 [2020-01-16 19:01:16,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:16,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-01-16 19:01:16,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 391. [2020-01-16 19:01:16,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:01:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1358 transitions. [2020-01-16 19:01:16,477 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1358 transitions. Word has length 22 [2020-01-16 19:01:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:16,477 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1358 transitions. [2020-01-16 19:01:16,477 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1358 transitions. [2020-01-16 19:01:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:16,478 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:16,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, 1, 1, 1] [2020-01-16 19:01:16,478 INFO L426 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:16,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:16,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1513957264, now seen corresponding path program 319 times [2020-01-16 19:01:16,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:16,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874647812] [2020-01-16 19:01:16,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:16,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:16,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874647812] [2020-01-16 19:01:16,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:16,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:16,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529101466] [2020-01-16 19:01:16,741 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:16,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:16,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:16,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:16,742 INFO L87 Difference]: Start difference. First operand 391 states and 1358 transitions. Second operand 9 states. [2020-01-16 19:01:16,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:16,836 INFO L93 Difference]: Finished difference Result 648 states and 1905 transitions. [2020-01-16 19:01:16,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:16,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:16,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:16,838 INFO L225 Difference]: With dead ends: 648 [2020-01-16 19:01:16,838 INFO L226 Difference]: Without dead ends: 632 [2020-01-16 19:01:16,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-01-16 19:01:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 395. [2020-01-16 19:01:16,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:01:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1366 transitions. [2020-01-16 19:01:16,848 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1366 transitions. Word has length 22 [2020-01-16 19:01:16,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:16,848 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1366 transitions. [2020-01-16 19:01:16,848 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:16,848 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1366 transitions. [2020-01-16 19:01:16,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:16,849 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:16,849 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:16,849 INFO L426 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:16,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:16,849 INFO L82 PathProgramCache]: Analyzing trace with hash 2075025756, now seen corresponding path program 320 times [2020-01-16 19:01:16,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:16,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390306449] [2020-01-16 19:01:16,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:17,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:17,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390306449] [2020-01-16 19:01:17,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:17,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:17,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484458097] [2020-01-16 19:01:17,111 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:17,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:17,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:17,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:17,111 INFO L87 Difference]: Start difference. First operand 395 states and 1366 transitions. Second operand 9 states. [2020-01-16 19:01:17,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:17,218 INFO L93 Difference]: Finished difference Result 641 states and 1890 transitions. [2020-01-16 19:01:17,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:17,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:17,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:17,220 INFO L225 Difference]: With dead ends: 641 [2020-01-16 19:01:17,220 INFO L226 Difference]: Without dead ends: 630 [2020-01-16 19:01:17,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-01-16 19:01:17,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 393. [2020-01-16 19:01:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:01:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1362 transitions. [2020-01-16 19:01:17,230 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1362 transitions. Word has length 22 [2020-01-16 19:01:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:17,230 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1362 transitions. [2020-01-16 19:01:17,230 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:17,230 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1362 transitions. [2020-01-16 19:01:17,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:17,231 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:17,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, 1, 1, 1] [2020-01-16 19:01:17,231 INFO L426 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:17,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:17,231 INFO L82 PathProgramCache]: Analyzing trace with hash -674225912, now seen corresponding path program 321 times [2020-01-16 19:01:17,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:17,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300527719] [2020-01-16 19:01:17,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:17,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-01-16 19:01:17,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300527719] [2020-01-16 19:01:17,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:17,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:17,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059038008] [2020-01-16 19:01:17,520 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:17,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:17,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:17,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:17,521 INFO L87 Difference]: Start difference. First operand 393 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:01:17,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:17,617 INFO L93 Difference]: Finished difference Result 656 states and 1923 transitions. [2020-01-16 19:01:17,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:17,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:17,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:17,619 INFO L225 Difference]: With dead ends: 656 [2020-01-16 19:01:17,619 INFO L226 Difference]: Without dead ends: 640 [2020-01-16 19:01:17,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:17,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-01-16 19:01:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 399. [2020-01-16 19:01:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:01:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1372 transitions. [2020-01-16 19:01:17,628 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1372 transitions. Word has length 22 [2020-01-16 19:01:17,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:17,629 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1372 transitions. [2020-01-16 19:01:17,629 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:17,629 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1372 transitions. [2020-01-16 19:01:17,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:17,629 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:17,629 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:17,629 INFO L426 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:17,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:17,630 INFO L82 PathProgramCache]: Analyzing trace with hash -481405220, now seen corresponding path program 322 times [2020-01-16 19:01:17,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:17,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808757914] [2020-01-16 19:01:17,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:17,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-01-16 19:01:17,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808757914] [2020-01-16 19:01:17,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:17,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:17,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293906846] [2020-01-16 19:01:17,899 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:17,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:17,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:17,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:17,900 INFO L87 Difference]: Start difference. First operand 399 states and 1372 transitions. Second operand 9 states. [2020-01-16 19:01:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:18,018 INFO L93 Difference]: Finished difference Result 653 states and 1912 transitions. [2020-01-16 19:01:18,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:18,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:18,020 INFO L225 Difference]: With dead ends: 653 [2020-01-16 19:01:18,020 INFO L226 Difference]: Without dead ends: 634 [2020-01-16 19:01:18,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-01-16 19:01:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 393. [2020-01-16 19:01:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:01:18,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1360 transitions. [2020-01-16 19:01:18,028 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1360 transitions. Word has length 22 [2020-01-16 19:01:18,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:18,029 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1360 transitions. [2020-01-16 19:01:18,029 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:18,029 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1360 transitions. [2020-01-16 19:01:18,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:18,029 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:18,029 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:18,029 INFO L426 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:18,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:18,030 INFO L82 PathProgramCache]: Analyzing trace with hash -619503686, now seen corresponding path program 323 times [2020-01-16 19:01:18,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:18,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254264828] [2020-01-16 19:01:18,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:18,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-01-16 19:01:18,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254264828] [2020-01-16 19:01:18,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:18,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:18,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054767611] [2020-01-16 19:01:18,299 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:18,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:18,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:18,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:18,299 INFO L87 Difference]: Start difference. First operand 393 states and 1360 transitions. Second operand 9 states. [2020-01-16 19:01:18,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:18,406 INFO L93 Difference]: Finished difference Result 637 states and 1881 transitions. [2020-01-16 19:01:18,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:18,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:18,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:18,408 INFO L225 Difference]: With dead ends: 637 [2020-01-16 19:01:18,408 INFO L226 Difference]: Without dead ends: 628 [2020-01-16 19:01:18,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:18,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-01-16 19:01:18,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 394. [2020-01-16 19:01:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:01:18,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1361 transitions. [2020-01-16 19:01:18,418 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1361 transitions. Word has length 22 [2020-01-16 19:01:18,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:18,418 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1361 transitions. [2020-01-16 19:01:18,418 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:18,419 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1361 transitions. [2020-01-16 19:01:18,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:18,419 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:18,419 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:18,419 INFO L426 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:18,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:18,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1526667074, now seen corresponding path program 324 times [2020-01-16 19:01:18,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:18,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892138747] [2020-01-16 19:01:18,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:18,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892138747] [2020-01-16 19:01:18,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:18,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:18,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025659691] [2020-01-16 19:01:18,685 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:18,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:18,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:18,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:18,685 INFO L87 Difference]: Start difference. First operand 394 states and 1361 transitions. Second operand 9 states. [2020-01-16 19:01:18,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:18,815 INFO L93 Difference]: Finished difference Result 641 states and 1888 transitions. [2020-01-16 19:01:18,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:18,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:18,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:18,817 INFO L225 Difference]: With dead ends: 641 [2020-01-16 19:01:18,817 INFO L226 Difference]: Without dead ends: 625 [2020-01-16 19:01:18,817 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-01-16 19:01:18,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 391. [2020-01-16 19:01:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:01:18,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1356 transitions. [2020-01-16 19:01:18,826 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1356 transitions. Word has length 22 [2020-01-16 19:01:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:18,826 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1356 transitions. [2020-01-16 19:01:18,826 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1356 transitions. [2020-01-16 19:01:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:18,827 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:18,827 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:18,827 INFO L426 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:18,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:18,827 INFO L82 PathProgramCache]: Analyzing trace with hash -439620080, now seen corresponding path program 325 times [2020-01-16 19:01:18,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:18,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494139145] [2020-01-16 19:01:18,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:19,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-01-16 19:01:19,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494139145] [2020-01-16 19:01:19,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:19,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:19,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072902060] [2020-01-16 19:01:19,119 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:19,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:19,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:19,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:19,119 INFO L87 Difference]: Start difference. First operand 391 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:01:19,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:19,214 INFO L93 Difference]: Finished difference Result 680 states and 1986 transitions. [2020-01-16 19:01:19,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:19,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:19,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:19,216 INFO L225 Difference]: With dead ends: 680 [2020-01-16 19:01:19,216 INFO L226 Difference]: Without dead ends: 664 [2020-01-16 19:01:19,216 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:19,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-01-16 19:01:19,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 407. [2020-01-16 19:01:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-01-16 19:01:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1394 transitions. [2020-01-16 19:01:19,226 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1394 transitions. Word has length 22 [2020-01-16 19:01:19,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:19,227 INFO L478 AbstractCegarLoop]: Abstraction has 407 states and 1394 transitions. [2020-01-16 19:01:19,227 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1394 transitions. [2020-01-16 19:01:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:19,227 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:19,227 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:19,228 INFO L426 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:19,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:19,228 INFO L82 PathProgramCache]: Analyzing trace with hash -569590526, now seen corresponding path program 326 times [2020-01-16 19:01:19,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:19,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96364614] [2020-01-16 19:01:19,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:19,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-01-16 19:01:19,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96364614] [2020-01-16 19:01:19,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:19,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:19,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801117166] [2020-01-16 19:01:19,507 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:19,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:19,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:19,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:19,507 INFO L87 Difference]: Start difference. First operand 407 states and 1394 transitions. Second operand 9 states. [2020-01-16 19:01:19,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:19,635 INFO L93 Difference]: Finished difference Result 678 states and 1976 transitions. [2020-01-16 19:01:19,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:19,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:19,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:19,637 INFO L225 Difference]: With dead ends: 678 [2020-01-16 19:01:19,637 INFO L226 Difference]: Without dead ends: 656 [2020-01-16 19:01:19,638 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-01-16 19:01:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 399. [2020-01-16 19:01:19,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:01:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1374 transitions. [2020-01-16 19:01:19,647 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1374 transitions. Word has length 22 [2020-01-16 19:01:19,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:19,647 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1374 transitions. [2020-01-16 19:01:19,647 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1374 transitions. [2020-01-16 19:01:19,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:19,648 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:19,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, 1, 1, 1] [2020-01-16 19:01:19,648 INFO L426 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:19,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:19,648 INFO L82 PathProgramCache]: Analyzing trace with hash 654471508, now seen corresponding path program 327 times [2020-01-16 19:01:19,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:19,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130784936] [2020-01-16 19:01:19,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:19,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-01-16 19:01:19,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130784936] [2020-01-16 19:01:19,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:19,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:19,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436769587] [2020-01-16 19:01:19,930 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:19,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:19,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:19,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:19,930 INFO L87 Difference]: Start difference. First operand 399 states and 1374 transitions. Second operand 9 states. [2020-01-16 19:01:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:20,024 INFO L93 Difference]: Finished difference Result 677 states and 1973 transitions. [2020-01-16 19:01:20,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:20,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:20,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:20,026 INFO L225 Difference]: With dead ends: 677 [2020-01-16 19:01:20,026 INFO L226 Difference]: Without dead ends: 661 [2020-01-16 19:01:20,027 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:20,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2020-01-16 19:01:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 405. [2020-01-16 19:01:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-01-16 19:01:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1384 transitions. [2020-01-16 19:01:20,036 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1384 transitions. Word has length 22 [2020-01-16 19:01:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:20,036 INFO L478 AbstractCegarLoop]: Abstraction has 405 states and 1384 transitions. [2020-01-16 19:01:20,036 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:20,036 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1384 transitions. [2020-01-16 19:01:20,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:20,037 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:20,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, 1, 1, 1] [2020-01-16 19:01:20,037 INFO L426 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:20,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:20,037 INFO L82 PathProgramCache]: Analyzing trace with hash 847292200, now seen corresponding path program 328 times [2020-01-16 19:01:20,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:20,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199213333] [2020-01-16 19:01:20,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:20,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199213333] [2020-01-16 19:01:20,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:20,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:20,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619043199] [2020-01-16 19:01:20,317 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:20,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:20,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:20,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:20,318 INFO L87 Difference]: Start difference. First operand 405 states and 1384 transitions. Second operand 9 states. [2020-01-16 19:01:20,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:20,447 INFO L93 Difference]: Finished difference Result 674 states and 1962 transitions. [2020-01-16 19:01:20,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:20,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:20,449 INFO L225 Difference]: With dead ends: 674 [2020-01-16 19:01:20,449 INFO L226 Difference]: Without dead ends: 655 [2020-01-16 19:01:20,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:20,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2020-01-16 19:01:20,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 399. [2020-01-16 19:01:20,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:01:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1368 transitions. [2020-01-16 19:01:20,458 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1368 transitions. Word has length 22 [2020-01-16 19:01:20,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:20,458 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1368 transitions. [2020-01-16 19:01:20,458 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:20,459 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1368 transitions. [2020-01-16 19:01:20,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:20,459 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:20,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, 1, 1, 1] [2020-01-16 19:01:20,459 INFO L426 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:20,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:20,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1137908070, now seen corresponding path program 329 times [2020-01-16 19:01:20,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:20,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789555974] [2020-01-16 19:01:20,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:20,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-01-16 19:01:20,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789555974] [2020-01-16 19:01:20,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:20,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:20,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464212294] [2020-01-16 19:01:20,734 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:20,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:20,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:20,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:20,735 INFO L87 Difference]: Start difference. First operand 399 states and 1368 transitions. Second operand 9 states. [2020-01-16 19:01:20,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:20,865 INFO L93 Difference]: Finished difference Result 672 states and 1959 transitions. [2020-01-16 19:01:20,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:20,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:20,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:20,866 INFO L225 Difference]: With dead ends: 672 [2020-01-16 19:01:20,867 INFO L226 Difference]: Without dead ends: 658 [2020-01-16 19:01:20,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-01-16 19:01:20,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 404. [2020-01-16 19:01:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-01-16 19:01:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1377 transitions. [2020-01-16 19:01:20,876 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1377 transitions. Word has length 22 [2020-01-16 19:01:20,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:20,876 INFO L478 AbstractCegarLoop]: Abstraction has 404 states and 1377 transitions. [2020-01-16 19:01:20,876 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:20,876 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1377 transitions. [2020-01-16 19:01:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:20,876 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:20,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:20,877 INFO L426 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:20,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:20,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1193319330, now seen corresponding path program 330 times [2020-01-16 19:01:20,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:20,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730197631] [2020-01-16 19:01:20,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:21,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:21,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730197631] [2020-01-16 19:01:21,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:21,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:21,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218348763] [2020-01-16 19:01:21,154 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:21,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:21,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:21,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:21,154 INFO L87 Difference]: Start difference. First operand 404 states and 1377 transitions. Second operand 9 states. [2020-01-16 19:01:21,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:21,291 INFO L93 Difference]: Finished difference Result 671 states and 1952 transitions. [2020-01-16 19:01:21,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:21,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:21,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:21,292 INFO L225 Difference]: With dead ends: 671 [2020-01-16 19:01:21,293 INFO L226 Difference]: Without dead ends: 645 [2020-01-16 19:01:21,293 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:21,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-01-16 19:01:21,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 391. [2020-01-16 19:01:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:01:21,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1352 transitions. [2020-01-16 19:01:21,302 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1352 transitions. Word has length 22 [2020-01-16 19:01:21,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:21,302 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1352 transitions. [2020-01-16 19:01:21,302 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1352 transitions. [2020-01-16 19:01:21,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:21,303 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:21,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, 1, 1, 1] [2020-01-16 19:01:21,303 INFO L426 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:21,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:21,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1098237084, now seen corresponding path program 331 times [2020-01-16 19:01:21,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:21,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319010491] [2020-01-16 19:01:21,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:21,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-01-16 19:01:21,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319010491] [2020-01-16 19:01:21,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:21,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:21,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527427567] [2020-01-16 19:01:21,562 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:21,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:21,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:21,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:21,562 INFO L87 Difference]: Start difference. First operand 391 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:01:21,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:21,663 INFO L93 Difference]: Finished difference Result 633 states and 1871 transitions. [2020-01-16 19:01:21,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:21,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:21,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:21,665 INFO L225 Difference]: With dead ends: 633 [2020-01-16 19:01:21,665 INFO L226 Difference]: Without dead ends: 624 [2020-01-16 19:01:21,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:21,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-01-16 19:01:21,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 393. [2020-01-16 19:01:21,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:01:21,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1356 transitions. [2020-01-16 19:01:21,675 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1356 transitions. Word has length 22 [2020-01-16 19:01:21,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:21,675 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1356 transitions. [2020-01-16 19:01:21,675 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:21,675 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1356 transitions. [2020-01-16 19:01:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:21,676 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:21,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, 1, 1, 1] [2020-01-16 19:01:21,676 INFO L426 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:21,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:21,676 INFO L82 PathProgramCache]: Analyzing trace with hash 22525928, now seen corresponding path program 332 times [2020-01-16 19:01:21,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:21,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301030300] [2020-01-16 19:01:21,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:21,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301030300] [2020-01-16 19:01:21,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:21,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:21,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439585598] [2020-01-16 19:01:21,936 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:21,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:21,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:21,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:21,936 INFO L87 Difference]: Start difference. First operand 393 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:01:22,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:22,070 INFO L93 Difference]: Finished difference Result 638 states and 1880 transitions. [2020-01-16 19:01:22,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:22,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:22,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:22,072 INFO L225 Difference]: With dead ends: 638 [2020-01-16 19:01:22,072 INFO L226 Difference]: Without dead ends: 623 [2020-01-16 19:01:22,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:22,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-01-16 19:01:22,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 392. [2020-01-16 19:01:22,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:01:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1354 transitions. [2020-01-16 19:01:22,082 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1354 transitions. Word has length 22 [2020-01-16 19:01:22,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:22,082 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1354 transitions. [2020-01-16 19:01:22,082 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:22,082 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1354 transitions. [2020-01-16 19:01:22,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:22,082 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:22,082 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:22,083 INFO L426 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:22,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:22,083 INFO L82 PathProgramCache]: Analyzing trace with hash -2102638624, now seen corresponding path program 333 times [2020-01-16 19:01:22,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:22,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182926102] [2020-01-16 19:01:22,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:22,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-01-16 19:01:22,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182926102] [2020-01-16 19:01:22,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:22,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:22,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371579131] [2020-01-16 19:01:22,347 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:22,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:22,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:22,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:22,347 INFO L87 Difference]: Start difference. First operand 392 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:01:22,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:22,436 INFO L93 Difference]: Finished difference Result 632 states and 1868 transitions. [2020-01-16 19:01:22,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:22,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:22,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:22,438 INFO L225 Difference]: With dead ends: 632 [2020-01-16 19:01:22,438 INFO L226 Difference]: Without dead ends: 623 [2020-01-16 19:01:22,438 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:22,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-01-16 19:01:22,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 393. [2020-01-16 19:01:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:01:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1355 transitions. [2020-01-16 19:01:22,448 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1355 transitions. Word has length 22 [2020-01-16 19:01:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:22,448 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1355 transitions. [2020-01-16 19:01:22,448 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1355 transitions. [2020-01-16 19:01:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:22,448 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:22,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, 1, 1, 1] [2020-01-16 19:01:22,449 INFO L426 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:22,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:22,449 INFO L82 PathProgramCache]: Analyzing trace with hash 43532136, now seen corresponding path program 334 times [2020-01-16 19:01:22,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:22,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24110837] [2020-01-16 19:01:22,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:22,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-01-16 19:01:22,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24110837] [2020-01-16 19:01:22,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:22,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:22,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033787784] [2020-01-16 19:01:22,737 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:22,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:22,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:22,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:22,738 INFO L87 Difference]: Start difference. First operand 393 states and 1355 transitions. Second operand 9 states. [2020-01-16 19:01:22,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:22,875 INFO L93 Difference]: Finished difference Result 636 states and 1875 transitions. [2020-01-16 19:01:22,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:22,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:22,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:22,877 INFO L225 Difference]: With dead ends: 636 [2020-01-16 19:01:22,877 INFO L226 Difference]: Without dead ends: 622 [2020-01-16 19:01:22,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:22,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-01-16 19:01:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 392. [2020-01-16 19:01:22,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:01:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1353 transitions. [2020-01-16 19:01:22,887 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1353 transitions. Word has length 22 [2020-01-16 19:01:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:22,887 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1353 transitions. [2020-01-16 19:01:22,887 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1353 transitions. [2020-01-16 19:01:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:22,888 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:22,888 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:22,888 INFO L426 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:22,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:22,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2129310048, now seen corresponding path program 335 times [2020-01-16 19:01:22,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:22,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055670965] [2020-01-16 19:01:22,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:23,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-01-16 19:01:23,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055670965] [2020-01-16 19:01:23,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:23,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:23,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65416992] [2020-01-16 19:01:23,158 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:23,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:23,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:23,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:23,158 INFO L87 Difference]: Start difference. First operand 392 states and 1353 transitions. Second operand 9 states. [2020-01-16 19:01:23,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:23,294 INFO L93 Difference]: Finished difference Result 646 states and 1899 transitions. [2020-01-16 19:01:23,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:23,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:23,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:23,296 INFO L225 Difference]: With dead ends: 646 [2020-01-16 19:01:23,296 INFO L226 Difference]: Without dead ends: 632 [2020-01-16 19:01:23,296 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-01-16 19:01:23,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 397. [2020-01-16 19:01:23,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:01:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1362 transitions. [2020-01-16 19:01:23,305 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1362 transitions. Word has length 22 [2020-01-16 19:01:23,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:23,305 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1362 transitions. [2020-01-16 19:01:23,306 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:23,306 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1362 transitions. [2020-01-16 19:01:23,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:23,306 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:23,306 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:23,306 INFO L426 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:23,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:23,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1056224668, now seen corresponding path program 336 times [2020-01-16 19:01:23,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:23,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446711545] [2020-01-16 19:01:23,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:23,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446711545] [2020-01-16 19:01:23,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:23,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:23,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245114082] [2020-01-16 19:01:23,576 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:23,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:23,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:23,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:23,576 INFO L87 Difference]: Start difference. First operand 397 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:01:23,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:23,715 INFO L93 Difference]: Finished difference Result 645 states and 1892 transitions. [2020-01-16 19:01:23,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:23,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:23,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:23,717 INFO L225 Difference]: With dead ends: 645 [2020-01-16 19:01:23,717 INFO L226 Difference]: Without dead ends: 622 [2020-01-16 19:01:23,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:23,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-01-16 19:01:23,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 387. [2020-01-16 19:01:23,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:01:23,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1344 transitions. [2020-01-16 19:01:23,727 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1344 transitions. Word has length 22 [2020-01-16 19:01:23,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:23,727 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1344 transitions. [2020-01-16 19:01:23,727 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:23,728 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1344 transitions. [2020-01-16 19:01:23,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:23,728 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:23,728 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:23,728 INFO L426 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:23,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:23,729 INFO L82 PathProgramCache]: Analyzing trace with hash -525304394, now seen corresponding path program 337 times [2020-01-16 19:01:23,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:23,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512486487] [2020-01-16 19:01:23,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:23,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512486487] [2020-01-16 19:01:23,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:23,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:23,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337717509] [2020-01-16 19:01:23,987 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:23,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:23,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:23,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:23,988 INFO L87 Difference]: Start difference. First operand 387 states and 1344 transitions. Second operand 9 states. [2020-01-16 19:01:24,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:24,107 INFO L93 Difference]: Finished difference Result 603 states and 1802 transitions. [2020-01-16 19:01:24,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:24,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:24,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:24,109 INFO L225 Difference]: With dead ends: 603 [2020-01-16 19:01:24,109 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 19:01:24,109 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:24,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 19:01:24,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 390. [2020-01-16 19:01:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:01:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1352 transitions. [2020-01-16 19:01:24,119 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1352 transitions. Word has length 22 [2020-01-16 19:01:24,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:24,119 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1352 transitions. [2020-01-16 19:01:24,119 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:24,119 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1352 transitions. [2020-01-16 19:01:24,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:24,120 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:24,120 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:24,120 INFO L426 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:24,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:24,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1970821404, now seen corresponding path program 338 times [2020-01-16 19:01:24,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:24,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778452206] [2020-01-16 19:01:24,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:24,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-01-16 19:01:24,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778452206] [2020-01-16 19:01:24,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:24,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:24,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780257489] [2020-01-16 19:01:24,391 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:24,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:24,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:24,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:24,391 INFO L87 Difference]: Start difference. First operand 390 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:01:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:24,479 INFO L93 Difference]: Finished difference Result 601 states and 1797 transitions. [2020-01-16 19:01:24,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:24,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:24,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:24,481 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:01:24,481 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 19:01:24,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:24,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 19:01:24,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 389. [2020-01-16 19:01:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:01:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1350 transitions. [2020-01-16 19:01:24,491 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1350 transitions. Word has length 22 [2020-01-16 19:01:24,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:24,491 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1350 transitions. [2020-01-16 19:01:24,491 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1350 transitions. [2020-01-16 19:01:24,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:24,491 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:24,491 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:24,491 INFO L426 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:24,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:24,492 INFO L82 PathProgramCache]: Analyzing trace with hash 487388138, now seen corresponding path program 339 times [2020-01-16 19:01:24,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:24,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097574764] [2020-01-16 19:01:24,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:24,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097574764] [2020-01-16 19:01:24,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:24,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:24,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373944776] [2020-01-16 19:01:24,752 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:24,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:24,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:24,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:24,752 INFO L87 Difference]: Start difference. First operand 389 states and 1350 transitions. Second operand 9 states. [2020-01-16 19:01:24,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:24,867 INFO L93 Difference]: Finished difference Result 610 states and 1817 transitions. [2020-01-16 19:01:24,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:24,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:24,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:24,869 INFO L225 Difference]: With dead ends: 610 [2020-01-16 19:01:24,869 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 19:01:24,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 19:01:24,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 392. [2020-01-16 19:01:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:01:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1355 transitions. [2020-01-16 19:01:24,881 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1355 transitions. Word has length 22 [2020-01-16 19:01:24,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:24,881 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1355 transitions. [2020-01-16 19:01:24,881 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:24,881 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1355 transitions. [2020-01-16 19:01:24,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:24,882 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:24,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, 1, 1, 1] [2020-01-16 19:01:24,882 INFO L426 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:24,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:24,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1873423268, now seen corresponding path program 340 times [2020-01-16 19:01:24,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:24,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194715791] [2020-01-16 19:01:24,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:25,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-01-16 19:01:25,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194715791] [2020-01-16 19:01:25,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:25,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:25,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854627645] [2020-01-16 19:01:25,134 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:25,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:25,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:25,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:25,135 INFO L87 Difference]: Start difference. First operand 392 states and 1355 transitions. Second operand 9 states. [2020-01-16 19:01:25,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:25,270 INFO L93 Difference]: Finished difference Result 613 states and 1820 transitions. [2020-01-16 19:01:25,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:25,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:25,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:25,272 INFO L225 Difference]: With dead ends: 613 [2020-01-16 19:01:25,272 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 19:01:25,272 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 19:01:25,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 389. [2020-01-16 19:01:25,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:01:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1349 transitions. [2020-01-16 19:01:25,282 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1349 transitions. Word has length 22 [2020-01-16 19:01:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:25,282 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1349 transitions. [2020-01-16 19:01:25,282 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1349 transitions. [2020-01-16 19:01:25,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:25,283 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:25,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, 1, 1, 1] [2020-01-16 19:01:25,283 INFO L426 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:25,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:25,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1736400570, now seen corresponding path program 341 times [2020-01-16 19:01:25,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:25,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709508818] [2020-01-16 19:01:25,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:25,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-01-16 19:01:25,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709508818] [2020-01-16 19:01:25,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:25,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:25,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633572965] [2020-01-16 19:01:25,532 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:25,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:25,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:25,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:25,533 INFO L87 Difference]: Start difference. First operand 389 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:01:25,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:25,641 INFO L93 Difference]: Finished difference Result 604 states and 1802 transitions. [2020-01-16 19:01:25,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:25,641 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:25,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:25,643 INFO L225 Difference]: With dead ends: 604 [2020-01-16 19:01:25,643 INFO L226 Difference]: Without dead ends: 595 [2020-01-16 19:01:25,643 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-01-16 19:01:25,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 390. [2020-01-16 19:01:25,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:01:25,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1350 transitions. [2020-01-16 19:01:25,653 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1350 transitions. Word has length 22 [2020-01-16 19:01:25,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:25,653 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1350 transitions. [2020-01-16 19:01:25,653 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:25,653 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1350 transitions. [2020-01-16 19:01:25,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:25,654 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:25,654 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:25,654 INFO L426 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:25,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:25,654 INFO L82 PathProgramCache]: Analyzing trace with hash 660689414, now seen corresponding path program 342 times [2020-01-16 19:01:25,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:25,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26888005] [2020-01-16 19:01:25,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:25,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-01-16 19:01:25,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26888005] [2020-01-16 19:01:25,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:25,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:25,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649249421] [2020-01-16 19:01:25,898 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:25,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:25,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:25,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:25,898 INFO L87 Difference]: Start difference. First operand 390 states and 1350 transitions. Second operand 9 states. [2020-01-16 19:01:26,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:26,031 INFO L93 Difference]: Finished difference Result 609 states and 1811 transitions. [2020-01-16 19:01:26,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:26,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:26,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:26,033 INFO L225 Difference]: With dead ends: 609 [2020-01-16 19:01:26,033 INFO L226 Difference]: Without dead ends: 593 [2020-01-16 19:01:26,033 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:26,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-01-16 19:01:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 388. [2020-01-16 19:01:26,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:01:26,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1347 transitions. [2020-01-16 19:01:26,042 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1347 transitions. Word has length 22 [2020-01-16 19:01:26,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:26,043 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1347 transitions. [2020-01-16 19:01:26,043 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:26,043 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1347 transitions. [2020-01-16 19:01:26,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:26,043 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:26,043 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:26,043 INFO L426 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:26,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:26,044 INFO L82 PathProgramCache]: Analyzing trace with hash -968203534, now seen corresponding path program 343 times [2020-01-16 19:01:26,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:26,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987385479] [2020-01-16 19:01:26,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:26,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-01-16 19:01:26,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987385479] [2020-01-16 19:01:26,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:26,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:26,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951769848] [2020-01-16 19:01:26,300 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:26,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:26,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:26,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:26,301 INFO L87 Difference]: Start difference. First operand 388 states and 1347 transitions. Second operand 9 states. [2020-01-16 19:01:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:26,433 INFO L93 Difference]: Finished difference Result 602 states and 1799 transitions. [2020-01-16 19:01:26,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:26,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:26,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:26,434 INFO L225 Difference]: With dead ends: 602 [2020-01-16 19:01:26,435 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 19:01:26,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 19:01:26,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 390. [2020-01-16 19:01:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:01:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1351 transitions. [2020-01-16 19:01:26,444 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1351 transitions. Word has length 22 [2020-01-16 19:01:26,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:26,445 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1351 transitions. [2020-01-16 19:01:26,445 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:26,445 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1351 transitions. [2020-01-16 19:01:26,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:26,445 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:26,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, 1, 1, 1] [2020-01-16 19:01:26,445 INFO L426 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:26,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:26,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1881246752, now seen corresponding path program 344 times [2020-01-16 19:01:26,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:26,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641082432] [2020-01-16 19:01:26,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:26,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-01-16 19:01:26,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641082432] [2020-01-16 19:01:26,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:26,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:26,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841267846] [2020-01-16 19:01:26,705 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:26,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:26,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:26,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:26,705 INFO L87 Difference]: Start difference. First operand 390 states and 1351 transitions. Second operand 9 states. [2020-01-16 19:01:26,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:26,817 INFO L93 Difference]: Finished difference Result 600 states and 1794 transitions. [2020-01-16 19:01:26,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:26,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:26,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:26,818 INFO L225 Difference]: With dead ends: 600 [2020-01-16 19:01:26,819 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 19:01:26,819 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:26,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 19:01:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 389. [2020-01-16 19:01:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:01:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1349 transitions. [2020-01-16 19:01:26,828 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1349 transitions. Word has length 22 [2020-01-16 19:01:26,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:26,828 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1349 transitions. [2020-01-16 19:01:26,828 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:26,829 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1349 transitions. [2020-01-16 19:01:26,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:26,829 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:26,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, 1, 1, 1] [2020-01-16 19:01:26,829 INFO L426 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:26,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:26,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1138580586, now seen corresponding path program 345 times [2020-01-16 19:01:26,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:26,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20600980] [2020-01-16 19:01:26,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:27,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20600980] [2020-01-16 19:01:27,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:27,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:27,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227904199] [2020-01-16 19:01:27,083 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:27,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:27,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:27,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:27,084 INFO L87 Difference]: Start difference. First operand 389 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:01:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:27,220 INFO L93 Difference]: Finished difference Result 608 states and 1812 transitions. [2020-01-16 19:01:27,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:27,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:27,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:27,222 INFO L225 Difference]: With dead ends: 608 [2020-01-16 19:01:27,222 INFO L226 Difference]: Without dead ends: 597 [2020-01-16 19:01:27,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-01-16 19:01:27,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 392. [2020-01-16 19:01:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:01:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1354 transitions. [2020-01-16 19:01:27,232 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1354 transitions. Word has length 22 [2020-01-16 19:01:27,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:27,232 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1354 transitions. [2020-01-16 19:01:27,232 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:27,232 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1354 transitions. [2020-01-16 19:01:27,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:27,233 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:27,233 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:27,233 INFO L426 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:27,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:27,233 INFO L82 PathProgramCache]: Analyzing trace with hash 356581344, now seen corresponding path program 346 times [2020-01-16 19:01:27,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:27,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566985306] [2020-01-16 19:01:27,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:27,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-01-16 19:01:27,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566985306] [2020-01-16 19:01:27,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:27,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:27,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361020695] [2020-01-16 19:01:27,488 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:27,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:27,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:27,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:27,489 INFO L87 Difference]: Start difference. First operand 392 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:01:27,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:27,624 INFO L93 Difference]: Finished difference Result 610 states and 1813 transitions. [2020-01-16 19:01:27,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:27,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:27,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:27,625 INFO L225 Difference]: With dead ends: 610 [2020-01-16 19:01:27,626 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:01:27,626 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:01:27,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 389. [2020-01-16 19:01:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:01:27,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1348 transitions. [2020-01-16 19:01:27,635 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1348 transitions. Word has length 22 [2020-01-16 19:01:27,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:27,635 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1348 transitions. [2020-01-16 19:01:27,635 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1348 transitions. [2020-01-16 19:01:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:27,636 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:27,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, 1, 1, 1] [2020-01-16 19:01:27,636 INFO L426 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:27,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:27,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1907374278, now seen corresponding path program 347 times [2020-01-16 19:01:27,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:27,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119804241] [2020-01-16 19:01:27,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:27,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-01-16 19:01:27,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119804241] [2020-01-16 19:01:27,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:27,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:27,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218790469] [2020-01-16 19:01:27,892 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:27,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:27,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:27,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:27,893 INFO L87 Difference]: Start difference. First operand 389 states and 1348 transitions. Second operand 9 states. [2020-01-16 19:01:28,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:28,002 INFO L93 Difference]: Finished difference Result 602 states and 1797 transitions. [2020-01-16 19:01:28,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:28,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:28,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:28,004 INFO L225 Difference]: With dead ends: 602 [2020-01-16 19:01:28,004 INFO L226 Difference]: Without dead ends: 593 [2020-01-16 19:01:28,005 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:28,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-01-16 19:01:28,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 390. [2020-01-16 19:01:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:01:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1349 transitions. [2020-01-16 19:01:28,014 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1349 transitions. Word has length 22 [2020-01-16 19:01:28,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:28,014 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1349 transitions. [2020-01-16 19:01:28,014 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:28,014 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1349 transitions. [2020-01-16 19:01:28,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:28,014 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:28,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, 1, 1, 1] [2020-01-16 19:01:28,015 INFO L426 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:28,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:28,015 INFO L82 PathProgramCache]: Analyzing trace with hash 238796482, now seen corresponding path program 348 times [2020-01-16 19:01:28,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:28,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246083892] [2020-01-16 19:01:28,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:28,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-01-16 19:01:28,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246083892] [2020-01-16 19:01:28,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:28,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:28,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356418627] [2020-01-16 19:01:28,278 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:28,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:28,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:28,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:28,278 INFO L87 Difference]: Start difference. First operand 390 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:01:28,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:28,412 INFO L93 Difference]: Finished difference Result 606 states and 1804 transitions. [2020-01-16 19:01:28,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:28,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:28,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:28,414 INFO L225 Difference]: With dead ends: 606 [2020-01-16 19:01:28,414 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 19:01:28,414 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:28,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 19:01:28,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 388. [2020-01-16 19:01:28,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:01:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1346 transitions. [2020-01-16 19:01:28,423 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1346 transitions. Word has length 22 [2020-01-16 19:01:28,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:28,424 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1346 transitions. [2020-01-16 19:01:28,424 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:28,424 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1346 transitions. [2020-01-16 19:01:28,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:28,424 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:28,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, 1, 1, 1] [2020-01-16 19:01:28,424 INFO L426 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:28,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:28,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1373186418, now seen corresponding path program 349 times [2020-01-16 19:01:28,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:28,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636610075] [2020-01-16 19:01:28,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:28,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-01-16 19:01:28,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636610075] [2020-01-16 19:01:28,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:28,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:28,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831135907] [2020-01-16 19:01:28,676 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:28,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:28,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:28,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:28,676 INFO L87 Difference]: Start difference. First operand 388 states and 1346 transitions. Second operand 9 states. [2020-01-16 19:01:28,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:28,791 INFO L93 Difference]: Finished difference Result 622 states and 1850 transitions. [2020-01-16 19:01:28,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:28,791 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:28,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:28,792 INFO L225 Difference]: With dead ends: 622 [2020-01-16 19:01:28,793 INFO L226 Difference]: Without dead ends: 611 [2020-01-16 19:01:28,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:28,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-01-16 19:01:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 394. [2020-01-16 19:01:28,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:01:28,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1362 transitions. [2020-01-16 19:01:28,801 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1362 transitions. Word has length 22 [2020-01-16 19:01:28,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:28,802 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1362 transitions. [2020-01-16 19:01:28,802 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:28,802 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1362 transitions. [2020-01-16 19:01:28,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:28,802 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:28,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, 1, 1, 1] [2020-01-16 19:01:28,802 INFO L426 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:28,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:28,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1535745748, now seen corresponding path program 350 times [2020-01-16 19:01:28,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:28,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488375811] [2020-01-16 19:01:28,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:29,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-01-16 19:01:29,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488375811] [2020-01-16 19:01:29,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:29,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:29,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577481420] [2020-01-16 19:01:29,053 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:29,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:29,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:29,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:29,053 INFO L87 Difference]: Start difference. First operand 394 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:01:29,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:29,183 INFO L93 Difference]: Finished difference Result 625 states and 1853 transitions. [2020-01-16 19:01:29,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:29,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:29,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:29,185 INFO L225 Difference]: With dead ends: 625 [2020-01-16 19:01:29,185 INFO L226 Difference]: Without dead ends: 608 [2020-01-16 19:01:29,185 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:29,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-01-16 19:01:29,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 391. [2020-01-16 19:01:29,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:01:29,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1354 transitions. [2020-01-16 19:01:29,194 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1354 transitions. Word has length 22 [2020-01-16 19:01:29,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:29,194 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1354 transitions. [2020-01-16 19:01:29,194 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1354 transitions. [2020-01-16 19:01:29,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:29,195 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:29,195 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:29,195 INFO L426 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:29,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:29,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1827689290, now seen corresponding path program 351 times [2020-01-16 19:01:29,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:29,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639818336] [2020-01-16 19:01:29,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:29,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-01-16 19:01:29,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639818336] [2020-01-16 19:01:29,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:29,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:29,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332591433] [2020-01-16 19:01:29,448 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:29,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:29,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:29,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:29,449 INFO L87 Difference]: Start difference. First operand 391 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:01:29,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:29,612 INFO L93 Difference]: Finished difference Result 621 states and 1845 transitions. [2020-01-16 19:01:29,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:29,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:29,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:29,614 INFO L225 Difference]: With dead ends: 621 [2020-01-16 19:01:29,614 INFO L226 Difference]: Without dead ends: 610 [2020-01-16 19:01:29,614 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:29,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-01-16 19:01:29,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 394. [2020-01-16 19:01:29,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:01:29,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1359 transitions. [2020-01-16 19:01:29,622 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1359 transitions. Word has length 22 [2020-01-16 19:01:29,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:29,623 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1359 transitions. [2020-01-16 19:01:29,623 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:29,623 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1359 transitions. [2020-01-16 19:01:29,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:29,623 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:29,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, 1, 1, 1] [2020-01-16 19:01:29,623 INFO L426 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:29,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:29,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1685278764, now seen corresponding path program 352 times [2020-01-16 19:01:29,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:29,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129455912] [2020-01-16 19:01:29,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:29,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-01-16 19:01:29,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129455912] [2020-01-16 19:01:29,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:29,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:29,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931368580] [2020-01-16 19:01:29,869 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:29,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:29,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:29,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:29,869 INFO L87 Difference]: Start difference. First operand 394 states and 1359 transitions. Second operand 9 states. [2020-01-16 19:01:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:29,983 INFO L93 Difference]: Finished difference Result 623 states and 1846 transitions. [2020-01-16 19:01:29,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:29,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:29,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:29,985 INFO L225 Difference]: With dead ends: 623 [2020-01-16 19:01:29,985 INFO L226 Difference]: Without dead ends: 607 [2020-01-16 19:01:29,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:29,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-01-16 19:01:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 391. [2020-01-16 19:01:29,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:01:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1351 transitions. [2020-01-16 19:01:29,995 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1351 transitions. Word has length 22 [2020-01-16 19:01:29,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:29,995 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1351 transitions. [2020-01-16 19:01:29,995 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:29,995 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1351 transitions. [2020-01-16 19:01:29,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:29,996 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:29,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, 1, 1, 1] [2020-01-16 19:01:29,996 INFO L426 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:29,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:29,996 INFO L82 PathProgramCache]: Analyzing trace with hash -7918474, now seen corresponding path program 353 times [2020-01-16 19:01:29,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:29,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886159530] [2020-01-16 19:01:29,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:30,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:30,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886159530] [2020-01-16 19:01:30,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:30,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:30,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117011172] [2020-01-16 19:01:30,256 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:30,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:30,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:30,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:30,256 INFO L87 Difference]: Start difference. First operand 391 states and 1351 transitions. Second operand 9 states. [2020-01-16 19:01:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:30,392 INFO L93 Difference]: Finished difference Result 629 states and 1860 transitions. [2020-01-16 19:01:30,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:30,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:30,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:30,394 INFO L225 Difference]: With dead ends: 629 [2020-01-16 19:01:30,394 INFO L226 Difference]: Without dead ends: 615 [2020-01-16 19:01:30,394 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:30,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-01-16 19:01:30,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 396. [2020-01-16 19:01:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:01:30,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1360 transitions. [2020-01-16 19:01:30,403 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1360 transitions. Word has length 22 [2020-01-16 19:01:30,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:30,404 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1360 transitions. [2020-01-16 19:01:30,404 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:30,404 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1360 transitions. [2020-01-16 19:01:30,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:30,404 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:30,404 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:30,404 INFO L426 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:30,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:30,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1702694834, now seen corresponding path program 354 times [2020-01-16 19:01:30,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:30,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811860742] [2020-01-16 19:01:30,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:30,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811860742] [2020-01-16 19:01:30,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:30,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:30,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581689282] [2020-01-16 19:01:30,663 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:30,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:30,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:30,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:30,664 INFO L87 Difference]: Start difference. First operand 396 states and 1360 transitions. Second operand 9 states. [2020-01-16 19:01:30,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:30,781 INFO L93 Difference]: Finished difference Result 628 states and 1853 transitions. [2020-01-16 19:01:30,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:30,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:30,783 INFO L225 Difference]: With dead ends: 628 [2020-01-16 19:01:30,783 INFO L226 Difference]: Without dead ends: 607 [2020-01-16 19:01:30,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:30,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-01-16 19:01:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 388. [2020-01-16 19:01:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:01:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1345 transitions. [2020-01-16 19:01:30,792 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1345 transitions. Word has length 22 [2020-01-16 19:01:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:30,792 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1345 transitions. [2020-01-16 19:01:30,792 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:30,792 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1345 transitions. [2020-01-16 19:01:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:30,793 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:30,793 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:30,793 INFO L426 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:30,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:30,793 INFO L82 PathProgramCache]: Analyzing trace with hash 253265632, now seen corresponding path program 355 times [2020-01-16 19:01:30,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:30,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367668790] [2020-01-16 19:01:30,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:31,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-01-16 19:01:31,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367668790] [2020-01-16 19:01:31,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:31,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:31,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444446387] [2020-01-16 19:01:31,039 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:31,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:31,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:31,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:31,039 INFO L87 Difference]: Start difference. First operand 388 states and 1345 transitions. Second operand 9 states. [2020-01-16 19:01:31,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:31,147 INFO L93 Difference]: Finished difference Result 608 states and 1811 transitions. [2020-01-16 19:01:31,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:31,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:31,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:31,148 INFO L225 Difference]: With dead ends: 608 [2020-01-16 19:01:31,149 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 19:01:31,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 19:01:31,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 390. [2020-01-16 19:01:31,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:01:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1349 transitions. [2020-01-16 19:01:31,158 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1349 transitions. Word has length 22 [2020-01-16 19:01:31,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:31,159 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1349 transitions. [2020-01-16 19:01:31,159 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:31,159 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1349 transitions. [2020-01-16 19:01:31,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:31,159 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:31,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, 1, 1, 1] [2020-01-16 19:01:31,159 INFO L426 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:31,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:31,160 INFO L82 PathProgramCache]: Analyzing trace with hash -822445524, now seen corresponding path program 356 times [2020-01-16 19:01:31,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:31,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644332750] [2020-01-16 19:01:31,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:31,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-01-16 19:01:31,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644332750] [2020-01-16 19:01:31,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:31,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:31,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895914281] [2020-01-16 19:01:31,402 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:31,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:31,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:31,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:31,402 INFO L87 Difference]: Start difference. First operand 390 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:01:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:31,507 INFO L93 Difference]: Finished difference Result 613 states and 1820 transitions. [2020-01-16 19:01:31,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:31,508 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:31,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:31,509 INFO L225 Difference]: With dead ends: 613 [2020-01-16 19:01:31,509 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:01:31,509 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:31,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:01:31,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 389. [2020-01-16 19:01:31,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:01:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1347 transitions. [2020-01-16 19:01:31,518 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1347 transitions. Word has length 22 [2020-01-16 19:01:31,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:31,518 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1347 transitions. [2020-01-16 19:01:31,519 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:31,519 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1347 transitions. [2020-01-16 19:01:31,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:31,519 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:31,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, 1, 1, 1] [2020-01-16 19:01:31,519 INFO L426 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:31,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:31,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1347357220, now seen corresponding path program 357 times [2020-01-16 19:01:31,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:31,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671770374] [2020-01-16 19:01:31,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:31,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671770374] [2020-01-16 19:01:31,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:31,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:31,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958876903] [2020-01-16 19:01:31,776 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:31,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:31,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:31,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:31,776 INFO L87 Difference]: Start difference. First operand 389 states and 1347 transitions. Second operand 9 states. [2020-01-16 19:01:31,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:31,883 INFO L93 Difference]: Finished difference Result 607 states and 1808 transitions. [2020-01-16 19:01:31,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:31,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:31,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:31,885 INFO L225 Difference]: With dead ends: 607 [2020-01-16 19:01:31,885 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:01:31,886 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:31,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:01:31,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 390. [2020-01-16 19:01:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:01:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1348 transitions. [2020-01-16 19:01:31,904 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1348 transitions. Word has length 22 [2020-01-16 19:01:31,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:31,904 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1348 transitions. [2020-01-16 19:01:31,904 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:31,905 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1348 transitions. [2020-01-16 19:01:31,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:31,905 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:31,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, 1, 1, 1] [2020-01-16 19:01:31,905 INFO L426 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:31,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:31,906 INFO L82 PathProgramCache]: Analyzing trace with hash -801439316, now seen corresponding path program 358 times [2020-01-16 19:01:31,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:31,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470991283] [2020-01-16 19:01:31,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:32,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:32,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470991283] [2020-01-16 19:01:32,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:32,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:32,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256618313] [2020-01-16 19:01:32,155 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:32,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:32,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:32,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:32,155 INFO L87 Difference]: Start difference. First operand 390 states and 1348 transitions. Second operand 9 states. [2020-01-16 19:01:32,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:32,265 INFO L93 Difference]: Finished difference Result 611 states and 1815 transitions. [2020-01-16 19:01:32,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:32,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:32,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:32,267 INFO L225 Difference]: With dead ends: 611 [2020-01-16 19:01:32,267 INFO L226 Difference]: Without dead ends: 597 [2020-01-16 19:01:32,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:32,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-01-16 19:01:32,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 389. [2020-01-16 19:01:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:01:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1346 transitions. [2020-01-16 19:01:32,276 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1346 transitions. Word has length 22 [2020-01-16 19:01:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:32,277 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1346 transitions. [2020-01-16 19:01:32,277 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:32,277 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1346 transitions. [2020-01-16 19:01:32,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:32,277 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:32,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, 1, 1, 1] [2020-01-16 19:01:32,277 INFO L426 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:32,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:32,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1284338596, now seen corresponding path program 359 times [2020-01-16 19:01:32,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:32,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372656193] [2020-01-16 19:01:32,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:32,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-01-16 19:01:32,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372656193] [2020-01-16 19:01:32,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:32,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:32,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053970334] [2020-01-16 19:01:32,526 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:32,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:32,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:32,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:32,526 INFO L87 Difference]: Start difference. First operand 389 states and 1346 transitions. Second operand 9 states. [2020-01-16 19:01:32,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:32,623 INFO L93 Difference]: Finished difference Result 621 states and 1839 transitions. [2020-01-16 19:01:32,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:32,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:32,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:32,625 INFO L225 Difference]: With dead ends: 621 [2020-01-16 19:01:32,625 INFO L226 Difference]: Without dead ends: 607 [2020-01-16 19:01:32,625 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:32,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-01-16 19:01:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 394. [2020-01-16 19:01:32,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:01:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1355 transitions. [2020-01-16 19:01:32,634 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1355 transitions. Word has length 22 [2020-01-16 19:01:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:32,635 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1355 transitions. [2020-01-16 19:01:32,635 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1355 transitions. [2020-01-16 19:01:32,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:32,635 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:32,635 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:32,635 INFO L426 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:32,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:32,636 INFO L82 PathProgramCache]: Analyzing trace with hash 211253216, now seen corresponding path program 360 times [2020-01-16 19:01:32,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:32,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604922132] [2020-01-16 19:01:32,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:32,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604922132] [2020-01-16 19:01:32,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:32,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:32,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133320952] [2020-01-16 19:01:32,892 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:32,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:32,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:32,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:32,893 INFO L87 Difference]: Start difference. First operand 394 states and 1355 transitions. Second operand 9 states. [2020-01-16 19:01:32,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:32,994 INFO L93 Difference]: Finished difference Result 620 states and 1832 transitions. [2020-01-16 19:01:32,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:32,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:32,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:32,996 INFO L225 Difference]: With dead ends: 620 [2020-01-16 19:01:32,996 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 19:01:32,997 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 19:01:33,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 383. [2020-01-16 19:01:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:01:33,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1336 transitions. [2020-01-16 19:01:33,005 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1336 transitions. Word has length 22 [2020-01-16 19:01:33,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:33,006 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1336 transitions. [2020-01-16 19:01:33,006 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:33,006 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1336 transitions. [2020-01-16 19:01:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:33,006 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:33,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, 1, 1, 1] [2020-01-16 19:01:33,006 INFO L426 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:33,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:33,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1339285254, now seen corresponding path program 361 times [2020-01-16 19:01:33,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:33,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595631725] [2020-01-16 19:01:33,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:33,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-01-16 19:01:33,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595631725] [2020-01-16 19:01:33,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:33,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:33,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230014548] [2020-01-16 19:01:33,285 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:33,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:33,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:33,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:33,286 INFO L87 Difference]: Start difference. First operand 383 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:01:33,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:33,361 INFO L93 Difference]: Finished difference Result 666 states and 1990 transitions. [2020-01-16 19:01:33,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:33,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:33,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:33,363 INFO L225 Difference]: With dead ends: 666 [2020-01-16 19:01:33,363 INFO L226 Difference]: Without dead ends: 650 [2020-01-16 19:01:33,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-01-16 19:01:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 399. [2020-01-16 19:01:33,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:01:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1391 transitions. [2020-01-16 19:01:33,373 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1391 transitions. Word has length 22 [2020-01-16 19:01:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:33,373 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1391 transitions. [2020-01-16 19:01:33,373 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:33,373 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1391 transitions. [2020-01-16 19:01:33,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:33,374 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:33,374 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:33,374 INFO L426 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:33,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:33,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1365416156, now seen corresponding path program 362 times [2020-01-16 19:01:33,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:33,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343229885] [2020-01-16 19:01:33,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:33,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-01-16 19:01:33,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343229885] [2020-01-16 19:01:33,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:33,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:33,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723133247] [2020-01-16 19:01:33,647 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:33,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:33,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:33,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:33,648 INFO L87 Difference]: Start difference. First operand 399 states and 1391 transitions. Second operand 9 states. [2020-01-16 19:01:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:33,747 INFO L93 Difference]: Finished difference Result 661 states and 1977 transitions. [2020-01-16 19:01:33,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:33,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:33,748 INFO L225 Difference]: With dead ends: 661 [2020-01-16 19:01:33,749 INFO L226 Difference]: Without dead ends: 646 [2020-01-16 19:01:33,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-01-16 19:01:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 395. [2020-01-16 19:01:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:01:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1382 transitions. [2020-01-16 19:01:33,758 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1382 transitions. Word has length 22 [2020-01-16 19:01:33,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:33,758 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1382 transitions. [2020-01-16 19:01:33,758 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:33,758 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1382 transitions. [2020-01-16 19:01:33,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:33,759 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:33,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, 1, 1, 1] [2020-01-16 19:01:33,759 INFO L426 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:33,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:33,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1440197426, now seen corresponding path program 363 times [2020-01-16 19:01:33,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:33,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053946504] [2020-01-16 19:01:33,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:34,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-01-16 19:01:34,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053946504] [2020-01-16 19:01:34,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:34,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:34,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540317036] [2020-01-16 19:01:34,038 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:34,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:34,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:34,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:34,038 INFO L87 Difference]: Start difference. First operand 395 states and 1382 transitions. Second operand 9 states. [2020-01-16 19:01:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:34,118 INFO L93 Difference]: Finished difference Result 664 states and 1982 transitions. [2020-01-16 19:01:34,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:34,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:34,120 INFO L225 Difference]: With dead ends: 664 [2020-01-16 19:01:34,120 INFO L226 Difference]: Without dead ends: 648 [2020-01-16 19:01:34,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:34,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-01-16 19:01:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 398. [2020-01-16 19:01:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 19:01:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1386 transitions. [2020-01-16 19:01:34,130 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1386 transitions. Word has length 22 [2020-01-16 19:01:34,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:34,130 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1386 transitions. [2020-01-16 19:01:34,131 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1386 transitions. [2020-01-16 19:01:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:34,131 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:34,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, 1, 1, 1] [2020-01-16 19:01:34,131 INFO L426 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:34,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:34,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1566833800, now seen corresponding path program 364 times [2020-01-16 19:01:34,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:34,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630698065] [2020-01-16 19:01:34,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:34,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630698065] [2020-01-16 19:01:34,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:34,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:34,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705008992] [2020-01-16 19:01:34,410 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:34,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:34,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:34,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:34,410 INFO L87 Difference]: Start difference. First operand 398 states and 1386 transitions. Second operand 9 states. [2020-01-16 19:01:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:34,514 INFO L93 Difference]: Finished difference Result 658 states and 1968 transitions. [2020-01-16 19:01:34,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:34,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:34,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:34,516 INFO L225 Difference]: With dead ends: 658 [2020-01-16 19:01:34,516 INFO L226 Difference]: Without dead ends: 645 [2020-01-16 19:01:34,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:34,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-01-16 19:01:34,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 395. [2020-01-16 19:01:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:01:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1379 transitions. [2020-01-16 19:01:34,525 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1379 transitions. Word has length 22 [2020-01-16 19:01:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:34,525 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1379 transitions. [2020-01-16 19:01:34,525 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:34,525 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1379 transitions. [2020-01-16 19:01:34,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:34,526 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:34,526 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:34,526 INFO L426 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:34,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:34,526 INFO L82 PathProgramCache]: Analyzing trace with hash -848184368, now seen corresponding path program 365 times [2020-01-16 19:01:34,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:34,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008388955] [2020-01-16 19:01:34,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:34,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-01-16 19:01:34,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008388955] [2020-01-16 19:01:34,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:34,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:34,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050149810] [2020-01-16 19:01:34,799 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:34,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:34,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:34,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:34,799 INFO L87 Difference]: Start difference. First operand 395 states and 1379 transitions. Second operand 9 states. [2020-01-16 19:01:34,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:34,898 INFO L93 Difference]: Finished difference Result 653 states and 1959 transitions. [2020-01-16 19:01:34,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:34,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:34,900 INFO L225 Difference]: With dead ends: 653 [2020-01-16 19:01:34,900 INFO L226 Difference]: Without dead ends: 642 [2020-01-16 19:01:34,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:34,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-01-16 19:01:34,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 397. [2020-01-16 19:01:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:01:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1382 transitions. [2020-01-16 19:01:34,910 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1382 transitions. Word has length 22 [2020-01-16 19:01:34,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:34,911 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1382 transitions. [2020-01-16 19:01:34,911 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1382 transitions. [2020-01-16 19:01:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:34,911 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:34,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:34,911 INFO L426 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:34,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:34,912 INFO L82 PathProgramCache]: Analyzing trace with hash 493748420, now seen corresponding path program 366 times [2020-01-16 19:01:34,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:34,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785985913] [2020-01-16 19:01:34,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:35,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-01-16 19:01:35,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785985913] [2020-01-16 19:01:35,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:35,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:35,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548511583] [2020-01-16 19:01:35,191 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:35,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:35,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:35,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:35,191 INFO L87 Difference]: Start difference. First operand 397 states and 1382 transitions. Second operand 9 states. [2020-01-16 19:01:35,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:35,291 INFO L93 Difference]: Finished difference Result 652 states and 1955 transitions. [2020-01-16 19:01:35,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:35,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:35,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:35,293 INFO L225 Difference]: With dead ends: 652 [2020-01-16 19:01:35,293 INFO L226 Difference]: Without dead ends: 637 [2020-01-16 19:01:35,293 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:35,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-01-16 19:01:35,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 392. [2020-01-16 19:01:35,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:01:35,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1372 transitions. [2020-01-16 19:01:35,303 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1372 transitions. Word has length 22 [2020-01-16 19:01:35,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:35,303 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1372 transitions. [2020-01-16 19:01:35,303 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1372 transitions. [2020-01-16 19:01:35,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:35,304 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:35,304 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:35,304 INFO L426 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:35,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:35,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1718040, now seen corresponding path program 367 times [2020-01-16 19:01:35,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:35,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537769132] [2020-01-16 19:01:35,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:35,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537769132] [2020-01-16 19:01:35,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:35,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:35,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13273272] [2020-01-16 19:01:35,585 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:35,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:35,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:35,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:35,586 INFO L87 Difference]: Start difference. First operand 392 states and 1372 transitions. Second operand 9 states. [2020-01-16 19:01:35,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:35,659 INFO L93 Difference]: Finished difference Result 678 states and 2017 transitions. [2020-01-16 19:01:35,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:35,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:35,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:35,661 INFO L225 Difference]: With dead ends: 678 [2020-01-16 19:01:35,661 INFO L226 Difference]: Without dead ends: 662 [2020-01-16 19:01:35,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:35,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-01-16 19:01:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 401. [2020-01-16 19:01:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-01-16 19:01:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1394 transitions. [2020-01-16 19:01:35,670 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1394 transitions. Word has length 22 [2020-01-16 19:01:35,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:35,671 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 1394 transitions. [2020-01-16 19:01:35,671 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1394 transitions. [2020-01-16 19:01:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:35,671 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01: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, 1, 1, 1] [2020-01-16 19:01:35,671 INFO L426 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:35,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:35,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1591983926, now seen corresponding path program 368 times [2020-01-16 19:01:35,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:35,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821613954] [2020-01-16 19:01:35,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:35,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-01-16 19:01:35,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821613954] [2020-01-16 19:01:35,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:35,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:35,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480018189] [2020-01-16 19:01:35,960 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:35,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:35,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:35,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:35,960 INFO L87 Difference]: Start difference. First operand 401 states and 1394 transitions. Second operand 9 states. [2020-01-16 19:01:36,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:36,064 INFO L93 Difference]: Finished difference Result 673 states and 2004 transitions. [2020-01-16 19:01:36,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:36,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:36,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:36,066 INFO L225 Difference]: With dead ends: 673 [2020-01-16 19:01:36,066 INFO L226 Difference]: Without dead ends: 658 [2020-01-16 19:01:36,067 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-01-16 19:01:36,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 397. [2020-01-16 19:01:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:01:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1384 transitions. [2020-01-16 19:01:36,076 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1384 transitions. Word has length 22 [2020-01-16 19:01:36,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:36,077 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1384 transitions. [2020-01-16 19:01:36,077 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:36,077 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1384 transitions. [2020-01-16 19:01:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:36,077 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:36,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, 1, 1, 1] [2020-01-16 19:01:36,077 INFO L426 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:36,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:36,078 INFO L82 PathProgramCache]: Analyzing trace with hash 266768904, now seen corresponding path program 369 times [2020-01-16 19:01:36,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:36,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236942077] [2020-01-16 19:01:36,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:36,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-01-16 19:01:36,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236942077] [2020-01-16 19:01:36,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:36,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:36,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427643865] [2020-01-16 19:01:36,373 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:36,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:36,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:36,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:36,374 INFO L87 Difference]: Start difference. First operand 397 states and 1384 transitions. Second operand 9 states. [2020-01-16 19:01:36,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:36,448 INFO L93 Difference]: Finished difference Result 685 states and 2029 transitions. [2020-01-16 19:01:36,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:36,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:36,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:36,450 INFO L225 Difference]: With dead ends: 685 [2020-01-16 19:01:36,450 INFO L226 Difference]: Without dead ends: 669 [2020-01-16 19:01:36,450 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2020-01-16 19:01:36,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 405. [2020-01-16 19:01:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-01-16 19:01:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1397 transitions. [2020-01-16 19:01:36,460 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1397 transitions. Word has length 22 [2020-01-16 19:01:36,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:36,460 INFO L478 AbstractCegarLoop]: Abstraction has 405 states and 1397 transitions. [2020-01-16 19:01:36,460 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1397 transitions. [2020-01-16 19:01:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:36,461 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:36,461 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:36,461 INFO L426 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:36,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:36,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1230802646, now seen corresponding path program 370 times [2020-01-16 19:01:36,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:36,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844459171] [2020-01-16 19:01:36,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:36,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-01-16 19:01:36,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844459171] [2020-01-16 19:01:36,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:36,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:36,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195772333] [2020-01-16 19:01:36,741 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:36,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:36,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:36,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:36,742 INFO L87 Difference]: Start difference. First operand 405 states and 1397 transitions. Second operand 9 states. [2020-01-16 19:01:36,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:36,842 INFO L93 Difference]: Finished difference Result 683 states and 2019 transitions. [2020-01-16 19:01:36,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:36,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:36,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:36,844 INFO L225 Difference]: With dead ends: 683 [2020-01-16 19:01:36,844 INFO L226 Difference]: Without dead ends: 661 [2020-01-16 19:01:36,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:36,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2020-01-16 19:01:36,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 397. [2020-01-16 19:01:36,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:01:36,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1379 transitions. [2020-01-16 19:01:36,853 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1379 transitions. Word has length 22 [2020-01-16 19:01:36,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:36,853 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1379 transitions. [2020-01-16 19:01:36,853 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:36,853 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1379 transitions. [2020-01-16 19:01:36,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:36,854 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:36,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, 1, 1, 1] [2020-01-16 19:01:36,854 INFO L426 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:36,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:36,854 INFO L82 PathProgramCache]: Analyzing trace with hash -948527510, now seen corresponding path program 371 times [2020-01-16 19:01:36,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:36,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878364614] [2020-01-16 19:01:36,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:37,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-01-16 19:01:37,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878364614] [2020-01-16 19:01:37,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:37,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:37,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998218097] [2020-01-16 19:01:37,124 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:37,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:37,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:37,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:37,125 INFO L87 Difference]: Start difference. First operand 397 states and 1379 transitions. Second operand 9 states. [2020-01-16 19:01:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:37,220 INFO L93 Difference]: Finished difference Result 670 states and 1994 transitions. [2020-01-16 19:01:37,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:37,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:37,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:37,222 INFO L225 Difference]: With dead ends: 670 [2020-01-16 19:01:37,223 INFO L226 Difference]: Without dead ends: 659 [2020-01-16 19:01:37,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:37,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2020-01-16 19:01:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 400. [2020-01-16 19:01:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-01-16 19:01:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1384 transitions. [2020-01-16 19:01:37,232 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1384 transitions. Word has length 22 [2020-01-16 19:01:37,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:37,232 INFO L478 AbstractCegarLoop]: Abstraction has 400 states and 1384 transitions. [2020-01-16 19:01:37,232 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1384 transitions. [2020-01-16 19:01:37,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:37,233 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:37,233 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:37,233 INFO L426 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:37,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:37,233 INFO L82 PathProgramCache]: Analyzing trace with hash -930093484, now seen corresponding path program 372 times [2020-01-16 19:01:37,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:37,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666075132] [2020-01-16 19:01:37,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:37,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666075132] [2020-01-16 19:01:37,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:37,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:37,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730807939] [2020-01-16 19:01:37,497 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:37,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:37,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:37,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:37,498 INFO L87 Difference]: Start difference. First operand 400 states and 1384 transitions. Second operand 9 states. [2020-01-16 19:01:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:37,601 INFO L93 Difference]: Finished difference Result 673 states and 1997 transitions. [2020-01-16 19:01:37,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:37,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:37,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:37,603 INFO L225 Difference]: With dead ends: 673 [2020-01-16 19:01:37,603 INFO L226 Difference]: Without dead ends: 651 [2020-01-16 19:01:37,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:37,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2020-01-16 19:01:37,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 392. [2020-01-16 19:01:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:01:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1368 transitions. [2020-01-16 19:01:37,614 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1368 transitions. Word has length 22 [2020-01-16 19:01:37,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:37,614 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1368 transitions. [2020-01-16 19:01:37,614 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1368 transitions. [2020-01-16 19:01:37,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:37,614 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:37,614 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:37,615 INFO L426 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:37,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:37,615 INFO L82 PathProgramCache]: Analyzing trace with hash 938605096, now seen corresponding path program 373 times [2020-01-16 19:01:37,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:37,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79864830] [2020-01-16 19:01:37,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:37,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-01-16 19:01:37,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79864830] [2020-01-16 19:01:37,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:37,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:37,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180999947] [2020-01-16 19:01:37,896 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:37,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:37,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:37,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:37,896 INFO L87 Difference]: Start difference. First operand 392 states and 1368 transitions. Second operand 9 states. [2020-01-16 19:01:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:37,964 INFO L93 Difference]: Finished difference Result 672 states and 1996 transitions. [2020-01-16 19:01:37,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:37,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:37,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:37,966 INFO L225 Difference]: With dead ends: 672 [2020-01-16 19:01:37,966 INFO L226 Difference]: Without dead ends: 656 [2020-01-16 19:01:37,966 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:37,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-01-16 19:01:37,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 399. [2020-01-16 19:01:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:01:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1384 transitions. [2020-01-16 19:01:37,976 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1384 transitions. Word has length 22 [2020-01-16 19:01:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:37,977 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1384 transitions. [2020-01-16 19:01:37,977 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1384 transitions. [2020-01-16 19:01:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:37,977 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:37,977 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:37,977 INFO L426 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:37,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:37,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1065241470, now seen corresponding path program 374 times [2020-01-16 19:01:37,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:37,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340635704] [2020-01-16 19:01:37,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:38,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340635704] [2020-01-16 19:01:38,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:38,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:38,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002251529] [2020-01-16 19:01:38,258 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:38,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:38,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:38,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:38,259 INFO L87 Difference]: Start difference. First operand 399 states and 1384 transitions. Second operand 9 states. [2020-01-16 19:01:38,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:38,352 INFO L93 Difference]: Finished difference Result 666 states and 1982 transitions. [2020-01-16 19:01:38,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:38,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:38,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:38,354 INFO L225 Difference]: With dead ends: 666 [2020-01-16 19:01:38,354 INFO L226 Difference]: Without dead ends: 653 [2020-01-16 19:01:38,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:38,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-01-16 19:01:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 396. [2020-01-16 19:01:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:01:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1377 transitions. [2020-01-16 19:01:38,362 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1377 transitions. Word has length 22 [2020-01-16 19:01:38,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:38,363 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1377 transitions. [2020-01-16 19:01:38,363 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1377 transitions. [2020-01-16 19:01:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:38,363 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:38,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, 1, 1, 1] [2020-01-16 19:01:38,363 INFO L426 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:38,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:38,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1748047018, now seen corresponding path program 375 times [2020-01-16 19:01:38,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:38,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089359852] [2020-01-16 19:01:38,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:38,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-01-16 19:01:38,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089359852] [2020-01-16 19:01:38,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:38,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:38,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455029205] [2020-01-16 19:01:38,639 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:38,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:38,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:38,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:38,639 INFO L87 Difference]: Start difference. First operand 396 states and 1377 transitions. Second operand 9 states. [2020-01-16 19:01:38,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:38,712 INFO L93 Difference]: Finished difference Result 681 states and 2014 transitions. [2020-01-16 19:01:38,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:38,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:38,714 INFO L225 Difference]: With dead ends: 681 [2020-01-16 19:01:38,714 INFO L226 Difference]: Without dead ends: 665 [2020-01-16 19:01:38,714 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2020-01-16 19:01:38,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 404. [2020-01-16 19:01:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-01-16 19:01:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1390 transitions. [2020-01-16 19:01:38,724 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1390 transitions. Word has length 22 [2020-01-16 19:01:38,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:38,724 INFO L478 AbstractCegarLoop]: Abstraction has 404 states and 1390 transitions. [2020-01-16 19:01:38,724 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:38,724 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1390 transitions. [2020-01-16 19:01:38,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:38,725 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:38,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, 1, 1, 1] [2020-01-16 19:01:38,725 INFO L426 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:38,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:38,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1897474686, now seen corresponding path program 376 times [2020-01-16 19:01:38,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:38,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441437093] [2020-01-16 19:01:38,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:38,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-01-16 19:01:38,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441437093] [2020-01-16 19:01:38,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:38,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:38,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425030975] [2020-01-16 19:01:38,996 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:38,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:38,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:38,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:38,997 INFO L87 Difference]: Start difference. First operand 404 states and 1390 transitions. Second operand 9 states. [2020-01-16 19:01:39,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:39,109 INFO L93 Difference]: Finished difference Result 679 states and 2004 transitions. [2020-01-16 19:01:39,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:39,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:39,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:39,111 INFO L225 Difference]: With dead ends: 679 [2020-01-16 19:01:39,111 INFO L226 Difference]: Without dead ends: 657 [2020-01-16 19:01:39,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:39,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-01-16 19:01:39,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 396. [2020-01-16 19:01:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:01:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1373 transitions. [2020-01-16 19:01:39,121 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1373 transitions. Word has length 22 [2020-01-16 19:01:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:39,121 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1373 transitions. [2020-01-16 19:01:39,121 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:39,121 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1373 transitions. [2020-01-16 19:01:39,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:39,122 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:39,122 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:39,122 INFO L426 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:39,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:39,122 INFO L82 PathProgramCache]: Analyzing trace with hash 527385892, now seen corresponding path program 377 times [2020-01-16 19:01:39,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:39,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627369219] [2020-01-16 19:01:39,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:39,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627369219] [2020-01-16 19:01:39,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:39,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:39,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783973270] [2020-01-16 19:01:39,388 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:39,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:39,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:39,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:39,388 INFO L87 Difference]: Start difference. First operand 396 states and 1373 transitions. Second operand 9 states. [2020-01-16 19:01:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:39,485 INFO L93 Difference]: Finished difference Result 663 states and 1973 transitions. [2020-01-16 19:01:39,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:39,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:39,487 INFO L225 Difference]: With dead ends: 663 [2020-01-16 19:01:39,487 INFO L226 Difference]: Without dead ends: 653 [2020-01-16 19:01:39,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:39,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-01-16 19:01:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 398. [2020-01-16 19:01:39,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 19:01:39,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1376 transitions. [2020-01-16 19:01:39,496 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1376 transitions. Word has length 22 [2020-01-16 19:01:39,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:39,496 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1376 transitions. [2020-01-16 19:01:39,496 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:39,497 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1376 transitions. [2020-01-16 19:01:39,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:39,497 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:39,497 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:39,498 INFO L426 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:39,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:39,498 INFO L82 PathProgramCache]: Analyzing trace with hash -390564298, now seen corresponding path program 378 times [2020-01-16 19:01:39,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:39,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461179376] [2020-01-16 19:01:39,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:39,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461179376] [2020-01-16 19:01:39,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:39,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:39,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942197468] [2020-01-16 19:01:39,757 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:39,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:39,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:39,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:39,757 INFO L87 Difference]: Start difference. First operand 398 states and 1376 transitions. Second operand 9 states. [2020-01-16 19:01:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:39,864 INFO L93 Difference]: Finished difference Result 667 states and 1979 transitions. [2020-01-16 19:01:39,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:39,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:39,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:39,866 INFO L225 Difference]: With dead ends: 667 [2020-01-16 19:01:39,866 INFO L226 Difference]: Without dead ends: 647 [2020-01-16 19:01:39,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2020-01-16 19:01:39,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 392. [2020-01-16 19:01:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:01:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1364 transitions. [2020-01-16 19:01:39,878 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1364 transitions. Word has length 22 [2020-01-16 19:01:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:39,878 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1364 transitions. [2020-01-16 19:01:39,878 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1364 transitions. [2020-01-16 19:01:39,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:39,879 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:39,879 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:39,879 INFO L426 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:39,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:39,879 INFO L82 PathProgramCache]: Analyzing trace with hash -255685110, now seen corresponding path program 379 times [2020-01-16 19:01:39,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:39,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401388175] [2020-01-16 19:01:39,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:40,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-01-16 19:01:40,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401388175] [2020-01-16 19:01:40,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:40,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:40,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541595652] [2020-01-16 19:01:40,158 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:40,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:40,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:40,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:40,159 INFO L87 Difference]: Start difference. First operand 392 states and 1364 transitions. Second operand 9 states. [2020-01-16 19:01:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:40,256 INFO L93 Difference]: Finished difference Result 648 states and 1944 transitions. [2020-01-16 19:01:40,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:40,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:40,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:40,258 INFO L225 Difference]: With dead ends: 648 [2020-01-16 19:01:40,259 INFO L226 Difference]: Without dead ends: 637 [2020-01-16 19:01:40,259 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:40,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-01-16 19:01:40,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 396. [2020-01-16 19:01:40,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:01:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1374 transitions. [2020-01-16 19:01:40,269 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1374 transitions. Word has length 22 [2020-01-16 19:01:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:40,269 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1374 transitions. [2020-01-16 19:01:40,269 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1374 transitions. [2020-01-16 19:01:40,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:40,270 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:40,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, 1, 1, 1] [2020-01-16 19:01:40,270 INFO L426 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:40,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:40,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1086247678, now seen corresponding path program 380 times [2020-01-16 19:01:40,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:40,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931609108] [2020-01-16 19:01:40,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:40,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931609108] [2020-01-16 19:01:40,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:40,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:40,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989390031] [2020-01-16 19:01:40,543 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:40,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:40,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:40,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:40,544 INFO L87 Difference]: Start difference. First operand 396 states and 1374 transitions. Second operand 9 states. [2020-01-16 19:01:40,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:40,642 INFO L93 Difference]: Finished difference Result 647 states and 1940 transitions. [2020-01-16 19:01:40,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:40,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:40,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:40,644 INFO L225 Difference]: With dead ends: 647 [2020-01-16 19:01:40,644 INFO L226 Difference]: Without dead ends: 635 [2020-01-16 19:01:40,645 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:40,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-01-16 19:01:40,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 394. [2020-01-16 19:01:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:01:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1369 transitions. [2020-01-16 19:01:40,655 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1369 transitions. Word has length 22 [2020-01-16 19:01:40,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:40,655 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1369 transitions. [2020-01-16 19:01:40,655 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:40,655 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1369 transitions. [2020-01-16 19:01:40,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:40,656 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01: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, 1, 1, 1] [2020-01-16 19:01:40,656 INFO L426 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:40,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:40,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1352630072, now seen corresponding path program 381 times [2020-01-16 19:01:40,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:40,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484966833] [2020-01-16 19:01:40,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:40,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-01-16 19:01:40,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484966833] [2020-01-16 19:01:40,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:40,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:40,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186247293] [2020-01-16 19:01:40,917 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:40,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:40,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:40,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:40,917 INFO L87 Difference]: Start difference. First operand 394 states and 1369 transitions. Second operand 9 states. [2020-01-16 19:01:41,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:41,014 INFO L93 Difference]: Finished difference Result 653 states and 1953 transitions. [2020-01-16 19:01:41,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:41,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:41,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:41,015 INFO L225 Difference]: With dead ends: 653 [2020-01-16 19:01:41,015 INFO L226 Difference]: Without dead ends: 642 [2020-01-16 19:01:41,015 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:41,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-01-16 19:01:41,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 397. [2020-01-16 19:01:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:01:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1374 transitions. [2020-01-16 19:01:41,025 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1374 transitions. Word has length 22 [2020-01-16 19:01:41,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:41,025 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1374 transitions. [2020-01-16 19:01:41,025 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1374 transitions. [2020-01-16 19:01:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:41,025 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:41,026 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:41,026 INFO L426 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:41,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:41,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2075777240, now seen corresponding path program 382 times [2020-01-16 19:01:41,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:41,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858747135] [2020-01-16 19:01:41,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:41,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858747135] [2020-01-16 19:01:41,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:41,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:41,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217485139] [2020-01-16 19:01:41,294 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:41,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:41,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:41,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:41,295 INFO L87 Difference]: Start difference. First operand 397 states and 1374 transitions. Second operand 9 states. [2020-01-16 19:01:41,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:41,398 INFO L93 Difference]: Finished difference Result 656 states and 1956 transitions. [2020-01-16 19:01:41,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:41,398 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:41,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:41,399 INFO L225 Difference]: With dead ends: 656 [2020-01-16 19:01:41,400 INFO L226 Difference]: Without dead ends: 639 [2020-01-16 19:01:41,400 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:41,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-01-16 19:01:41,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 394. [2020-01-16 19:01:41,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:01:41,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1367 transitions. [2020-01-16 19:01:41,409 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1367 transitions. Word has length 22 [2020-01-16 19:01:41,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:41,409 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1367 transitions. [2020-01-16 19:01:41,409 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:41,409 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1367 transitions. [2020-01-16 19:01:41,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:41,409 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:41,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, 1, 1, 1] [2020-01-16 19:01:41,410 INFO L426 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:41,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:41,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1621477480, now seen corresponding path program 383 times [2020-01-16 19:01:41,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:41,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283909928] [2020-01-16 19:01:41,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:41,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-01-16 19:01:41,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283909928] [2020-01-16 19:01:41,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:41,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:41,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623374125] [2020-01-16 19:01:41,672 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:41,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:41,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:41,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:41,673 INFO L87 Difference]: Start difference. First operand 394 states and 1367 transitions. Second operand 9 states. [2020-01-16 19:01:41,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:41,781 INFO L93 Difference]: Finished difference Result 650 states and 1944 transitions. [2020-01-16 19:01:41,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:41,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:41,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:41,783 INFO L225 Difference]: With dead ends: 650 [2020-01-16 19:01:41,783 INFO L226 Difference]: Without dead ends: 640 [2020-01-16 19:01:41,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:41,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-01-16 19:01:41,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 396. [2020-01-16 19:01:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:01:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1370 transitions. [2020-01-16 19:01:41,793 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1370 transitions. Word has length 22 [2020-01-16 19:01:41,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:41,793 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1370 transitions. [2020-01-16 19:01:41,793 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:41,793 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1370 transitions. [2020-01-16 19:01:41,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:41,794 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:41,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, 1, 1, 1] [2020-01-16 19:01:41,794 INFO L426 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:41,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:41,794 INFO L82 PathProgramCache]: Analyzing trace with hash 703527290, now seen corresponding path program 384 times [2020-01-16 19:01:41,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:41,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595901612] [2020-01-16 19:01:41,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:42,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595901612] [2020-01-16 19:01:42,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:42,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:42,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472491450] [2020-01-16 19:01:42,064 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:42,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:42,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:42,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:42,064 INFO L87 Difference]: Start difference. First operand 396 states and 1370 transitions. Second operand 9 states. [2020-01-16 19:01:42,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:42,162 INFO L93 Difference]: Finished difference Result 654 states and 1950 transitions. [2020-01-16 19:01:42,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:42,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:42,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:42,164 INFO L225 Difference]: With dead ends: 654 [2020-01-16 19:01:42,164 INFO L226 Difference]: Without dead ends: 632 [2020-01-16 19:01:42,165 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:42,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-01-16 19:01:42,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 388. [2020-01-16 19:01:42,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:01:42,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1355 transitions. [2020-01-16 19:01:42,175 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1355 transitions. Word has length 22 [2020-01-16 19:01:42,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:42,175 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1355 transitions. [2020-01-16 19:01:42,175 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1355 transitions. [2020-01-16 19:01:42,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:42,175 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:42,176 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:42,176 INFO L426 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:42,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:42,176 INFO L82 PathProgramCache]: Analyzing trace with hash 914974018, now seen corresponding path program 385 times [2020-01-16 19:01:42,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:42,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317971422] [2020-01-16 19:01:42,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:42,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-01-16 19:01:42,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317971422] [2020-01-16 19:01:42,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:42,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:42,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163689750] [2020-01-16 19:01:42,429 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:42,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:42,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:42,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:42,430 INFO L87 Difference]: Start difference. First operand 388 states and 1355 transitions. Second operand 9 states. [2020-01-16 19:01:42,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:42,505 INFO L93 Difference]: Finished difference Result 660 states and 1973 transitions. [2020-01-16 19:01:42,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:42,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:42,507 INFO L225 Difference]: With dead ends: 660 [2020-01-16 19:01:42,507 INFO L226 Difference]: Without dead ends: 644 [2020-01-16 19:01:42,507 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-01-16 19:01:42,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 398. [2020-01-16 19:01:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 19:01:42,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1384 transitions. [2020-01-16 19:01:42,517 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1384 transitions. Word has length 22 [2020-01-16 19:01:42,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:42,517 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1384 transitions. [2020-01-16 19:01:42,517 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:42,517 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1384 transitions. [2020-01-16 19:01:42,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:42,518 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:42,518 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:42,518 INFO L426 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:42,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:42,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1789727392, now seen corresponding path program 386 times [2020-01-16 19:01:42,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:42,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118264659] [2020-01-16 19:01:42,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:42,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118264659] [2020-01-16 19:01:42,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:42,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:42,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610376796] [2020-01-16 19:01:42,762 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:42,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:42,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:42,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:42,762 INFO L87 Difference]: Start difference. First operand 398 states and 1384 transitions. Second operand 9 states. [2020-01-16 19:01:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:42,861 INFO L93 Difference]: Finished difference Result 655 states and 1960 transitions. [2020-01-16 19:01:42,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:42,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:42,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:42,862 INFO L225 Difference]: With dead ends: 655 [2020-01-16 19:01:42,863 INFO L226 Difference]: Without dead ends: 640 [2020-01-16 19:01:42,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:42,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-01-16 19:01:42,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 394. [2020-01-16 19:01:42,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:01:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1375 transitions. [2020-01-16 19:01:42,872 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1375 transitions. Word has length 22 [2020-01-16 19:01:42,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:42,872 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1375 transitions. [2020-01-16 19:01:42,872 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1375 transitions. [2020-01-16 19:01:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:42,873 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:42,873 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:42,873 INFO L426 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:42,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:42,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1015886190, now seen corresponding path program 387 times [2020-01-16 19:01:42,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:42,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927205119] [2020-01-16 19:01:42,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:43,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:43,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927205119] [2020-01-16 19:01:43,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:43,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:43,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615810862] [2020-01-16 19:01:43,129 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:43,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:43,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:43,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:43,129 INFO L87 Difference]: Start difference. First operand 394 states and 1375 transitions. Second operand 9 states. [2020-01-16 19:01:43,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:43,202 INFO L93 Difference]: Finished difference Result 658 states and 1965 transitions. [2020-01-16 19:01:43,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:43,203 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:43,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:43,204 INFO L225 Difference]: With dead ends: 658 [2020-01-16 19:01:43,204 INFO L226 Difference]: Without dead ends: 642 [2020-01-16 19:01:43,204 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:43,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-01-16 19:01:43,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 397. [2020-01-16 19:01:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:01:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1379 transitions. [2020-01-16 19:01:43,214 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1379 transitions. Word has length 22 [2020-01-16 19:01:43,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:43,214 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1379 transitions. [2020-01-16 19:01:43,214 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1379 transitions. [2020-01-16 19:01:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:43,215 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:43,215 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:43,215 INFO L426 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:43,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:43,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1142522564, now seen corresponding path program 388 times [2020-01-16 19:01:43,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:43,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568091072] [2020-01-16 19:01:43,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:43,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-01-16 19:01:43,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568091072] [2020-01-16 19:01:43,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:43,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:43,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203582047] [2020-01-16 19:01:43,468 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:43,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:43,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:43,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:43,468 INFO L87 Difference]: Start difference. First operand 397 states and 1379 transitions. Second operand 9 states. [2020-01-16 19:01:43,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:43,571 INFO L93 Difference]: Finished difference Result 652 states and 1951 transitions. [2020-01-16 19:01:43,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:43,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:43,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:43,573 INFO L225 Difference]: With dead ends: 652 [2020-01-16 19:01:43,573 INFO L226 Difference]: Without dead ends: 639 [2020-01-16 19:01:43,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:43,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-01-16 19:01:43,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 394. [2020-01-16 19:01:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:01:43,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1372 transitions. [2020-01-16 19:01:43,582 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1372 transitions. Word has length 22 [2020-01-16 19:01:43,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:43,582 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1372 transitions. [2020-01-16 19:01:43,582 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:43,582 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1372 transitions. [2020-01-16 19:01:43,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:43,582 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:43,583 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:43,583 INFO L426 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:43,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:43,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1272495604, now seen corresponding path program 389 times [2020-01-16 19:01:43,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:43,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879404524] [2020-01-16 19:01:43,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:43,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879404524] [2020-01-16 19:01:43,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:43,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:43,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626312813] [2020-01-16 19:01:43,850 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:43,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:43,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:43,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:43,851 INFO L87 Difference]: Start difference. First operand 394 states and 1372 transitions. Second operand 9 states. [2020-01-16 19:01:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:43,949 INFO L93 Difference]: Finished difference Result 647 states and 1942 transitions. [2020-01-16 19:01:43,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:43,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:43,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:43,951 INFO L225 Difference]: With dead ends: 647 [2020-01-16 19:01:43,951 INFO L226 Difference]: Without dead ends: 636 [2020-01-16 19:01:43,951 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:43,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2020-01-16 19:01:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 396. [2020-01-16 19:01:43,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:01:43,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1375 transitions. [2020-01-16 19:01:43,960 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1375 transitions. Word has length 22 [2020-01-16 19:01:43,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:43,960 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1375 transitions. [2020-01-16 19:01:43,960 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:43,960 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1375 transitions. [2020-01-16 19:01:43,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:43,961 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:43,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, 1, 1, 1] [2020-01-16 19:01:43,961 INFO L426 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:43,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:43,961 INFO L82 PathProgramCache]: Analyzing trace with hash 69437184, now seen corresponding path program 390 times [2020-01-16 19:01:43,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:43,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275755671] [2020-01-16 19:01:43,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:44,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-01-16 19:01:44,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275755671] [2020-01-16 19:01:44,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:44,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:44,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832622376] [2020-01-16 19:01:44,222 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:44,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:44,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:44,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:44,223 INFO L87 Difference]: Start difference. First operand 396 states and 1375 transitions. Second operand 9 states. [2020-01-16 19:01:44,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:44,325 INFO L93 Difference]: Finished difference Result 646 states and 1938 transitions. [2020-01-16 19:01:44,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:44,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:44,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:44,327 INFO L225 Difference]: With dead ends: 646 [2020-01-16 19:01:44,327 INFO L226 Difference]: Without dead ends: 631 [2020-01-16 19:01:44,327 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:44,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-01-16 19:01:44,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 391. [2020-01-16 19:01:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:01:44,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1365 transitions. [2020-01-16 19:01:44,336 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1365 transitions. Word has length 22 [2020-01-16 19:01:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:44,336 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1365 transitions. [2020-01-16 19:01:44,336 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1365 transitions. [2020-01-16 19:01:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:44,337 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:44,337 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:44,337 INFO L426 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:44,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:44,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1267564648, now seen corresponding path program 391 times [2020-01-16 19:01:44,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:44,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607656074] [2020-01-16 19:01:44,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:44,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607656074] [2020-01-16 19:01:44,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:44,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:44,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211222242] [2020-01-16 19:01:44,588 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:44,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:44,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:44,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:44,589 INFO L87 Difference]: Start difference. First operand 391 states and 1365 transitions. Second operand 9 states. [2020-01-16 19:01:44,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:44,667 INFO L93 Difference]: Finished difference Result 668 states and 1992 transitions. [2020-01-16 19:01:44,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:44,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:44,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:44,668 INFO L225 Difference]: With dead ends: 668 [2020-01-16 19:01:44,669 INFO L226 Difference]: Without dead ends: 652 [2020-01-16 19:01:44,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:44,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2020-01-16 19:01:44,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 399. [2020-01-16 19:01:44,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:01:44,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1385 transitions. [2020-01-16 19:01:44,678 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1385 transitions. Word has length 22 [2020-01-16 19:01:44,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:44,678 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1385 transitions. [2020-01-16 19:01:44,678 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:44,678 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1385 transitions. [2020-01-16 19:01:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:44,678 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:44,679 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:44,679 INFO L426 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:44,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:44,679 INFO L82 PathProgramCache]: Analyzing trace with hash 322701238, now seen corresponding path program 392 times [2020-01-16 19:01:44,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:44,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633670056] [2020-01-16 19:01:44,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:44,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-01-16 19:01:44,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633670056] [2020-01-16 19:01:44,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:44,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:44,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937175335] [2020-01-16 19:01:44,927 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:44,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:44,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:44,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:44,928 INFO L87 Difference]: Start difference. First operand 399 states and 1385 transitions. Second operand 9 states. [2020-01-16 19:01:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:45,026 INFO L93 Difference]: Finished difference Result 663 states and 1979 transitions. [2020-01-16 19:01:45,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:45,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:45,028 INFO L225 Difference]: With dead ends: 663 [2020-01-16 19:01:45,028 INFO L226 Difference]: Without dead ends: 648 [2020-01-16 19:01:45,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:45,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-01-16 19:01:45,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 395. [2020-01-16 19:01:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:01:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1375 transitions. [2020-01-16 19:01:45,038 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1375 transitions. Word has length 22 [2020-01-16 19:01:45,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:45,038 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1375 transitions. [2020-01-16 19:01:45,038 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:45,038 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1375 transitions. [2020-01-16 19:01:45,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:45,038 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:45,039 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:45,039 INFO L426 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:45,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:45,039 INFO L82 PathProgramCache]: Analyzing trace with hash 64998280, now seen corresponding path program 393 times [2020-01-16 19:01:45,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:45,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68273168] [2020-01-16 19:01:45,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:45,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-01-16 19:01:45,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68273168] [2020-01-16 19:01:45,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:45,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:45,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742260035] [2020-01-16 19:01:45,301 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:45,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:45,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:45,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:45,301 INFO L87 Difference]: Start difference. First operand 395 states and 1375 transitions. Second operand 9 states. [2020-01-16 19:01:45,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:45,375 INFO L93 Difference]: Finished difference Result 672 states and 1998 transitions. [2020-01-16 19:01:45,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:45,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:45,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:45,377 INFO L225 Difference]: With dead ends: 672 [2020-01-16 19:01:45,377 INFO L226 Difference]: Without dead ends: 656 [2020-01-16 19:01:45,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:45,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-01-16 19:01:45,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 401. [2020-01-16 19:01:45,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-01-16 19:01:45,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1385 transitions. [2020-01-16 19:01:45,387 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1385 transitions. Word has length 22 [2020-01-16 19:01:45,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:45,387 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 1385 transitions. [2020-01-16 19:01:45,387 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:45,387 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1385 transitions. [2020-01-16 19:01:45,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:45,387 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:45,387 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:45,388 INFO L426 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:45,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:45,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1526101748, now seen corresponding path program 394 times [2020-01-16 19:01:45,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:45,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901355762] [2020-01-16 19:01:45,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:45,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901355762] [2020-01-16 19:01:45,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:45,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:45,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738927365] [2020-01-16 19:01:45,643 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:45,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:45,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:45,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:45,643 INFO L87 Difference]: Start difference. First operand 401 states and 1385 transitions. Second operand 9 states. [2020-01-16 19:01:45,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:45,757 INFO L93 Difference]: Finished difference Result 669 states and 1987 transitions. [2020-01-16 19:01:45,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:45,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:45,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:45,759 INFO L225 Difference]: With dead ends: 669 [2020-01-16 19:01:45,759 INFO L226 Difference]: Without dead ends: 650 [2020-01-16 19:01:45,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:45,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-01-16 19:01:45,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 395. [2020-01-16 19:01:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:01:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1371 transitions. [2020-01-16 19:01:45,769 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1371 transitions. Word has length 22 [2020-01-16 19:01:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:45,769 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1371 transitions. [2020-01-16 19:01:45,769 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1371 transitions. [2020-01-16 19:01:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:45,770 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:45,770 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:45,770 INFO L426 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:45,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:45,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1150298134, now seen corresponding path program 395 times [2020-01-16 19:01:45,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:45,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558324864] [2020-01-16 19:01:45,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:46,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558324864] [2020-01-16 19:01:46,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:46,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:46,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904489813] [2020-01-16 19:01:46,056 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:46,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:46,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:46,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:46,056 INFO L87 Difference]: Start difference. First operand 395 states and 1371 transitions. Second operand 9 states. [2020-01-16 19:01:46,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:46,154 INFO L93 Difference]: Finished difference Result 659 states and 1968 transitions. [2020-01-16 19:01:46,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:46,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:46,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:46,156 INFO L225 Difference]: With dead ends: 659 [2020-01-16 19:01:46,157 INFO L226 Difference]: Without dead ends: 648 [2020-01-16 19:01:46,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:46,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-01-16 19:01:46,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 398. [2020-01-16 19:01:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 19:01:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1376 transitions. [2020-01-16 19:01:46,166 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1376 transitions. Word has length 22 [2020-01-16 19:01:46,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:46,166 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1376 transitions. [2020-01-16 19:01:46,166 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1376 transitions. [2020-01-16 19:01:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:46,167 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:46,167 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:46,167 INFO L426 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:46,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:46,167 INFO L82 PathProgramCache]: Analyzing trace with hash 578749200, now seen corresponding path program 396 times [2020-01-16 19:01:46,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:46,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034859351] [2020-01-16 19:01:46,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:46,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034859351] [2020-01-16 19:01:46,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:46,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:46,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181971565] [2020-01-16 19:01:46,414 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:46,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:46,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:46,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:46,415 INFO L87 Difference]: Start difference. First operand 398 states and 1376 transitions. Second operand 9 states. [2020-01-16 19:01:46,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:46,515 INFO L93 Difference]: Finished difference Result 661 states and 1969 transitions. [2020-01-16 19:01:46,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:46,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:46,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:46,517 INFO L225 Difference]: With dead ends: 661 [2020-01-16 19:01:46,517 INFO L226 Difference]: Without dead ends: 641 [2020-01-16 19:01:46,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:46,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-01-16 19:01:46,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 391. [2020-01-16 19:01:46,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:01:46,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1362 transitions. [2020-01-16 19:01:46,526 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1362 transitions. Word has length 22 [2020-01-16 19:01:46,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:46,526 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1362 transitions. [2020-01-16 19:01:46,526 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:46,527 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1362 transitions. [2020-01-16 19:01:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:46,527 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:46,527 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:46,527 INFO L426 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:46,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:46,527 INFO L82 PathProgramCache]: Analyzing trace with hash 320514856, now seen corresponding path program 397 times [2020-01-16 19:01:46,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:46,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992010061] [2020-01-16 19:01:46,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:46,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-01-16 19:01:46,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992010061] [2020-01-16 19:01:46,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:46,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:46,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624139170] [2020-01-16 19:01:46,774 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:46,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:46,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:46,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:46,774 INFO L87 Difference]: Start difference. First operand 391 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:01:46,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:46,851 INFO L93 Difference]: Finished difference Result 662 states and 1972 transitions. [2020-01-16 19:01:46,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:46,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:46,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:46,853 INFO L225 Difference]: With dead ends: 662 [2020-01-16 19:01:46,853 INFO L226 Difference]: Without dead ends: 646 [2020-01-16 19:01:46,853 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:46,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-01-16 19:01:46,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 397. [2020-01-16 19:01:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:01:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1376 transitions. [2020-01-16 19:01:46,862 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1376 transitions. Word has length 22 [2020-01-16 19:01:46,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:46,862 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1376 transitions. [2020-01-16 19:01:46,862 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1376 transitions. [2020-01-16 19:01:46,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:46,863 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:46,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, 1, 1, 1] [2020-01-16 19:01:46,863 INFO L426 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:46,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:46,863 INFO L82 PathProgramCache]: Analyzing trace with hash 447151230, now seen corresponding path program 398 times [2020-01-16 19:01:46,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:46,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591145112] [2020-01-16 19:01:46,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:47,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591145112] [2020-01-16 19:01:47,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:47,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:47,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341778198] [2020-01-16 19:01:47,129 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:47,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:47,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:47,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:47,129 INFO L87 Difference]: Start difference. First operand 397 states and 1376 transitions. Second operand 9 states. [2020-01-16 19:01:47,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:47,229 INFO L93 Difference]: Finished difference Result 656 states and 1958 transitions. [2020-01-16 19:01:47,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:47,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:47,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:47,230 INFO L225 Difference]: With dead ends: 656 [2020-01-16 19:01:47,231 INFO L226 Difference]: Without dead ends: 643 [2020-01-16 19:01:47,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:47,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-01-16 19:01:47,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 394. [2020-01-16 19:01:47,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:01:47,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1369 transitions. [2020-01-16 19:01:47,240 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1369 transitions. Word has length 22 [2020-01-16 19:01:47,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:47,240 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1369 transitions. [2020-01-16 19:01:47,240 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:47,240 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1369 transitions. [2020-01-16 19:01:47,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:47,240 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:47,240 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:47,241 INFO L426 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:47,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:47,241 INFO L82 PathProgramCache]: Analyzing trace with hash 855744658, now seen corresponding path program 399 times [2020-01-16 19:01:47,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:47,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124137159] [2020-01-16 19:01:47,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:47,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-01-16 19:01:47,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124137159] [2020-01-16 19:01:47,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:47,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:47,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348206277] [2020-01-16 19:01:47,498 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:47,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:47,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:47,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:47,499 INFO L87 Difference]: Start difference. First operand 394 states and 1369 transitions. Second operand 9 states. [2020-01-16 19:01:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:47,570 INFO L93 Difference]: Finished difference Result 668 states and 1984 transitions. [2020-01-16 19:01:47,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:47,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:47,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:47,571 INFO L225 Difference]: With dead ends: 668 [2020-01-16 19:01:47,571 INFO L226 Difference]: Without dead ends: 652 [2020-01-16 19:01:47,572 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:47,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2020-01-16 19:01:47,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 400. [2020-01-16 19:01:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-01-16 19:01:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1379 transitions. [2020-01-16 19:01:47,581 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1379 transitions. Word has length 22 [2020-01-16 19:01:47,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:47,581 INFO L478 AbstractCegarLoop]: Abstraction has 400 states and 1379 transitions. [2020-01-16 19:01:47,581 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:47,581 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1379 transitions. [2020-01-16 19:01:47,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:47,582 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:47,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, 1, 1, 1] [2020-01-16 19:01:47,582 INFO L426 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:47,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:47,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1602175584, now seen corresponding path program 400 times [2020-01-16 19:01:47,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:47,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883760723] [2020-01-16 19:01:47,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:47,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-01-16 19:01:47,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883760723] [2020-01-16 19:01:47,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:47,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:47,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195043007] [2020-01-16 19:01:47,839 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:47,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:47,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:47,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:47,840 INFO L87 Difference]: Start difference. First operand 400 states and 1379 transitions. Second operand 9 states. [2020-01-16 19:01:47,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:47,940 INFO L93 Difference]: Finished difference Result 665 states and 1973 transitions. [2020-01-16 19:01:47,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:47,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:47,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:47,942 INFO L225 Difference]: With dead ends: 665 [2020-01-16 19:01:47,942 INFO L226 Difference]: Without dead ends: 646 [2020-01-16 19:01:47,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:47,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-01-16 19:01:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 394. [2020-01-16 19:01:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:01:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1366 transitions. [2020-01-16 19:01:47,952 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1366 transitions. Word has length 22 [2020-01-16 19:01:47,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:47,952 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1366 transitions. [2020-01-16 19:01:47,952 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1366 transitions. [2020-01-16 19:01:47,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:47,953 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:47,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, 1, 1, 1] [2020-01-16 19:01:47,953 INFO L426 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:47,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:47,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1163789728, now seen corresponding path program 401 times [2020-01-16 19:01:47,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:47,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043618166] [2020-01-16 19:01:47,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:48,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-01-16 19:01:48,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043618166] [2020-01-16 19:01:48,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:48,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:48,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102896650] [2020-01-16 19:01:48,208 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:48,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:48,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:48,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:48,209 INFO L87 Difference]: Start difference. First operand 394 states and 1366 transitions. Second operand 9 states. [2020-01-16 19:01:48,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:48,303 INFO L93 Difference]: Finished difference Result 652 states and 1948 transitions. [2020-01-16 19:01:48,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:48,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:48,305 INFO L225 Difference]: With dead ends: 652 [2020-01-16 19:01:48,305 INFO L226 Difference]: Without dead ends: 642 [2020-01-16 19:01:48,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-01-16 19:01:48,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 396. [2020-01-16 19:01:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:01:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1369 transitions. [2020-01-16 19:01:48,315 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1369 transitions. Word has length 22 [2020-01-16 19:01:48,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:48,315 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1369 transitions. [2020-01-16 19:01:48,315 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1369 transitions. [2020-01-16 19:01:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:48,316 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:48,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, 1, 1, 1] [2020-01-16 19:01:48,316 INFO L426 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:48,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:48,316 INFO L82 PathProgramCache]: Analyzing trace with hash -592334922, now seen corresponding path program 402 times [2020-01-16 19:01:48,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:48,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572624401] [2020-01-16 19:01:48,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:48,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-01-16 19:01:48,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572624401] [2020-01-16 19:01:48,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:48,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:48,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840218405] [2020-01-16 19:01:48,591 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:48,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:48,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:48,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:48,591 INFO L87 Difference]: Start difference. First operand 396 states and 1369 transitions. Second operand 9 states. [2020-01-16 19:01:48,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:48,685 INFO L93 Difference]: Finished difference Result 655 states and 1952 transitions. [2020-01-16 19:01:48,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:48,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:48,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:48,686 INFO L225 Difference]: With dead ends: 655 [2020-01-16 19:01:48,687 INFO L226 Difference]: Without dead ends: 637 [2020-01-16 19:01:48,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:48,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-01-16 19:01:48,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 391. [2020-01-16 19:01:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:01:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1359 transitions. [2020-01-16 19:01:48,700 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1359 transitions. Word has length 22 [2020-01-16 19:01:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:48,700 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1359 transitions. [2020-01-16 19:01:48,700 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:48,700 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1359 transitions. [2020-01-16 19:01:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:48,701 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:48,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, 1, 1, 1] [2020-01-16 19:01:48,701 INFO L426 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:48,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:48,701 INFO L82 PathProgramCache]: Analyzing trace with hash -873775350, now seen corresponding path program 403 times [2020-01-16 19:01:48,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:48,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104538806] [2020-01-16 19:01:48,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:48,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104538806] [2020-01-16 19:01:48,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:48,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:48,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030175498] [2020-01-16 19:01:48,962 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:48,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:48,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:48,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:48,962 INFO L87 Difference]: Start difference. First operand 391 states and 1359 transitions. Second operand 9 states. [2020-01-16 19:01:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:49,076 INFO L93 Difference]: Finished difference Result 641 states and 1927 transitions. [2020-01-16 19:01:49,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:49,076 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:49,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:49,077 INFO L225 Difference]: With dead ends: 641 [2020-01-16 19:01:49,078 INFO L226 Difference]: Without dead ends: 630 [2020-01-16 19:01:49,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:49,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-01-16 19:01:49,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 395. [2020-01-16 19:01:49,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:01:49,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1369 transitions. [2020-01-16 19:01:49,086 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1369 transitions. Word has length 22 [2020-01-16 19:01:49,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:49,087 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1369 transitions. [2020-01-16 19:01:49,087 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1369 transitions. [2020-01-16 19:01:49,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:49,087 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:49,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, 1, 1, 1] [2020-01-16 19:01:49,087 INFO L426 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:49,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:49,088 INFO L82 PathProgramCache]: Analyzing trace with hash 468157438, now seen corresponding path program 404 times [2020-01-16 19:01:49,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:49,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514762488] [2020-01-16 19:01:49,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:49,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-01-16 19:01:49,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514762488] [2020-01-16 19:01:49,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:49,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:49,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505111686] [2020-01-16 19:01:49,342 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:49,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:49,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:49,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:49,343 INFO L87 Difference]: Start difference. First operand 395 states and 1369 transitions. Second operand 9 states. [2020-01-16 19:01:49,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:49,447 INFO L93 Difference]: Finished difference Result 640 states and 1923 transitions. [2020-01-16 19:01:49,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:49,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:49,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:49,449 INFO L225 Difference]: With dead ends: 640 [2020-01-16 19:01:49,449 INFO L226 Difference]: Without dead ends: 628 [2020-01-16 19:01:49,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-01-16 19:01:49,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 393. [2020-01-16 19:01:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:01:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1364 transitions. [2020-01-16 19:01:49,458 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1364 transitions. Word has length 22 [2020-01-16 19:01:49,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:49,458 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1364 transitions. [2020-01-16 19:01:49,458 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:49,458 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1364 transitions. [2020-01-16 19:01:49,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:49,459 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:49,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, 1, 1, 1] [2020-01-16 19:01:49,459 INFO L426 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:49,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:49,459 INFO L82 PathProgramCache]: Analyzing trace with hash -338545548, now seen corresponding path program 405 times [2020-01-16 19:01:49,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:49,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469991517] [2020-01-16 19:01:49,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:49,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-01-16 19:01:49,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469991517] [2020-01-16 19:01:49,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:49,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:49,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512038691] [2020-01-16 19:01:49,717 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:49,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:49,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:49,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:49,717 INFO L87 Difference]: Start difference. First operand 393 states and 1364 transitions. Second operand 9 states. [2020-01-16 19:01:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:49,840 INFO L93 Difference]: Finished difference Result 645 states and 1934 transitions. [2020-01-16 19:01:49,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:49,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:49,841 INFO L225 Difference]: With dead ends: 645 [2020-01-16 19:01:49,842 INFO L226 Difference]: Without dead ends: 634 [2020-01-16 19:01:49,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:49,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-01-16 19:01:49,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 396. [2020-01-16 19:01:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:01:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1369 transitions. [2020-01-16 19:01:49,851 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1369 transitions. Word has length 22 [2020-01-16 19:01:49,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:49,851 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1369 transitions. [2020-01-16 19:01:49,851 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1369 transitions. [2020-01-16 19:01:49,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:49,852 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:49,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, 1, 1, 1] [2020-01-16 19:01:49,852 INFO L426 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:49,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:49,852 INFO L82 PathProgramCache]: Analyzing trace with hash -566934556, now seen corresponding path program 406 times [2020-01-16 19:01:49,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:49,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954598347] [2020-01-16 19:01:49,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:50,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-01-16 19:01:50,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954598347] [2020-01-16 19:01:50,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:50,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:50,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576754909] [2020-01-16 19:01:50,101 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:50,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:50,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:50,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:50,102 INFO L87 Difference]: Start difference. First operand 396 states and 1369 transitions. Second operand 9 states. [2020-01-16 19:01:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:50,203 INFO L93 Difference]: Finished difference Result 647 states and 1935 transitions. [2020-01-16 19:01:50,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:50,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:50,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:50,205 INFO L225 Difference]: With dead ends: 647 [2020-01-16 19:01:50,205 INFO L226 Difference]: Without dead ends: 631 [2020-01-16 19:01:50,206 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:50,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-01-16 19:01:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 393. [2020-01-16 19:01:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:01:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1362 transitions. [2020-01-16 19:01:50,217 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1362 transitions. Word has length 22 [2020-01-16 19:01:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:50,217 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1362 transitions. [2020-01-16 19:01:50,217 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1362 transitions. [2020-01-16 19:01:50,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:50,218 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:50,218 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:50,218 INFO L426 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:50,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:50,218 INFO L82 PathProgramCache]: Analyzing trace with hash -69698140, now seen corresponding path program 407 times [2020-01-16 19:01:50,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:50,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553728724] [2020-01-16 19:01:50,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:50,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553728724] [2020-01-16 19:01:50,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:50,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:50,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563758337] [2020-01-16 19:01:50,470 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:50,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:50,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:50,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:50,471 INFO L87 Difference]: Start difference. First operand 393 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:01:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:50,571 INFO L93 Difference]: Finished difference Result 642 states and 1925 transitions. [2020-01-16 19:01:50,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:50,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:50,573 INFO L225 Difference]: With dead ends: 642 [2020-01-16 19:01:50,573 INFO L226 Difference]: Without dead ends: 632 [2020-01-16 19:01:50,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:50,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-01-16 19:01:50,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 395. [2020-01-16 19:01:50,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:01:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1365 transitions. [2020-01-16 19:01:50,582 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1365 transitions. Word has length 22 [2020-01-16 19:01:50,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:50,583 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1365 transitions. [2020-01-16 19:01:50,583 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:50,583 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1365 transitions. [2020-01-16 19:01:50,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:50,583 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:50,583 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:50,583 INFO L426 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:50,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:50,584 INFO L82 PathProgramCache]: Analyzing trace with hash 501756666, now seen corresponding path program 408 times [2020-01-16 19:01:50,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:50,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804154488] [2020-01-16 19:01:50,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:50,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804154488] [2020-01-16 19:01:50,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:50,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:50,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552153917] [2020-01-16 19:01:50,837 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:50,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:50,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:50,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:50,838 INFO L87 Difference]: Start difference. First operand 395 states and 1365 transitions. Second operand 9 states. [2020-01-16 19:01:50,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:50,956 INFO L93 Difference]: Finished difference Result 645 states and 1929 transitions. [2020-01-16 19:01:50,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:50,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:50,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:50,958 INFO L225 Difference]: With dead ends: 645 [2020-01-16 19:01:50,958 INFO L226 Difference]: Without dead ends: 625 [2020-01-16 19:01:50,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:50,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-01-16 19:01:50,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 388. [2020-01-16 19:01:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:01:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1352 transitions. [2020-01-16 19:01:50,968 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1352 transitions. Word has length 22 [2020-01-16 19:01:50,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:50,968 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1352 transitions. [2020-01-16 19:01:50,968 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:50,968 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1352 transitions. [2020-01-16 19:01:50,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:50,969 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:50,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, 1, 1, 1] [2020-01-16 19:01:50,969 INFO L426 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:50,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:50,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1062496130, now seen corresponding path program 409 times [2020-01-16 19:01:50,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:50,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939593106] [2020-01-16 19:01:50,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:51,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939593106] [2020-01-16 19:01:51,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:51,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:51,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917914933] [2020-01-16 19:01:51,241 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:51,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:51,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:51,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:51,241 INFO L87 Difference]: Start difference. First operand 388 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:01:51,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:51,318 INFO L93 Difference]: Finished difference Result 696 states and 2068 transitions. [2020-01-16 19:01:51,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:51,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:51,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:51,320 INFO L225 Difference]: With dead ends: 696 [2020-01-16 19:01:51,320 INFO L226 Difference]: Without dead ends: 680 [2020-01-16 19:01:51,320 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:51,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-01-16 19:01:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 403. [2020-01-16 19:01:51,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-01-16 19:01:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1397 transitions. [2020-01-16 19:01:51,330 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1397 transitions. Word has length 22 [2020-01-16 19:01:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:51,330 INFO L478 AbstractCegarLoop]: Abstraction has 403 states and 1397 transitions. [2020-01-16 19:01:51,330 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:51,330 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1397 transitions. [2020-01-16 19:01:51,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:51,331 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:51,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, 1, 1, 1] [2020-01-16 19:01:51,331 INFO L426 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:51,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:51,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1642205280, now seen corresponding path program 410 times [2020-01-16 19:01:51,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:51,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399830316] [2020-01-16 19:01:51,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:51,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-01-16 19:01:51,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399830316] [2020-01-16 19:01:51,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:51,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:51,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685770299] [2020-01-16 19:01:51,600 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:51,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:51,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:51,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:51,601 INFO L87 Difference]: Start difference. First operand 403 states and 1397 transitions. Second operand 9 states. [2020-01-16 19:01:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:51,722 INFO L93 Difference]: Finished difference Result 691 states and 2055 transitions. [2020-01-16 19:01:51,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:51,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:51,724 INFO L225 Difference]: With dead ends: 691 [2020-01-16 19:01:51,725 INFO L226 Difference]: Without dead ends: 676 [2020-01-16 19:01:51,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:51,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2020-01-16 19:01:51,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 399. [2020-01-16 19:01:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:01:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1387 transitions. [2020-01-16 19:01:51,742 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1387 transitions. Word has length 22 [2020-01-16 19:01:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:51,742 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1387 transitions. [2020-01-16 19:01:51,742 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1387 transitions. [2020-01-16 19:01:51,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:51,742 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:51,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, 1, 1, 1] [2020-01-16 19:01:51,743 INFO L426 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:51,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:51,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1327546994, now seen corresponding path program 411 times [2020-01-16 19:01:51,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:51,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29566360] [2020-01-16 19:01:51,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:52,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-01-16 19:01:52,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29566360] [2020-01-16 19:01:52,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:52,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:52,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999064221] [2020-01-16 19:01:52,022 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:52,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:52,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:52,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:52,022 INFO L87 Difference]: Start difference. First operand 399 states and 1387 transitions. Second operand 9 states. [2020-01-16 19:01:52,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:52,096 INFO L93 Difference]: Finished difference Result 703 states and 2080 transitions. [2020-01-16 19:01:52,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:52,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:52,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:52,098 INFO L225 Difference]: With dead ends: 703 [2020-01-16 19:01:52,098 INFO L226 Difference]: Without dead ends: 687 [2020-01-16 19:01:52,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:52,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-01-16 19:01:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 407. [2020-01-16 19:01:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-01-16 19:01:52,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1400 transitions. [2020-01-16 19:01:52,107 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1400 transitions. Word has length 22 [2020-01-16 19:01:52,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:52,107 INFO L478 AbstractCegarLoop]: Abstraction has 407 states and 1400 transitions. [2020-01-16 19:01:52,107 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:52,107 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1400 transitions. [2020-01-16 19:01:52,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:52,108 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:52,108 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:52,108 INFO L426 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:52,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:52,108 INFO L82 PathProgramCache]: Analyzing trace with hash -170024556, now seen corresponding path program 412 times [2020-01-16 19:01:52,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:52,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706482932] [2020-01-16 19:01:52,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:52,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-01-16 19:01:52,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706482932] [2020-01-16 19:01:52,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:52,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:52,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423049841] [2020-01-16 19:01:52,387 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:52,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:52,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:52,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:52,388 INFO L87 Difference]: Start difference. First operand 407 states and 1400 transitions. Second operand 9 states. [2020-01-16 19:01:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:52,490 INFO L93 Difference]: Finished difference Result 701 states and 2070 transitions. [2020-01-16 19:01:52,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:52,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:52,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:52,492 INFO L225 Difference]: With dead ends: 701 [2020-01-16 19:01:52,492 INFO L226 Difference]: Without dead ends: 679 [2020-01-16 19:01:52,492 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:52,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2020-01-16 19:01:52,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 399. [2020-01-16 19:01:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:01:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1382 transitions. [2020-01-16 19:01:52,501 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1382 transitions. Word has length 22 [2020-01-16 19:01:52,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:52,501 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1382 transitions. [2020-01-16 19:01:52,501 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1382 transitions. [2020-01-16 19:01:52,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:52,502 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:52,502 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:52,502 INFO L426 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:52,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:52,502 INFO L82 PathProgramCache]: Analyzing trace with hash 112250580, now seen corresponding path program 413 times [2020-01-16 19:01:52,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:52,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801973576] [2020-01-16 19:01:52,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:52,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-01-16 19:01:52,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801973576] [2020-01-16 19:01:52,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:52,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:52,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860386375] [2020-01-16 19:01:52,776 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:52,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:52,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:52,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:52,777 INFO L87 Difference]: Start difference. First operand 399 states and 1382 transitions. Second operand 9 states. [2020-01-16 19:01:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:52,878 INFO L93 Difference]: Finished difference Result 688 states and 2045 transitions. [2020-01-16 19:01:52,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:52,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:52,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:52,880 INFO L225 Difference]: With dead ends: 688 [2020-01-16 19:01:52,880 INFO L226 Difference]: Without dead ends: 677 [2020-01-16 19:01:52,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:52,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2020-01-16 19:01:52,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 402. [2020-01-16 19:01:52,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-01-16 19:01:52,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1387 transitions. [2020-01-16 19:01:52,890 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1387 transitions. Word has length 22 [2020-01-16 19:01:52,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:52,890 INFO L478 AbstractCegarLoop]: Abstraction has 402 states and 1387 transitions. [2020-01-16 19:01:52,890 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:52,890 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1387 transitions. [2020-01-16 19:01:52,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:52,890 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:52,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, 1, 1, 1] [2020-01-16 19:01:52,891 INFO L426 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:52,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:52,891 INFO L82 PathProgramCache]: Analyzing trace with hash 130684606, now seen corresponding path program 414 times [2020-01-16 19:01:52,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:52,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330339770] [2020-01-16 19:01:52,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:53,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330339770] [2020-01-16 19:01:53,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:53,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:53,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007621450] [2020-01-16 19:01:53,162 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:53,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:53,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:53,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:53,162 INFO L87 Difference]: Start difference. First operand 402 states and 1387 transitions. Second operand 9 states. [2020-01-16 19:01:53,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:53,264 INFO L93 Difference]: Finished difference Result 691 states and 2048 transitions. [2020-01-16 19:01:53,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:53,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:53,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:53,266 INFO L225 Difference]: With dead ends: 691 [2020-01-16 19:01:53,267 INFO L226 Difference]: Without dead ends: 669 [2020-01-16 19:01:53,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:53,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2020-01-16 19:01:53,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 394. [2020-01-16 19:01:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:01:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1370 transitions. [2020-01-16 19:01:53,277 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1370 transitions. Word has length 22 [2020-01-16 19:01:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:53,277 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1370 transitions. [2020-01-16 19:01:53,277 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1370 transitions. [2020-01-16 19:01:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:53,277 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:53,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, 1, 1, 1] [2020-01-16 19:01:53,278 INFO L426 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:53,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:53,278 INFO L82 PathProgramCache]: Analyzing trace with hash 217524678, now seen corresponding path program 415 times [2020-01-16 19:01:53,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:53,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122306324] [2020-01-16 19:01:53,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:53,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122306324] [2020-01-16 19:01:53,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:53,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:53,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128379240] [2020-01-16 19:01:53,544 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:53,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:53,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:53,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:53,545 INFO L87 Difference]: Start difference. First operand 394 states and 1370 transitions. Second operand 9 states. [2020-01-16 19:01:53,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:53,624 INFO L93 Difference]: Finished difference Result 692 states and 2055 transitions. [2020-01-16 19:01:53,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:53,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:53,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:53,626 INFO L225 Difference]: With dead ends: 692 [2020-01-16 19:01:53,626 INFO L226 Difference]: Without dead ends: 676 [2020-01-16 19:01:53,626 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:53,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2020-01-16 19:01:53,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 402. [2020-01-16 19:01:53,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-01-16 19:01:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1390 transitions. [2020-01-16 19:01:53,635 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1390 transitions. Word has length 22 [2020-01-16 19:01:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:53,635 INFO L478 AbstractCegarLoop]: Abstraction has 402 states and 1390 transitions. [2020-01-16 19:01:53,635 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1390 transitions. [2020-01-16 19:01:53,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:53,635 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01: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, 1, 1, 1] [2020-01-16 19:01:53,636 INFO L426 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:53,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:53,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1807790564, now seen corresponding path program 416 times [2020-01-16 19:01:53,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:53,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163438743] [2020-01-16 19:01:53,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:53,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-01-16 19:01:53,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163438743] [2020-01-16 19:01:53,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:53,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:53,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170692009] [2020-01-16 19:01:53,904 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:53,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:53,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:53,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:53,905 INFO L87 Difference]: Start difference. First operand 402 states and 1390 transitions. Second operand 9 states. [2020-01-16 19:01:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:54,007 INFO L93 Difference]: Finished difference Result 687 states and 2042 transitions. [2020-01-16 19:01:54,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:54,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:54,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:54,009 INFO L225 Difference]: With dead ends: 687 [2020-01-16 19:01:54,009 INFO L226 Difference]: Without dead ends: 672 [2020-01-16 19:01:54,009 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:54,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2020-01-16 19:01:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 398. [2020-01-16 19:01:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 19:01:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1380 transitions. [2020-01-16 19:01:54,019 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1380 transitions. Word has length 22 [2020-01-16 19:01:54,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:54,019 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1380 transitions. [2020-01-16 19:01:54,019 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:54,019 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1380 transitions. [2020-01-16 19:01:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:54,020 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:54,020 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:54,020 INFO L426 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:54,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:54,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1550087606, now seen corresponding path program 417 times [2020-01-16 19:01:54,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:54,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846168023] [2020-01-16 19:01:54,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:54,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-01-16 19:01:54,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846168023] [2020-01-16 19:01:54,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:54,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:54,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331434628] [2020-01-16 19:01:54,296 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:54,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:54,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:54,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:54,297 INFO L87 Difference]: Start difference. First operand 398 states and 1380 transitions. Second operand 9 states. [2020-01-16 19:01:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:54,374 INFO L93 Difference]: Finished difference Result 696 states and 2061 transitions. [2020-01-16 19:01:54,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:54,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:54,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:54,376 INFO L225 Difference]: With dead ends: 696 [2020-01-16 19:01:54,377 INFO L226 Difference]: Without dead ends: 680 [2020-01-16 19:01:54,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:54,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-01-16 19:01:54,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 404. [2020-01-16 19:01:54,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-01-16 19:01:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1390 transitions. [2020-01-16 19:01:54,386 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1390 transitions. Word has length 22 [2020-01-16 19:01:54,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:54,386 INFO L478 AbstractCegarLoop]: Abstraction has 404 states and 1390 transitions. [2020-01-16 19:01:54,386 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1390 transitions. [2020-01-16 19:01:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:54,387 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:54,387 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:54,387 INFO L426 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:54,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:54,387 INFO L82 PathProgramCache]: Analyzing trace with hash -41012422, now seen corresponding path program 418 times [2020-01-16 19:01:54,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:54,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773662180] [2020-01-16 19:01:54,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:54,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-01-16 19:01:54,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773662180] [2020-01-16 19:01:54,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:54,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:54,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089655550] [2020-01-16 19:01:54,654 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:54,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:54,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:54,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:54,655 INFO L87 Difference]: Start difference. First operand 404 states and 1390 transitions. Second operand 9 states. [2020-01-16 19:01:54,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:54,770 INFO L93 Difference]: Finished difference Result 693 states and 2050 transitions. [2020-01-16 19:01:54,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:54,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:54,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:54,772 INFO L225 Difference]: With dead ends: 693 [2020-01-16 19:01:54,772 INFO L226 Difference]: Without dead ends: 674 [2020-01-16 19:01:54,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2020-01-16 19:01:54,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 398. [2020-01-16 19:01:54,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 19:01:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1376 transitions. [2020-01-16 19:01:54,783 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1376 transitions. Word has length 22 [2020-01-16 19:01:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:54,783 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1376 transitions. [2020-01-16 19:01:54,783 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1376 transitions. [2020-01-16 19:01:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:54,784 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:54,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:54,784 INFO L426 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:54,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:54,784 INFO L82 PathProgramCache]: Analyzing trace with hash 334791192, now seen corresponding path program 419 times [2020-01-16 19:01:54,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:54,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106847897] [2020-01-16 19:01:54,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:55,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-01-16 19:01:55,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106847897] [2020-01-16 19:01:55,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:55,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:55,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697883424] [2020-01-16 19:01:55,048 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:55,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:55,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:55,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:55,048 INFO L87 Difference]: Start difference. First operand 398 states and 1376 transitions. Second operand 9 states. [2020-01-16 19:01:55,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:55,149 INFO L93 Difference]: Finished difference Result 683 states and 2031 transitions. [2020-01-16 19:01:55,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:55,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:55,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:55,151 INFO L225 Difference]: With dead ends: 683 [2020-01-16 19:01:55,151 INFO L226 Difference]: Without dead ends: 672 [2020-01-16 19:01:55,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2020-01-16 19:01:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 401. [2020-01-16 19:01:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-01-16 19:01:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1381 transitions. [2020-01-16 19:01:55,161 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1381 transitions. Word has length 22 [2020-01-16 19:01:55,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:55,161 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 1381 transitions. [2020-01-16 19:01:55,162 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1381 transitions. [2020-01-16 19:01:55,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:55,162 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:55,162 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:55,162 INFO L426 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:55,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:55,163 INFO L82 PathProgramCache]: Analyzing trace with hash 2063838526, now seen corresponding path program 420 times [2020-01-16 19:01:55,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:55,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260775835] [2020-01-16 19:01:55,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:55,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-01-16 19:01:55,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260775835] [2020-01-16 19:01:55,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:55,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:55,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634340484] [2020-01-16 19:01:55,430 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:55,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:55,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:55,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:55,430 INFO L87 Difference]: Start difference. First operand 401 states and 1381 transitions. Second operand 9 states. [2020-01-16 19:01:55,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:55,536 INFO L93 Difference]: Finished difference Result 685 states and 2032 transitions. [2020-01-16 19:01:55,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:55,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:55,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:55,538 INFO L225 Difference]: With dead ends: 685 [2020-01-16 19:01:55,538 INFO L226 Difference]: Without dead ends: 665 [2020-01-16 19:01:55,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:55,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2020-01-16 19:01:55,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 394. [2020-01-16 19:01:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:01:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1366 transitions. [2020-01-16 19:01:55,547 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1366 transitions. Word has length 22 [2020-01-16 19:01:55,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:55,547 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1366 transitions. [2020-01-16 19:01:55,548 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:55,548 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1366 transitions. [2020-01-16 19:01:55,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:55,548 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:55,548 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:55,548 INFO L426 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:55,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:55,548 INFO L82 PathProgramCache]: Analyzing trace with hash -312675198, now seen corresponding path program 421 times [2020-01-16 19:01:55,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:55,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056501954] [2020-01-16 19:01:55,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:55,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:55,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056501954] [2020-01-16 19:01:55,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:55,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:55,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392360160] [2020-01-16 19:01:55,841 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:55,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:55,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:55,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:55,841 INFO L87 Difference]: Start difference. First operand 394 states and 1366 transitions. Second operand 9 states. [2020-01-16 19:01:55,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:55,931 INFO L93 Difference]: Finished difference Result 712 states and 2100 transitions. [2020-01-16 19:01:55,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:55,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:55,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:55,933 INFO L225 Difference]: With dead ends: 712 [2020-01-16 19:01:55,933 INFO L226 Difference]: Without dead ends: 696 [2020-01-16 19:01:55,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2020-01-16 19:01:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 410. [2020-01-16 19:01:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-01-16 19:01:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1404 transitions. [2020-01-16 19:01:55,945 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1404 transitions. Word has length 22 [2020-01-16 19:01:55,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:55,945 INFO L478 AbstractCegarLoop]: Abstraction has 410 states and 1404 transitions. [2020-01-16 19:01:55,945 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1404 transitions. [2020-01-16 19:01:55,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:55,946 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:55,946 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:55,946 INFO L426 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:55,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:55,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1810246748, now seen corresponding path program 422 times [2020-01-16 19:01:55,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:55,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976414206] [2020-01-16 19:01:55,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:56,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-01-16 19:01:56,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976414206] [2020-01-16 19:01:56,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:56,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:56,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898836051] [2020-01-16 19:01:56,233 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:56,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:56,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:56,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:56,234 INFO L87 Difference]: Start difference. First operand 410 states and 1404 transitions. Second operand 9 states. [2020-01-16 19:01:56,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:56,334 INFO L93 Difference]: Finished difference Result 710 states and 2090 transitions. [2020-01-16 19:01:56,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:56,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:56,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:56,336 INFO L225 Difference]: With dead ends: 710 [2020-01-16 19:01:56,336 INFO L226 Difference]: Without dead ends: 688 [2020-01-16 19:01:56,336 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2020-01-16 19:01:56,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 402. [2020-01-16 19:01:56,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-01-16 19:01:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1384 transitions. [2020-01-16 19:01:56,346 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1384 transitions. Word has length 22 [2020-01-16 19:01:56,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:56,346 INFO L478 AbstractCegarLoop]: Abstraction has 402 states and 1384 transitions. [2020-01-16 19:01:56,346 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:56,347 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1384 transitions. [2020-01-16 19:01:56,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:56,347 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:56,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, 1, 1, 1] [2020-01-16 19:01:56,347 INFO L426 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:56,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:56,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1176729798, now seen corresponding path program 423 times [2020-01-16 19:01:56,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:56,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524101708] [2020-01-16 19:01:56,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:56,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:56,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524101708] [2020-01-16 19:01:56,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:56,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:56,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917957924] [2020-01-16 19:01:56,637 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:56,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:56,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:56,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:56,637 INFO L87 Difference]: Start difference. First operand 402 states and 1384 transitions. Second operand 9 states. [2020-01-16 19:01:56,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:56,714 INFO L93 Difference]: Finished difference Result 709 states and 2087 transitions. [2020-01-16 19:01:56,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:56,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:56,716 INFO L225 Difference]: With dead ends: 709 [2020-01-16 19:01:56,716 INFO L226 Difference]: Without dead ends: 693 [2020-01-16 19:01:56,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-01-16 19:01:56,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 408. [2020-01-16 19:01:56,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2020-01-16 19:01:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1394 transitions. [2020-01-16 19:01:56,728 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 1394 transitions. Word has length 22 [2020-01-16 19:01:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:56,728 INFO L478 AbstractCegarLoop]: Abstraction has 408 states and 1394 transitions. [2020-01-16 19:01:56,728 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 1394 transitions. [2020-01-16 19:01:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:56,729 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01: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, 1, 1, 1] [2020-01-16 19:01:56,729 INFO L426 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:56,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:56,729 INFO L82 PathProgramCache]: Analyzing trace with hash -414370230, now seen corresponding path program 424 times [2020-01-16 19:01:56,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:56,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933763390] [2020-01-16 19:01:56,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:57,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-01-16 19:01:57,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933763390] [2020-01-16 19:01:57,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:57,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:57,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822896860] [2020-01-16 19:01:57,002 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:57,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:57,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:57,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:57,003 INFO L87 Difference]: Start difference. First operand 408 states and 1394 transitions. Second operand 9 states. [2020-01-16 19:01:57,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:57,105 INFO L93 Difference]: Finished difference Result 706 states and 2076 transitions. [2020-01-16 19:01:57,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:57,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:57,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:57,107 INFO L225 Difference]: With dead ends: 706 [2020-01-16 19:01:57,108 INFO L226 Difference]: Without dead ends: 687 [2020-01-16 19:01:57,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:57,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-01-16 19:01:57,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 402. [2020-01-16 19:01:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-01-16 19:01:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1378 transitions. [2020-01-16 19:01:57,116 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1378 transitions. Word has length 22 [2020-01-16 19:01:57,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:57,117 INFO L478 AbstractCegarLoop]: Abstraction has 402 states and 1378 transitions. [2020-01-16 19:01:57,117 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:57,117 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1378 transitions. [2020-01-16 19:01:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:57,117 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:57,117 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:57,117 INFO L426 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:57,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:57,118 INFO L82 PathProgramCache]: Analyzing trace with hash 430284376, now seen corresponding path program 425 times [2020-01-16 19:01:57,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:57,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277149643] [2020-01-16 19:01:57,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:57,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-01-16 19:01:57,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277149643] [2020-01-16 19:01:57,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:57,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:57,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105393181] [2020-01-16 19:01:57,405 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:57,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:57,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:57,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:57,405 INFO L87 Difference]: Start difference. First operand 402 states and 1378 transitions. Second operand 9 states. [2020-01-16 19:01:57,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:57,510 INFO L93 Difference]: Finished difference Result 704 states and 2073 transitions. [2020-01-16 19:01:57,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:57,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:57,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:57,512 INFO L225 Difference]: With dead ends: 704 [2020-01-16 19:01:57,512 INFO L226 Difference]: Without dead ends: 690 [2020-01-16 19:01:57,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:57,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2020-01-16 19:01:57,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 407. [2020-01-16 19:01:57,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-01-16 19:01:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1387 transitions. [2020-01-16 19:01:57,521 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1387 transitions. Word has length 22 [2020-01-16 19:01:57,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:57,522 INFO L478 AbstractCegarLoop]: Abstraction has 407 states and 1387 transitions. [2020-01-16 19:01:57,522 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:57,522 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1387 transitions. [2020-01-16 19:01:57,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:57,522 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:57,522 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:57,522 INFO L426 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:57,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:57,523 INFO L82 PathProgramCache]: Analyzing trace with hash 485695636, now seen corresponding path program 426 times [2020-01-16 19:01:57,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:57,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139026957] [2020-01-16 19:01:57,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:57,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-01-16 19:01:57,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139026957] [2020-01-16 19:01:57,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:57,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:57,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066930683] [2020-01-16 19:01:57,799 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:57,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:57,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:57,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:57,799 INFO L87 Difference]: Start difference. First operand 407 states and 1387 transitions. Second operand 9 states. [2020-01-16 19:01:57,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:57,903 INFO L93 Difference]: Finished difference Result 703 states and 2066 transitions. [2020-01-16 19:01:57,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:57,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:57,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:57,905 INFO L225 Difference]: With dead ends: 703 [2020-01-16 19:01:57,905 INFO L226 Difference]: Without dead ends: 677 [2020-01-16 19:01:57,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:57,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2020-01-16 19:01:57,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 394. [2020-01-16 19:01:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:01:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1360 transitions. [2020-01-16 19:01:57,915 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1360 transitions. Word has length 22 [2020-01-16 19:01:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:57,915 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1360 transitions. [2020-01-16 19:01:57,915 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:57,915 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1360 transitions. [2020-01-16 19:01:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:57,916 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:57,916 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:57,916 INFO L426 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:57,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:57,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1693910304, now seen corresponding path program 427 times [2020-01-16 19:01:57,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:57,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527067771] [2020-01-16 19:01:57,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:58,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-01-16 19:01:58,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527067771] [2020-01-16 19:01:58,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:58,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:58,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675185161] [2020-01-16 19:01:58,176 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:58,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:58,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:58,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:58,177 INFO L87 Difference]: Start difference. First operand 394 states and 1360 transitions. Second operand 9 states. [2020-01-16 19:01:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:58,283 INFO L93 Difference]: Finished difference Result 679 states and 2021 transitions. [2020-01-16 19:01:58,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:58,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:58,285 INFO L225 Difference]: With dead ends: 679 [2020-01-16 19:01:58,285 INFO L226 Difference]: Without dead ends: 668 [2020-01-16 19:01:58,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:58,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-01-16 19:01:58,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 400. [2020-01-16 19:01:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-01-16 19:01:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1376 transitions. [2020-01-16 19:01:58,295 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1376 transitions. Word has length 22 [2020-01-16 19:01:58,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:58,295 INFO L478 AbstractCegarLoop]: Abstraction has 400 states and 1376 transitions. [2020-01-16 19:01:58,295 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:58,295 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1376 transitions. [2020-01-16 19:01:58,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:58,296 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:58,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, 1, 1, 1] [2020-01-16 19:01:58,296 INFO L426 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:58,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:58,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1712344330, now seen corresponding path program 428 times [2020-01-16 19:01:58,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:58,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059284866] [2020-01-16 19:01:58,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:58,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-01-16 19:01:58,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059284866] [2020-01-16 19:01:58,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:58,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:58,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587668832] [2020-01-16 19:01:58,563 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:58,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:58,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:58,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:58,563 INFO L87 Difference]: Start difference. First operand 400 states and 1376 transitions. Second operand 9 states. [2020-01-16 19:01:58,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:58,665 INFO L93 Difference]: Finished difference Result 682 states and 2024 transitions. [2020-01-16 19:01:58,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:58,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:58,667 INFO L225 Difference]: With dead ends: 682 [2020-01-16 19:01:58,667 INFO L226 Difference]: Without dead ends: 665 [2020-01-16 19:01:58,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:58,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2020-01-16 19:01:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 397. [2020-01-16 19:01:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:01:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1368 transitions. [2020-01-16 19:01:58,677 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1368 transitions. Word has length 22 [2020-01-16 19:01:58,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:58,678 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1368 transitions. [2020-01-16 19:01:58,678 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1368 transitions. [2020-01-16 19:01:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:58,678 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:58,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, 1, 1, 1] [2020-01-16 19:01:58,678 INFO L426 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:58,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1111651996, now seen corresponding path program 429 times [2020-01-16 19:01:58,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:58,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223142369] [2020-01-16 19:01:58,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:58,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-01-16 19:01:58,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223142369] [2020-01-16 19:01:58,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:58,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:58,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816490280] [2020-01-16 19:01:58,941 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:58,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:58,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:58,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:58,942 INFO L87 Difference]: Start difference. First operand 397 states and 1368 transitions. Second operand 9 states. [2020-01-16 19:01:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:59,046 INFO L93 Difference]: Finished difference Result 678 states and 2016 transitions. [2020-01-16 19:01:59,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:59,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:59,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:59,048 INFO L225 Difference]: With dead ends: 678 [2020-01-16 19:01:59,048 INFO L226 Difference]: Without dead ends: 667 [2020-01-16 19:01:59,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2020-01-16 19:01:59,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 400. [2020-01-16 19:01:59,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-01-16 19:01:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1373 transitions. [2020-01-16 19:01:59,058 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1373 transitions. Word has length 22 [2020-01-16 19:01:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:59,058 INFO L478 AbstractCegarLoop]: Abstraction has 400 states and 1373 transitions. [2020-01-16 19:01:59,058 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1373 transitions. [2020-01-16 19:01:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:59,059 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:59,059 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:59,059 INFO L426 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:59,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:59,059 INFO L82 PathProgramCache]: Analyzing trace with hash 617395338, now seen corresponding path program 430 times [2020-01-16 19:01:59,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:59,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315852002] [2020-01-16 19:01:59,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:59,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-01-16 19:01:59,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315852002] [2020-01-16 19:01:59,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:59,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:59,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372499240] [2020-01-16 19:01:59,326 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:59,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:59,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:59,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:59,327 INFO L87 Difference]: Start difference. First operand 400 states and 1373 transitions. Second operand 9 states. [2020-01-16 19:01:59,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:59,431 INFO L93 Difference]: Finished difference Result 680 states and 2017 transitions. [2020-01-16 19:01:59,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:59,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:59,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:59,433 INFO L225 Difference]: With dead ends: 680 [2020-01-16 19:01:59,433 INFO L226 Difference]: Without dead ends: 664 [2020-01-16 19:01:59,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:59,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-01-16 19:01:59,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 397. [2020-01-16 19:01:59,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:01:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1365 transitions. [2020-01-16 19:01:59,444 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1365 transitions. Word has length 22 [2020-01-16 19:01:59,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:59,444 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1365 transitions. [2020-01-16 19:01:59,444 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:59,444 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1365 transitions. [2020-01-16 19:01:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:59,444 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:59,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, 1, 1, 1] [2020-01-16 19:01:59,445 INFO L426 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:59,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:59,445 INFO L82 PathProgramCache]: Analyzing trace with hash -521763164, now seen corresponding path program 431 times [2020-01-16 19:01:59,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:59,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804952857] [2020-01-16 19:01:59,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:59,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-01-16 19:01:59,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804952857] [2020-01-16 19:01:59,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:59,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:01:59,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715183889] [2020-01-16 19:01:59,712 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:01:59,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:59,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:01:59,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:59,712 INFO L87 Difference]: Start difference. First operand 397 states and 1365 transitions. Second operand 9 states. [2020-01-16 19:01:59,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:59,822 INFO L93 Difference]: Finished difference Result 686 states and 2031 transitions. [2020-01-16 19:01:59,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:01:59,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:01:59,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:59,824 INFO L225 Difference]: With dead ends: 686 [2020-01-16 19:01:59,824 INFO L226 Difference]: Without dead ends: 672 [2020-01-16 19:01:59,824 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:01:59,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2020-01-16 19:01:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 402. [2020-01-16 19:01:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-01-16 19:01:59,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1374 transitions. [2020-01-16 19:01:59,834 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1374 transitions. Word has length 22 [2020-01-16 19:01:59,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:59,834 INFO L478 AbstractCegarLoop]: Abstraction has 402 states and 1374 transitions. [2020-01-16 19:01:59,834 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:01:59,834 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1374 transitions. [2020-01-16 19:01:59,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:01:59,834 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:59,834 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:59,834 INFO L426 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:01:59,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:59,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1188850144, now seen corresponding path program 432 times [2020-01-16 19:01:59,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:59,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187009189] [2020-01-16 19:01:59,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:00,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:00,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187009189] [2020-01-16 19:02:00,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:00,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:00,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630881169] [2020-01-16 19:02:00,116 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:00,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:00,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:00,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:00,117 INFO L87 Difference]: Start difference. First operand 402 states and 1374 transitions. Second operand 9 states. [2020-01-16 19:02:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:00,239 INFO L93 Difference]: Finished difference Result 685 states and 2024 transitions. [2020-01-16 19:02:00,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:00,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:00,241 INFO L225 Difference]: With dead ends: 685 [2020-01-16 19:02:00,241 INFO L226 Difference]: Without dead ends: 658 [2020-01-16 19:02:00,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:00,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-01-16 19:02:00,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 388. [2020-01-16 19:02:00,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:02:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1347 transitions. [2020-01-16 19:02:00,251 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1347 transitions. Word has length 22 [2020-01-16 19:02:00,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:00,251 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1347 transitions. [2020-01-16 19:02:00,251 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:00,251 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1347 transitions. [2020-01-16 19:02:00,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:00,251 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:00,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, 1, 1, 1] [2020-01-16 19:02:00,252 INFO L426 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:00,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:00,252 INFO L82 PathProgramCache]: Analyzing trace with hash 856930222, now seen corresponding path program 433 times [2020-01-16 19:02:00,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:00,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537840476] [2020-01-16 19:02:00,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:00,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-01-16 19:02:00,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537840476] [2020-01-16 19:02:00,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:00,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:00,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882206906] [2020-01-16 19:02:00,524 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:00,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:00,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:00,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:00,524 INFO L87 Difference]: Start difference. First operand 388 states and 1347 transitions. Second operand 9 states. [2020-01-16 19:02:00,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:00,614 INFO L93 Difference]: Finished difference Result 682 states and 2018 transitions. [2020-01-16 19:02:00,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:00,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:00,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:00,616 INFO L225 Difference]: With dead ends: 682 [2020-01-16 19:02:00,617 INFO L226 Difference]: Without dead ends: 666 [2020-01-16 19:02:00,617 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:00,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2020-01-16 19:02:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 400. [2020-01-16 19:02:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-01-16 19:02:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1381 transitions. [2020-01-16 19:02:00,626 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1381 transitions. Word has length 22 [2020-01-16 19:02:00,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:00,626 INFO L478 AbstractCegarLoop]: Abstraction has 400 states and 1381 transitions. [2020-01-16 19:02:00,626 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1381 transitions. [2020-01-16 19:02:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:00,627 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:00,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:00,627 INFO L426 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:00,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:00,627 INFO L82 PathProgramCache]: Analyzing trace with hash 983566596, now seen corresponding path program 434 times [2020-01-16 19:02:00,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:00,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088703897] [2020-01-16 19:02:00,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:00,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:00,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088703897] [2020-01-16 19:02:00,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:00,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:00,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917173501] [2020-01-16 19:02:00,912 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:00,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:00,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:00,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:00,912 INFO L87 Difference]: Start difference. First operand 400 states and 1381 transitions. Second operand 9 states. [2020-01-16 19:02:01,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:01,013 INFO L93 Difference]: Finished difference Result 676 states and 2004 transitions. [2020-01-16 19:02:01,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:01,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:01,017 INFO L225 Difference]: With dead ends: 676 [2020-01-16 19:02:01,017 INFO L226 Difference]: Without dead ends: 663 [2020-01-16 19:02:01,017 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:01,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2020-01-16 19:02:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 397. [2020-01-16 19:02:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:02:01,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1374 transitions. [2020-01-16 19:02:01,025 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1374 transitions. Word has length 22 [2020-01-16 19:02:01,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:01,025 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1374 transitions. [2020-01-16 19:02:01,025 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:01,025 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1374 transitions. [2020-01-16 19:02:01,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:01,026 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:01,026 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:01,026 INFO L426 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:01,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:01,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1829721892, now seen corresponding path program 435 times [2020-01-16 19:02:01,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:01,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930378171] [2020-01-16 19:02:01,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:01,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-01-16 19:02:01,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930378171] [2020-01-16 19:02:01,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:01,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:01,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491203754] [2020-01-16 19:02:01,308 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:01,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:01,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:01,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:01,308 INFO L87 Difference]: Start difference. First operand 397 states and 1374 transitions. Second operand 9 states. [2020-01-16 19:02:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:01,382 INFO L93 Difference]: Finished difference Result 691 states and 2036 transitions. [2020-01-16 19:02:01,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:01,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:01,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:01,384 INFO L225 Difference]: With dead ends: 691 [2020-01-16 19:02:01,384 INFO L226 Difference]: Without dead ends: 675 [2020-01-16 19:02:01,384 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2020-01-16 19:02:01,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 405. [2020-01-16 19:02:01,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-01-16 19:02:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1387 transitions. [2020-01-16 19:02:01,394 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1387 transitions. Word has length 22 [2020-01-16 19:02:01,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:01,395 INFO L478 AbstractCegarLoop]: Abstraction has 405 states and 1387 transitions. [2020-01-16 19:02:01,395 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1387 transitions. [2020-01-16 19:02:01,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:01,395 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:01,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, 1, 1, 1] [2020-01-16 19:02:01,395 INFO L426 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:01,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:01,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1815799812, now seen corresponding path program 436 times [2020-01-16 19:02:01,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:01,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022061783] [2020-01-16 19:02:01,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:01,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-01-16 19:02:01,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022061783] [2020-01-16 19:02:01,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:01,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:01,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715436920] [2020-01-16 19:02:01,661 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:01,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:01,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:01,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:01,661 INFO L87 Difference]: Start difference. First operand 405 states and 1387 transitions. Second operand 9 states. [2020-01-16 19:02:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:01,763 INFO L93 Difference]: Finished difference Result 689 states and 2026 transitions. [2020-01-16 19:02:01,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:01,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:01,765 INFO L225 Difference]: With dead ends: 689 [2020-01-16 19:02:01,765 INFO L226 Difference]: Without dead ends: 667 [2020-01-16 19:02:01,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:01,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2020-01-16 19:02:01,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 397. [2020-01-16 19:02:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:02:01,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1370 transitions. [2020-01-16 19:02:01,775 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1370 transitions. Word has length 22 [2020-01-16 19:02:01,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:01,775 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1370 transitions. [2020-01-16 19:02:01,775 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1370 transitions. [2020-01-16 19:02:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:01,776 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:01,776 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:01,776 INFO L426 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:01,776 INFO L82 PathProgramCache]: Analyzing trace with hash 445711018, now seen corresponding path program 437 times [2020-01-16 19:02:01,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:01,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770993261] [2020-01-16 19:02:01,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:02,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770993261] [2020-01-16 19:02:02,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:02,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:02,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934747014] [2020-01-16 19:02:02,033 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:02,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:02,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:02,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:02,034 INFO L87 Difference]: Start difference. First operand 397 states and 1370 transitions. Second operand 9 states. [2020-01-16 19:02:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:02,131 INFO L93 Difference]: Finished difference Result 673 states and 1995 transitions. [2020-01-16 19:02:02,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:02,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:02,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:02,133 INFO L225 Difference]: With dead ends: 673 [2020-01-16 19:02:02,133 INFO L226 Difference]: Without dead ends: 663 [2020-01-16 19:02:02,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:02,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2020-01-16 19:02:02,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 399. [2020-01-16 19:02:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:02:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1373 transitions. [2020-01-16 19:02:02,142 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1373 transitions. Word has length 22 [2020-01-16 19:02:02,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:02,142 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1373 transitions. [2020-01-16 19:02:02,142 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1373 transitions. [2020-01-16 19:02:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:02,143 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:02,143 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:02,143 INFO L426 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:02,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:02,143 INFO L82 PathProgramCache]: Analyzing trace with hash -472239172, now seen corresponding path program 438 times [2020-01-16 19:02:02,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:02,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103393850] [2020-01-16 19:02:02,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:02,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103393850] [2020-01-16 19:02:02,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:02,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:02,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416711221] [2020-01-16 19:02:02,403 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:02,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:02,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:02,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:02,404 INFO L87 Difference]: Start difference. First operand 399 states and 1373 transitions. Second operand 9 states. [2020-01-16 19:02:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:02,510 INFO L93 Difference]: Finished difference Result 677 states and 2001 transitions. [2020-01-16 19:02:02,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:02,511 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:02,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:02,512 INFO L225 Difference]: With dead ends: 677 [2020-01-16 19:02:02,512 INFO L226 Difference]: Without dead ends: 657 [2020-01-16 19:02:02,513 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:02,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-01-16 19:02:02,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 393. [2020-01-16 19:02:02,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:02:02,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1361 transitions. [2020-01-16 19:02:02,522 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1361 transitions. Word has length 22 [2020-01-16 19:02:02,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:02,522 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1361 transitions. [2020-01-16 19:02:02,523 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:02,523 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1361 transitions. [2020-01-16 19:02:02,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:02,523 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:02,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, 1, 1, 1] [2020-01-16 19:02:02,523 INFO L426 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:02,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:02,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1951021810, now seen corresponding path program 439 times [2020-01-16 19:02:02,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:02,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712480390] [2020-01-16 19:02:02,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:02,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-01-16 19:02:02,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712480390] [2020-01-16 19:02:02,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:02,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:02,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974903432] [2020-01-16 19:02:02,786 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:02,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:02,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:02,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:02,786 INFO L87 Difference]: Start difference. First operand 393 states and 1361 transitions. Second operand 9 states. [2020-01-16 19:02:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:02,865 INFO L93 Difference]: Finished difference Result 678 states and 2006 transitions. [2020-01-16 19:02:02,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:02,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:02,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:02,867 INFO L225 Difference]: With dead ends: 678 [2020-01-16 19:02:02,867 INFO L226 Difference]: Without dead ends: 662 [2020-01-16 19:02:02,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:02,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-01-16 19:02:02,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 399. [2020-01-16 19:02:02,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:02:02,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1375 transitions. [2020-01-16 19:02:02,876 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1375 transitions. Word has length 22 [2020-01-16 19:02:02,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:02,876 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1375 transitions. [2020-01-16 19:02:02,876 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:02,876 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1375 transitions. [2020-01-16 19:02:02,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:02,877 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:02,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:02,877 INFO L426 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:02,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:02,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2077658184, now seen corresponding path program 440 times [2020-01-16 19:02:02,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:02,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121936315] [2020-01-16 19:02:02,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:03,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-01-16 19:02:03,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121936315] [2020-01-16 19:02:03,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:03,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:03,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531423004] [2020-01-16 19:02:03,144 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:03,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:03,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:03,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:03,144 INFO L87 Difference]: Start difference. First operand 399 states and 1375 transitions. Second operand 9 states. [2020-01-16 19:02:03,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:03,246 INFO L93 Difference]: Finished difference Result 672 states and 1992 transitions. [2020-01-16 19:02:03,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:03,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:03,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:03,248 INFO L225 Difference]: With dead ends: 672 [2020-01-16 19:02:03,249 INFO L226 Difference]: Without dead ends: 659 [2020-01-16 19:02:03,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:03,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2020-01-16 19:02:03,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 396. [2020-01-16 19:02:03,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:02:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1368 transitions. [2020-01-16 19:02:03,258 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1368 transitions. Word has length 22 [2020-01-16 19:02:03,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:03,258 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1368 transitions. [2020-01-16 19:02:03,258 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:03,258 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1368 transitions. [2020-01-16 19:02:03,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:03,259 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:03,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, 1, 1, 1] [2020-01-16 19:02:03,259 INFO L426 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:03,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:03,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1808715684, now seen corresponding path program 441 times [2020-01-16 19:02:03,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:03,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106911712] [2020-01-16 19:02:03,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:03,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-01-16 19:02:03,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106911712] [2020-01-16 19:02:03,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:03,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:03,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212085708] [2020-01-16 19:02:03,530 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:03,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:03,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:03,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:03,531 INFO L87 Difference]: Start difference. First operand 396 states and 1368 transitions. Second operand 9 states. [2020-01-16 19:02:03,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:03,606 INFO L93 Difference]: Finished difference Result 684 states and 2018 transitions. [2020-01-16 19:02:03,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:03,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:03,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:03,608 INFO L225 Difference]: With dead ends: 684 [2020-01-16 19:02:03,608 INFO L226 Difference]: Without dead ends: 668 [2020-01-16 19:02:03,609 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:03,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-01-16 19:02:03,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 402. [2020-01-16 19:02:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-01-16 19:02:03,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1378 transitions. [2020-01-16 19:02:03,618 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1378 transitions. Word has length 22 [2020-01-16 19:02:03,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:03,618 INFO L478 AbstractCegarLoop]: Abstraction has 402 states and 1378 transitions. [2020-01-16 19:02:03,618 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:03,618 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1378 transitions. [2020-01-16 19:02:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:03,618 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:03,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, 1, 1, 1] [2020-01-16 19:02:03,619 INFO L426 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:03,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:03,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1062284758, now seen corresponding path program 442 times [2020-01-16 19:02:03,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:03,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716820649] [2020-01-16 19:02:03,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:03,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716820649] [2020-01-16 19:02:03,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:03,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:03,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430943336] [2020-01-16 19:02:03,888 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:03,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:03,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:03,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:03,888 INFO L87 Difference]: Start difference. First operand 402 states and 1378 transitions. Second operand 9 states. [2020-01-16 19:02:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:03,991 INFO L93 Difference]: Finished difference Result 681 states and 2007 transitions. [2020-01-16 19:02:03,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:03,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:03,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:03,993 INFO L225 Difference]: With dead ends: 681 [2020-01-16 19:02:03,993 INFO L226 Difference]: Without dead ends: 662 [2020-01-16 19:02:03,994 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:03,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-01-16 19:02:04,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 396. [2020-01-16 19:02:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:02:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1365 transitions. [2020-01-16 19:02:04,002 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1365 transitions. Word has length 22 [2020-01-16 19:02:04,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:04,003 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1365 transitions. [2020-01-16 19:02:04,003 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:04,003 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1365 transitions. [2020-01-16 19:02:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:04,003 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:04,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, 1, 1, 1] [2020-01-16 19:02:04,003 INFO L426 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:04,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:04,004 INFO L82 PathProgramCache]: Analyzing trace with hash 466717226, now seen corresponding path program 443 times [2020-01-16 19:02:04,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:04,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846157926] [2020-01-16 19:02:04,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:04,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-01-16 19:02:04,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846157926] [2020-01-16 19:02:04,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:04,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:04,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488697107] [2020-01-16 19:02:04,277 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:04,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:04,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:04,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:04,277 INFO L87 Difference]: Start difference. First operand 396 states and 1365 transitions. Second operand 9 states. [2020-01-16 19:02:04,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:04,399 INFO L93 Difference]: Finished difference Result 668 states and 1982 transitions. [2020-01-16 19:02:04,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:04,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:04,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:04,401 INFO L225 Difference]: With dead ends: 668 [2020-01-16 19:02:04,401 INFO L226 Difference]: Without dead ends: 658 [2020-01-16 19:02:04,401 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:04,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-01-16 19:02:04,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 398. [2020-01-16 19:02:04,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 19:02:04,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1368 transitions. [2020-01-16 19:02:04,410 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1368 transitions. Word has length 22 [2020-01-16 19:02:04,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:04,411 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1368 transitions. [2020-01-16 19:02:04,411 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:04,411 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1368 transitions. [2020-01-16 19:02:04,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:04,411 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:04,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, 1, 1, 1] [2020-01-16 19:02:04,411 INFO L426 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:04,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:04,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1038172032, now seen corresponding path program 444 times [2020-01-16 19:02:04,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:04,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40156584] [2020-01-16 19:02:04,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:04,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-01-16 19:02:04,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40156584] [2020-01-16 19:02:04,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:04,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:04,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912099762] [2020-01-16 19:02:04,676 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:04,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:04,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:04,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:04,677 INFO L87 Difference]: Start difference. First operand 398 states and 1368 transitions. Second operand 9 states. [2020-01-16 19:02:04,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:04,778 INFO L93 Difference]: Finished difference Result 671 states and 1986 transitions. [2020-01-16 19:02:04,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:04,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:04,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:04,780 INFO L225 Difference]: With dead ends: 671 [2020-01-16 19:02:04,780 INFO L226 Difference]: Without dead ends: 653 [2020-01-16 19:02:04,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:04,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-01-16 19:02:04,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 393. [2020-01-16 19:02:04,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:02:04,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1358 transitions. [2020-01-16 19:02:04,790 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1358 transitions. Word has length 22 [2020-01-16 19:02:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:04,790 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1358 transitions. [2020-01-16 19:02:04,790 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:04,790 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1358 transitions. [2020-01-16 19:02:04,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:04,791 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:04,791 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:04,791 INFO L426 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:04,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:04,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1877500082, now seen corresponding path program 445 times [2020-01-16 19:02:04,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:04,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891988900] [2020-01-16 19:02:04,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:05,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-01-16 19:02:05,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891988900] [2020-01-16 19:02:05,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:05,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:05,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289451404] [2020-01-16 19:02:05,080 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:05,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:05,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:05,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:05,081 INFO L87 Difference]: Start difference. First operand 393 states and 1358 transitions. Second operand 9 states. [2020-01-16 19:02:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:05,173 INFO L93 Difference]: Finished difference Result 704 states and 2069 transitions. [2020-01-16 19:02:05,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:05,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:05,175 INFO L225 Difference]: With dead ends: 704 [2020-01-16 19:02:05,175 INFO L226 Difference]: Without dead ends: 688 [2020-01-16 19:02:05,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:05,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2020-01-16 19:02:05,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 409. [2020-01-16 19:02:05,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2020-01-16 19:02:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1396 transitions. [2020-01-16 19:02:05,185 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1396 transitions. Word has length 22 [2020-01-16 19:02:05,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:05,185 INFO L478 AbstractCegarLoop]: Abstraction has 409 states and 1396 transitions. [2020-01-16 19:02:05,185 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:05,185 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1396 transitions. [2020-01-16 19:02:05,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:05,185 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:05,185 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:05,186 INFO L426 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:05,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:05,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1228054490, now seen corresponding path program 446 times [2020-01-16 19:02:05,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:05,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365539745] [2020-01-16 19:02:05,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:05,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-01-16 19:02:05,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365539745] [2020-01-16 19:02:05,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:05,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:05,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576380801] [2020-01-16 19:02:05,465 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:05,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:05,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:05,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:05,465 INFO L87 Difference]: Start difference. First operand 409 states and 1396 transitions. Second operand 9 states. [2020-01-16 19:02:05,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:05,566 INFO L93 Difference]: Finished difference Result 702 states and 2059 transitions. [2020-01-16 19:02:05,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:05,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:05,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:05,567 INFO L225 Difference]: With dead ends: 702 [2020-01-16 19:02:05,568 INFO L226 Difference]: Without dead ends: 680 [2020-01-16 19:02:05,568 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-01-16 19:02:05,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 401. [2020-01-16 19:02:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-01-16 19:02:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1376 transitions. [2020-01-16 19:02:05,577 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1376 transitions. Word has length 22 [2020-01-16 19:02:05,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:05,577 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 1376 transitions. [2020-01-16 19:02:05,577 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1376 transitions. [2020-01-16 19:02:05,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:05,578 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:05,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, 1, 1, 1] [2020-01-16 19:02:05,578 INFO L426 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:05,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:05,578 INFO L82 PathProgramCache]: Analyzing trace with hash 804414702, now seen corresponding path program 447 times [2020-01-16 19:02:05,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:05,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504831030] [2020-01-16 19:02:05,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:05,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-01-16 19:02:05,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504831030] [2020-01-16 19:02:05,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:05,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:05,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573854821] [2020-01-16 19:02:05,872 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:05,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:05,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:05,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:05,873 INFO L87 Difference]: Start difference. First operand 401 states and 1376 transitions. Second operand 9 states. [2020-01-16 19:02:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:05,948 INFO L93 Difference]: Finished difference Result 701 states and 2056 transitions. [2020-01-16 19:02:05,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:05,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:05,950 INFO L225 Difference]: With dead ends: 701 [2020-01-16 19:02:05,950 INFO L226 Difference]: Without dead ends: 685 [2020-01-16 19:02:05,950 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:05,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2020-01-16 19:02:05,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 407. [2020-01-16 19:02:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-01-16 19:02:05,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1386 transitions. [2020-01-16 19:02:05,960 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1386 transitions. Word has length 22 [2020-01-16 19:02:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:05,960 INFO L478 AbstractCegarLoop]: Abstraction has 407 states and 1386 transitions. [2020-01-16 19:02:05,960 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1386 transitions. [2020-01-16 19:02:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:05,961 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:05,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, 1, 1, 1] [2020-01-16 19:02:05,961 INFO L426 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:05,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:05,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1550845628, now seen corresponding path program 448 times [2020-01-16 19:02:05,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:05,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353403793] [2020-01-16 19:02:05,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:06,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-01-16 19:02:06,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353403793] [2020-01-16 19:02:06,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:06,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:06,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412396462] [2020-01-16 19:02:06,251 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:06,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:06,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:06,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:06,251 INFO L87 Difference]: Start difference. First operand 407 states and 1386 transitions. Second operand 9 states. [2020-01-16 19:02:06,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:06,354 INFO L93 Difference]: Finished difference Result 698 states and 2045 transitions. [2020-01-16 19:02:06,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:06,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:06,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:06,356 INFO L225 Difference]: With dead ends: 698 [2020-01-16 19:02:06,356 INFO L226 Difference]: Without dead ends: 679 [2020-01-16 19:02:06,357 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:06,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2020-01-16 19:02:06,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 401. [2020-01-16 19:02:06,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-01-16 19:02:06,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1370 transitions. [2020-01-16 19:02:06,366 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1370 transitions. Word has length 22 [2020-01-16 19:02:06,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:06,367 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 1370 transitions. [2020-01-16 19:02:06,367 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:06,367 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1370 transitions. [2020-01-16 19:02:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:06,367 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:06,367 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:06,367 INFO L426 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:06,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:06,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1377366140, now seen corresponding path program 449 times [2020-01-16 19:02:06,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:06,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130144443] [2020-01-16 19:02:06,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:06,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-01-16 19:02:06,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130144443] [2020-01-16 19:02:06,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:06,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:06,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210884677] [2020-01-16 19:02:06,642 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:06,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:06,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:06,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:06,642 INFO L87 Difference]: Start difference. First operand 401 states and 1370 transitions. Second operand 9 states. [2020-01-16 19:02:06,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:06,745 INFO L93 Difference]: Finished difference Result 696 states and 2042 transitions. [2020-01-16 19:02:06,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:06,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:06,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:06,747 INFO L225 Difference]: With dead ends: 696 [2020-01-16 19:02:06,747 INFO L226 Difference]: Without dead ends: 682 [2020-01-16 19:02:06,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:06,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2020-01-16 19:02:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 406. [2020-01-16 19:02:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-01-16 19:02:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1379 transitions. [2020-01-16 19:02:06,758 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1379 transitions. Word has length 22 [2020-01-16 19:02:06,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:06,758 INFO L478 AbstractCegarLoop]: Abstraction has 406 states and 1379 transitions. [2020-01-16 19:02:06,758 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1379 transitions. [2020-01-16 19:02:06,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:06,759 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:06,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, 1, 1, 1] [2020-01-16 19:02:06,759 INFO L426 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:06,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:06,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1321954880, now seen corresponding path program 450 times [2020-01-16 19:02:06,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:06,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27615803] [2020-01-16 19:02:06,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:07,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27615803] [2020-01-16 19:02:07,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:07,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:07,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391294837] [2020-01-16 19:02:07,037 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:07,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:07,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:07,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:07,037 INFO L87 Difference]: Start difference. First operand 406 states and 1379 transitions. Second operand 9 states. [2020-01-16 19:02:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:07,148 INFO L93 Difference]: Finished difference Result 695 states and 2035 transitions. [2020-01-16 19:02:07,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:07,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:07,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:07,150 INFO L225 Difference]: With dead ends: 695 [2020-01-16 19:02:07,150 INFO L226 Difference]: Without dead ends: 669 [2020-01-16 19:02:07,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:07,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2020-01-16 19:02:07,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 393. [2020-01-16 19:02:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:02:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1353 transitions. [2020-01-16 19:02:07,159 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1353 transitions. Word has length 22 [2020-01-16 19:02:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:07,159 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1353 transitions. [2020-01-16 19:02:07,159 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1353 transitions. [2020-01-16 19:02:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:07,160 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:07,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, 1, 1, 1] [2020-01-16 19:02:07,160 INFO L426 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:07,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:07,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2046148872, now seen corresponding path program 451 times [2020-01-16 19:02:07,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:07,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603933942] [2020-01-16 19:02:07,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:07,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603933942] [2020-01-16 19:02:07,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:07,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:07,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827561813] [2020-01-16 19:02:07,424 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:07,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:07,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:07,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:07,425 INFO L87 Difference]: Start difference. First operand 393 states and 1353 transitions. Second operand 9 states. [2020-01-16 19:02:07,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:07,527 INFO L93 Difference]: Finished difference Result 664 states and 1972 transitions. [2020-01-16 19:02:07,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:07,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:07,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:07,529 INFO L225 Difference]: With dead ends: 664 [2020-01-16 19:02:07,530 INFO L226 Difference]: Without dead ends: 654 [2020-01-16 19:02:07,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:07,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2020-01-16 19:02:07,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 397. [2020-01-16 19:02:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:02:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1363 transitions. [2020-01-16 19:02:07,539 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1363 transitions. Word has length 22 [2020-01-16 19:02:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:07,539 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1363 transitions. [2020-01-16 19:02:07,539 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1363 transitions. [2020-01-16 19:02:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:07,540 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:07,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, 1, 1, 1] [2020-01-16 19:02:07,540 INFO L426 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:07,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:07,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1128198682, now seen corresponding path program 452 times [2020-01-16 19:02:07,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:07,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808418426] [2020-01-16 19:02:07,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:07,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:07,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808418426] [2020-01-16 19:02:07,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:07,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:07,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638606939] [2020-01-16 19:02:07,798 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:07,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:07,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:07,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:07,798 INFO L87 Difference]: Start difference. First operand 397 states and 1363 transitions. Second operand 9 states. [2020-01-16 19:02:07,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:07,903 INFO L93 Difference]: Finished difference Result 668 states and 1978 transitions. [2020-01-16 19:02:07,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:07,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:07,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:07,905 INFO L225 Difference]: With dead ends: 668 [2020-01-16 19:02:07,905 INFO L226 Difference]: Without dead ends: 652 [2020-01-16 19:02:07,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:07,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2020-01-16 19:02:07,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 395. [2020-01-16 19:02:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:02:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1358 transitions. [2020-01-16 19:02:07,915 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1358 transitions. Word has length 22 [2020-01-16 19:02:07,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:07,915 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1358 transitions. [2020-01-16 19:02:07,915 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:07,915 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1358 transitions. [2020-01-16 19:02:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:07,915 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:07,915 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:07,916 INFO L426 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:07,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:07,916 INFO L82 PathProgramCache]: Analyzing trace with hash 973063492, now seen corresponding path program 453 times [2020-01-16 19:02:07,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:07,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920843567] [2020-01-16 19:02:07,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:08,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-01-16 19:02:08,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920843567] [2020-01-16 19:02:08,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:08,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:08,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068205449] [2020-01-16 19:02:08,183 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:08,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:08,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:08,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:08,184 INFO L87 Difference]: Start difference. First operand 395 states and 1358 transitions. Second operand 9 states. [2020-01-16 19:02:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:08,305 INFO L93 Difference]: Finished difference Result 663 states and 1968 transitions. [2020-01-16 19:02:08,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:08,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:08,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:08,307 INFO L225 Difference]: With dead ends: 663 [2020-01-16 19:02:08,307 INFO L226 Difference]: Without dead ends: 653 [2020-01-16 19:02:08,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:08,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-01-16 19:02:08,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 397. [2020-01-16 19:02:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:02:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1361 transitions. [2020-01-16 19:02:08,317 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1361 transitions. Word has length 22 [2020-01-16 19:02:08,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:08,317 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1361 transitions. [2020-01-16 19:02:08,317 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:08,317 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1361 transitions. [2020-01-16 19:02:08,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:08,318 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:08,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, 1, 1, 1] [2020-01-16 19:02:08,318 INFO L426 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:08,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:08,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1544518298, now seen corresponding path program 454 times [2020-01-16 19:02:08,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:08,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253846109] [2020-01-16 19:02:08,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:08,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-01-16 19:02:08,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253846109] [2020-01-16 19:02:08,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:08,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:08,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363529730] [2020-01-16 19:02:08,579 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:08,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:08,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:08,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:08,579 INFO L87 Difference]: Start difference. First operand 397 states and 1361 transitions. Second operand 9 states. [2020-01-16 19:02:08,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:08,687 INFO L93 Difference]: Finished difference Result 666 states and 1972 transitions. [2020-01-16 19:02:08,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:08,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:08,689 INFO L225 Difference]: With dead ends: 666 [2020-01-16 19:02:08,689 INFO L226 Difference]: Without dead ends: 651 [2020-01-16 19:02:08,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2020-01-16 19:02:08,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 395. [2020-01-16 19:02:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:02:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1356 transitions. [2020-01-16 19:02:08,699 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1356 transitions. Word has length 22 [2020-01-16 19:02:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:08,699 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1356 transitions. [2020-01-16 19:02:08,699 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1356 transitions. [2020-01-16 19:02:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:08,700 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:08,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, 1, 1, 1] [2020-01-16 19:02:08,700 INFO L426 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:08,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:08,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1663428484, now seen corresponding path program 455 times [2020-01-16 19:02:08,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:08,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45762935] [2020-01-16 19:02:08,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:08,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45762935] [2020-01-16 19:02:08,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:08,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:08,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738112488] [2020-01-16 19:02:08,974 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:08,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:08,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:08,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:08,974 INFO L87 Difference]: Start difference. First operand 395 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:02:09,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:09,075 INFO L93 Difference]: Finished difference Result 674 states and 1991 transitions. [2020-01-16 19:02:09,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:09,075 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:09,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:09,077 INFO L225 Difference]: With dead ends: 674 [2020-01-16 19:02:09,077 INFO L226 Difference]: Without dead ends: 660 [2020-01-16 19:02:09,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:09,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2020-01-16 19:02:09,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 400. [2020-01-16 19:02:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-01-16 19:02:09,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1365 transitions. [2020-01-16 19:02:09,087 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1365 transitions. Word has length 22 [2020-01-16 19:02:09,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:09,087 INFO L478 AbstractCegarLoop]: Abstraction has 400 states and 1365 transitions. [2020-01-16 19:02:09,087 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:09,087 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1365 transitions. [2020-01-16 19:02:09,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:09,088 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:09,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, 1, 1, 1] [2020-01-16 19:02:09,088 INFO L426 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:09,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:09,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1142133816, now seen corresponding path program 456 times [2020-01-16 19:02:09,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:09,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765532400] [2020-01-16 19:02:09,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:09,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-01-16 19:02:09,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765532400] [2020-01-16 19:02:09,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:09,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:09,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308910844] [2020-01-16 19:02:09,355 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:09,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:09,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:09,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:09,355 INFO L87 Difference]: Start difference. First operand 400 states and 1365 transitions. Second operand 9 states. [2020-01-16 19:02:09,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:09,468 INFO L93 Difference]: Finished difference Result 673 states and 1984 transitions. [2020-01-16 19:02:09,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:09,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:09,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:09,470 INFO L225 Difference]: With dead ends: 673 [2020-01-16 19:02:09,470 INFO L226 Difference]: Without dead ends: 648 [2020-01-16 19:02:09,470 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:09,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-01-16 19:02:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 388. [2020-01-16 19:02:09,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:02:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1342 transitions. [2020-01-16 19:02:09,479 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1342 transitions. Word has length 22 [2020-01-16 19:02:09,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:09,479 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1342 transitions. [2020-01-16 19:02:09,479 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:09,479 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1342 transitions. [2020-01-16 19:02:09,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:09,480 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:09,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, 1, 1, 1] [2020-01-16 19:02:09,480 INFO L426 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:09,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:09,480 INFO L82 PathProgramCache]: Analyzing trace with hash -780259124, now seen corresponding path program 457 times [2020-01-16 19:02:09,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:09,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827948324] [2020-01-16 19:02:09,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:09,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-01-16 19:02:09,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827948324] [2020-01-16 19:02:09,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:09,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:09,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498408098] [2020-01-16 19:02:09,737 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:09,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:09,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:09,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:09,737 INFO L87 Difference]: Start difference. First operand 388 states and 1342 transitions. Second operand 9 states. [2020-01-16 19:02:09,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:09,842 INFO L93 Difference]: Finished difference Result 633 states and 1903 transitions. [2020-01-16 19:02:09,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:09,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:09,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:09,843 INFO L225 Difference]: With dead ends: 633 [2020-01-16 19:02:09,844 INFO L226 Difference]: Without dead ends: 622 [2020-01-16 19:02:09,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:09,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-01-16 19:02:09,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 394. [2020-01-16 19:02:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:02:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1361 transitions. [2020-01-16 19:02:09,853 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1361 transitions. Word has length 22 [2020-01-16 19:02:09,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:09,854 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1361 transitions. [2020-01-16 19:02:09,854 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:09,854 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1361 transitions. [2020-01-16 19:02:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:09,854 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:09,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, 1, 1, 1] [2020-01-16 19:02:09,854 INFO L426 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:09,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:09,855 INFO L82 PathProgramCache]: Analyzing trace with hash 561673664, now seen corresponding path program 458 times [2020-01-16 19:02:09,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:09,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296961279] [2020-01-16 19:02:09,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:10,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296961279] [2020-01-16 19:02:10,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:10,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:10,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176433012] [2020-01-16 19:02:10,110 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:10,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:10,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:10,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:10,111 INFO L87 Difference]: Start difference. First operand 394 states and 1361 transitions. Second operand 9 states. [2020-01-16 19:02:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:10,233 INFO L93 Difference]: Finished difference Result 632 states and 1899 transitions. [2020-01-16 19:02:10,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:10,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:10,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:10,234 INFO L225 Difference]: With dead ends: 632 [2020-01-16 19:02:10,235 INFO L226 Difference]: Without dead ends: 620 [2020-01-16 19:02:10,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-01-16 19:02:10,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 392. [2020-01-16 19:02:10,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:10,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1356 transitions. [2020-01-16 19:02:10,244 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1356 transitions. Word has length 22 [2020-01-16 19:02:10,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:10,244 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1356 transitions. [2020-01-16 19:02:10,244 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1356 transitions. [2020-01-16 19:02:10,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:10,245 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:10,245 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:10,245 INFO L426 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:10,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:10,245 INFO L82 PathProgramCache]: Analyzing trace with hash 828056058, now seen corresponding path program 459 times [2020-01-16 19:02:10,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:10,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178752366] [2020-01-16 19:02:10,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:10,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178752366] [2020-01-16 19:02:10,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:10,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:10,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807498954] [2020-01-16 19:02:10,496 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:10,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:10,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:10,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:10,497 INFO L87 Difference]: Start difference. First operand 392 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:02:10,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:10,599 INFO L93 Difference]: Finished difference Result 638 states and 1912 transitions. [2020-01-16 19:02:10,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:10,600 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:10,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:10,601 INFO L225 Difference]: With dead ends: 638 [2020-01-16 19:02:10,601 INFO L226 Difference]: Without dead ends: 627 [2020-01-16 19:02:10,601 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:10,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-01-16 19:02:10,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 395. [2020-01-16 19:02:10,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:02:10,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1361 transitions. [2020-01-16 19:02:10,611 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1361 transitions. Word has length 22 [2020-01-16 19:02:10,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:10,611 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1361 transitions. [2020-01-16 19:02:10,611 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:10,611 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1361 transitions. [2020-01-16 19:02:10,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:10,612 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:10,612 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:10,612 INFO L426 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:10,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:10,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1694616042, now seen corresponding path program 460 times [2020-01-16 19:02:10,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:10,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572231770] [2020-01-16 19:02:10,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:10,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-01-16 19:02:10,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572231770] [2020-01-16 19:02:10,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:10,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:10,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064127603] [2020-01-16 19:02:10,884 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:10,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:10,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:10,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:10,885 INFO L87 Difference]: Start difference. First operand 395 states and 1361 transitions. Second operand 9 states. [2020-01-16 19:02:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:10,993 INFO L93 Difference]: Finished difference Result 641 states and 1915 transitions. [2020-01-16 19:02:10,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:10,993 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:10,995 INFO L225 Difference]: With dead ends: 641 [2020-01-16 19:02:10,995 INFO L226 Difference]: Without dead ends: 624 [2020-01-16 19:02:10,995 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:11,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-01-16 19:02:11,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 392. [2020-01-16 19:02:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1354 transitions. [2020-01-16 19:02:11,004 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1354 transitions. Word has length 22 [2020-01-16 19:02:11,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:11,005 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1354 transitions. [2020-01-16 19:02:11,005 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:11,005 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1354 transitions. [2020-01-16 19:02:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:11,005 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:11,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, 1, 1, 1] [2020-01-16 19:02:11,005 INFO L426 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:11,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:11,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1096903466, now seen corresponding path program 461 times [2020-01-16 19:02:11,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:11,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607610888] [2020-01-16 19:02:11,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:11,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:11,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607610888] [2020-01-16 19:02:11,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:11,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:11,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112452530] [2020-01-16 19:02:11,252 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:11,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:11,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:11,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:11,252 INFO L87 Difference]: Start difference. First operand 392 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:02:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:11,370 INFO L93 Difference]: Finished difference Result 635 states and 1903 transitions. [2020-01-16 19:02:11,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:11,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:11,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:11,371 INFO L225 Difference]: With dead ends: 635 [2020-01-16 19:02:11,371 INFO L226 Difference]: Without dead ends: 625 [2020-01-16 19:02:11,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:11,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-01-16 19:02:11,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 394. [2020-01-16 19:02:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:02:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1357 transitions. [2020-01-16 19:02:11,381 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1357 transitions. Word has length 22 [2020-01-16 19:02:11,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:11,381 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1357 transitions. [2020-01-16 19:02:11,381 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:11,381 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1357 transitions. [2020-01-16 19:02:11,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:11,382 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:11,382 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:11,382 INFO L426 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:11,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:11,382 INFO L82 PathProgramCache]: Analyzing trace with hash 178953276, now seen corresponding path program 462 times [2020-01-16 19:02:11,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:11,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96437400] [2020-01-16 19:02:11,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:11,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-01-16 19:02:11,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96437400] [2020-01-16 19:02:11,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:11,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:11,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348395411] [2020-01-16 19:02:11,626 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:11,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:11,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:11,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:11,627 INFO L87 Difference]: Start difference. First operand 394 states and 1357 transitions. Second operand 9 states. [2020-01-16 19:02:11,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:11,735 INFO L93 Difference]: Finished difference Result 639 states and 1909 transitions. [2020-01-16 19:02:11,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:11,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:11,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:11,736 INFO L225 Difference]: With dead ends: 639 [2020-01-16 19:02:11,737 INFO L226 Difference]: Without dead ends: 621 [2020-01-16 19:02:11,737 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:11,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-01-16 19:02:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 390. [2020-01-16 19:02:11,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:02:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1349 transitions. [2020-01-16 19:02:11,746 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1349 transitions. Word has length 22 [2020-01-16 19:02:11,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:11,746 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1349 transitions. [2020-01-16 19:02:11,746 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1349 transitions. [2020-01-16 19:02:11,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:11,746 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:11,746 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:11,747 INFO L426 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:11,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:11,747 INFO L82 PathProgramCache]: Analyzing trace with hash 313832464, now seen corresponding path program 463 times [2020-01-16 19:02:11,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:11,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851992179] [2020-01-16 19:02:11,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:12,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851992179] [2020-01-16 19:02:12,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:12,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:12,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377985844] [2020-01-16 19:02:12,025 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:12,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:12,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:12,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:12,025 INFO L87 Difference]: Start difference. First operand 390 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:02:12,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:12,131 INFO L93 Difference]: Finished difference Result 632 states and 1899 transitions. [2020-01-16 19:02:12,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:12,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:12,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:12,133 INFO L225 Difference]: With dead ends: 632 [2020-01-16 19:02:12,133 INFO L226 Difference]: Without dead ends: 621 [2020-01-16 19:02:12,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:12,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-01-16 19:02:12,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 394. [2020-01-16 19:02:12,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:02:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1359 transitions. [2020-01-16 19:02:12,145 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1359 transitions. Word has length 22 [2020-01-16 19:02:12,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:12,145 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1359 transitions. [2020-01-16 19:02:12,145 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:12,145 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1359 transitions. [2020-01-16 19:02:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:12,146 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:12,146 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:12,146 INFO L426 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:12,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:12,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1655765252, now seen corresponding path program 464 times [2020-01-16 19:02:12,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:12,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245173842] [2020-01-16 19:02:12,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:12,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:12,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245173842] [2020-01-16 19:02:12,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:12,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:12,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041114878] [2020-01-16 19:02:12,415 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:12,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:12,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:12,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:12,415 INFO L87 Difference]: Start difference. First operand 394 states and 1359 transitions. Second operand 9 states. [2020-01-16 19:02:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:12,516 INFO L93 Difference]: Finished difference Result 631 states and 1895 transitions. [2020-01-16 19:02:12,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:12,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:12,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:12,518 INFO L225 Difference]: With dead ends: 631 [2020-01-16 19:02:12,518 INFO L226 Difference]: Without dead ends: 619 [2020-01-16 19:02:12,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:12,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-01-16 19:02:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 392. [2020-01-16 19:02:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1354 transitions. [2020-01-16 19:02:12,528 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1354 transitions. Word has length 22 [2020-01-16 19:02:12,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:12,528 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1354 transitions. [2020-01-16 19:02:12,528 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1354 transitions. [2020-01-16 19:02:12,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:12,528 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:12,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, 1, 1, 1] [2020-01-16 19:02:12,529 INFO L426 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:12,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:12,529 INFO L82 PathProgramCache]: Analyzing trace with hash 849062266, now seen corresponding path program 465 times [2020-01-16 19:02:12,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:12,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016526027] [2020-01-16 19:02:12,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:12,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-01-16 19:02:12,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016526027] [2020-01-16 19:02:12,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:12,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:12,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314226478] [2020-01-16 19:02:12,779 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:12,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:12,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:12,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:12,780 INFO L87 Difference]: Start difference. First operand 392 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:02:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:12,880 INFO L93 Difference]: Finished difference Result 636 states and 1906 transitions. [2020-01-16 19:02:12,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:12,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:12,882 INFO L225 Difference]: With dead ends: 636 [2020-01-16 19:02:12,882 INFO L226 Difference]: Without dead ends: 625 [2020-01-16 19:02:12,883 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:12,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-01-16 19:02:12,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 395. [2020-01-16 19:02:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:02:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1359 transitions. [2020-01-16 19:02:12,892 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1359 transitions. Word has length 22 [2020-01-16 19:02:12,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:12,892 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1359 transitions. [2020-01-16 19:02:12,892 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1359 transitions. [2020-01-16 19:02:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:12,893 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:12,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, 1, 1, 1] [2020-01-16 19:02:12,893 INFO L426 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:12,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:12,893 INFO L82 PathProgramCache]: Analyzing trace with hash 620673258, now seen corresponding path program 466 times [2020-01-16 19:02:12,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:12,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648806427] [2020-01-16 19:02:12,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:13,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648806427] [2020-01-16 19:02:13,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:13,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:13,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518079340] [2020-01-16 19:02:13,143 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:13,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:13,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:13,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:13,144 INFO L87 Difference]: Start difference. First operand 395 states and 1359 transitions. Second operand 9 states. [2020-01-16 19:02:13,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:13,252 INFO L93 Difference]: Finished difference Result 638 states and 1907 transitions. [2020-01-16 19:02:13,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:13,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:13,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:13,254 INFO L225 Difference]: With dead ends: 638 [2020-01-16 19:02:13,254 INFO L226 Difference]: Without dead ends: 622 [2020-01-16 19:02:13,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:13,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-01-16 19:02:13,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 392. [2020-01-16 19:02:13,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:13,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1352 transitions. [2020-01-16 19:02:13,264 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1352 transitions. Word has length 22 [2020-01-16 19:02:13,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:13,264 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1352 transitions. [2020-01-16 19:02:13,264 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:13,264 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1352 transitions. [2020-01-16 19:02:13,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:13,264 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:13,265 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:13,265 INFO L426 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:13,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:13,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1117909674, now seen corresponding path program 467 times [2020-01-16 19:02:13,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:13,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473481086] [2020-01-16 19:02:13,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:13,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-01-16 19:02:13,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473481086] [2020-01-16 19:02:13,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:13,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:13,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167337995] [2020-01-16 19:02:13,511 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:13,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:13,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:13,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:13,511 INFO L87 Difference]: Start difference. First operand 392 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:02:13,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:13,613 INFO L93 Difference]: Finished difference Result 633 states and 1897 transitions. [2020-01-16 19:02:13,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:13,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:13,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:13,614 INFO L225 Difference]: With dead ends: 633 [2020-01-16 19:02:13,615 INFO L226 Difference]: Without dead ends: 623 [2020-01-16 19:02:13,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:13,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-01-16 19:02:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 394. [2020-01-16 19:02:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:02:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1355 transitions. [2020-01-16 19:02:13,624 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1355 transitions. Word has length 22 [2020-01-16 19:02:13,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:13,624 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1355 transitions. [2020-01-16 19:02:13,624 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1355 transitions. [2020-01-16 19:02:13,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:13,625 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:13,625 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:13,625 INFO L426 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:13,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:13,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1689364480, now seen corresponding path program 468 times [2020-01-16 19:02:13,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:13,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903503834] [2020-01-16 19:02:13,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:13,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903503834] [2020-01-16 19:02:13,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:13,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:13,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469665438] [2020-01-16 19:02:13,876 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:13,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:13,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:13,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:13,877 INFO L87 Difference]: Start difference. First operand 394 states and 1355 transitions. Second operand 9 states. [2020-01-16 19:02:13,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:13,981 INFO L93 Difference]: Finished difference Result 636 states and 1901 transitions. [2020-01-16 19:02:13,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:13,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:13,983 INFO L225 Difference]: With dead ends: 636 [2020-01-16 19:02:13,983 INFO L226 Difference]: Without dead ends: 619 [2020-01-16 19:02:13,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:13,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-01-16 19:02:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 390. [2020-01-16 19:02:13,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:02:13,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1347 transitions. [2020-01-16 19:02:13,992 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1347 transitions. Word has length 22 [2020-01-16 19:02:13,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:13,992 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1347 transitions. [2020-01-16 19:02:13,992 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1347 transitions. [2020-01-16 19:02:13,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:13,993 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:13,993 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:13,993 INFO L426 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:13,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:13,993 INFO L82 PathProgramCache]: Analyzing trace with hash 240310736, now seen corresponding path program 469 times [2020-01-16 19:02:13,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:13,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803294636] [2020-01-16 19:02:13,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:14,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803294636] [2020-01-16 19:02:14,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:14,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:14,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102356486] [2020-01-16 19:02:14,257 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:14,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:14,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:14,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:14,257 INFO L87 Difference]: Start difference. First operand 390 states and 1347 transitions. Second operand 9 states. [2020-01-16 19:02:14,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:14,360 INFO L93 Difference]: Finished difference Result 646 states and 1932 transitions. [2020-01-16 19:02:14,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:14,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:14,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:14,362 INFO L225 Difference]: With dead ends: 646 [2020-01-16 19:02:14,362 INFO L226 Difference]: Without dead ends: 635 [2020-01-16 19:02:14,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:14,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-01-16 19:02:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 396. [2020-01-16 19:02:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:02:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1363 transitions. [2020-01-16 19:02:14,371 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1363 transitions. Word has length 22 [2020-01-16 19:02:14,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:14,371 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1363 transitions. [2020-01-16 19:02:14,371 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1363 transitions. [2020-01-16 19:02:14,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:14,372 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:14,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, 1, 1, 1] [2020-01-16 19:02:14,372 INFO L426 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:14,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:14,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1106870720, now seen corresponding path program 470 times [2020-01-16 19:02:14,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:14,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058361705] [2020-01-16 19:02:14,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:14,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-01-16 19:02:14,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058361705] [2020-01-16 19:02:14,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:14,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:14,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020152963] [2020-01-16 19:02:14,622 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:14,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:14,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:14,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:14,622 INFO L87 Difference]: Start difference. First operand 396 states and 1363 transitions. Second operand 9 states. [2020-01-16 19:02:14,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:14,733 INFO L93 Difference]: Finished difference Result 649 states and 1935 transitions. [2020-01-16 19:02:14,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:14,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:14,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:14,734 INFO L225 Difference]: With dead ends: 649 [2020-01-16 19:02:14,735 INFO L226 Difference]: Without dead ends: 632 [2020-01-16 19:02:14,735 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-01-16 19:02:14,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 393. [2020-01-16 19:02:14,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:02:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1355 transitions. [2020-01-16 19:02:14,743 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1355 transitions. Word has length 22 [2020-01-16 19:02:14,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:14,744 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1355 transitions. [2020-01-16 19:02:14,744 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1355 transitions. [2020-01-16 19:02:14,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:14,744 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:14,744 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:14,744 INFO L426 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:14,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:14,745 INFO L82 PathProgramCache]: Analyzing trace with hash -832774644, now seen corresponding path program 471 times [2020-01-16 19:02:14,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:14,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518066836] [2020-01-16 19:02:14,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:14,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-01-16 19:02:14,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518066836] [2020-01-16 19:02:14,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:14,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:14,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657095102] [2020-01-16 19:02:14,992 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:14,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:14,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:14,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:14,992 INFO L87 Difference]: Start difference. First operand 393 states and 1355 transitions. Second operand 9 states. [2020-01-16 19:02:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:15,095 INFO L93 Difference]: Finished difference Result 645 states and 1927 transitions. [2020-01-16 19:02:15,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:15,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:15,097 INFO L225 Difference]: With dead ends: 645 [2020-01-16 19:02:15,097 INFO L226 Difference]: Without dead ends: 634 [2020-01-16 19:02:15,097 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:15,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-01-16 19:02:15,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 396. [2020-01-16 19:02:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:02:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1360 transitions. [2020-01-16 19:02:15,107 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1360 transitions. Word has length 22 [2020-01-16 19:02:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:15,108 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1360 transitions. [2020-01-16 19:02:15,108 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1360 transitions. [2020-01-16 19:02:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:15,108 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:15,108 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:15,108 INFO L426 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:15,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:15,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1061163652, now seen corresponding path program 472 times [2020-01-16 19:02:15,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:15,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165692880] [2020-01-16 19:02:15,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:15,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165692880] [2020-01-16 19:02:15,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:15,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:15,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228570886] [2020-01-16 19:02:15,362 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:15,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:15,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:15,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:15,362 INFO L87 Difference]: Start difference. First operand 396 states and 1360 transitions. Second operand 9 states. [2020-01-16 19:02:15,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:15,476 INFO L93 Difference]: Finished difference Result 647 states and 1928 transitions. [2020-01-16 19:02:15,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:15,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:15,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:15,478 INFO L225 Difference]: With dead ends: 647 [2020-01-16 19:02:15,478 INFO L226 Difference]: Without dead ends: 631 [2020-01-16 19:02:15,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-01-16 19:02:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 393. [2020-01-16 19:02:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:02:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1352 transitions. [2020-01-16 19:02:15,488 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1352 transitions. Word has length 22 [2020-01-16 19:02:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:15,488 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1352 transitions. [2020-01-16 19:02:15,488 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1352 transitions. [2020-01-16 19:02:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:15,489 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:15,489 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:15,489 INFO L426 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:15,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1678221232, now seen corresponding path program 473 times [2020-01-16 19:02:15,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:15,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161263641] [2020-01-16 19:02:15,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:15,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161263641] [2020-01-16 19:02:15,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:15,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:15,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191082800] [2020-01-16 19:02:15,741 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:15,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:15,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:15,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:15,742 INFO L87 Difference]: Start difference. First operand 393 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:02:15,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:15,842 INFO L93 Difference]: Finished difference Result 653 states and 1942 transitions. [2020-01-16 19:02:15,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:15,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:15,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:15,844 INFO L225 Difference]: With dead ends: 653 [2020-01-16 19:02:15,844 INFO L226 Difference]: Without dead ends: 639 [2020-01-16 19:02:15,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:15,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-01-16 19:02:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 398. [2020-01-16 19:02:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 19:02:15,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1361 transitions. [2020-01-16 19:02:15,855 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1361 transitions. Word has length 22 [2020-01-16 19:02:15,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:15,855 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1361 transitions. [2020-01-16 19:02:15,855 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:15,855 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1361 transitions. [2020-01-16 19:02:15,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:15,856 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:15,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, 1, 1, 1] [2020-01-16 19:02:15,856 INFO L426 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:15,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:15,856 INFO L82 PathProgramCache]: Analyzing trace with hash 32392076, now seen corresponding path program 474 times [2020-01-16 19:02:15,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:15,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350151173] [2020-01-16 19:02:15,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:16,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-01-16 19:02:16,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350151173] [2020-01-16 19:02:16,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:16,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:16,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67929852] [2020-01-16 19:02:16,122 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:16,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:16,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:16,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:16,122 INFO L87 Difference]: Start difference. First operand 398 states and 1361 transitions. Second operand 9 states. [2020-01-16 19:02:16,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:16,226 INFO L93 Difference]: Finished difference Result 652 states and 1935 transitions. [2020-01-16 19:02:16,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:16,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:16,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:16,228 INFO L225 Difference]: With dead ends: 652 [2020-01-16 19:02:16,228 INFO L226 Difference]: Without dead ends: 631 [2020-01-16 19:02:16,228 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:16,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-01-16 19:02:16,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 390. [2020-01-16 19:02:16,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:02:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1345 transitions. [2020-01-16 19:02:16,238 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1345 transitions. Word has length 22 [2020-01-16 19:02:16,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:16,238 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1345 transitions. [2020-01-16 19:02:16,238 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:16,238 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1345 transitions. [2020-01-16 19:02:16,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:16,238 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:16,239 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:16,239 INFO L426 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:16,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:16,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1603249732, now seen corresponding path program 475 times [2020-01-16 19:02:16,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:16,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107617233] [2020-01-16 19:02:16,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:16,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107617233] [2020-01-16 19:02:16,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:16,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:16,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121016616] [2020-01-16 19:02:16,483 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:16,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:16,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:16,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:16,483 INFO L87 Difference]: Start difference. First operand 390 states and 1345 transitions. Second operand 9 states. [2020-01-16 19:02:16,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:16,584 INFO L93 Difference]: Finished difference Result 639 states and 1911 transitions. [2020-01-16 19:02:16,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:16,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:16,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:16,586 INFO L225 Difference]: With dead ends: 639 [2020-01-16 19:02:16,586 INFO L226 Difference]: Without dead ends: 629 [2020-01-16 19:02:16,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:16,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-01-16 19:02:16,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 394. [2020-01-16 19:02:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:02:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1355 transitions. [2020-01-16 19:02:16,595 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1355 transitions. Word has length 22 [2020-01-16 19:02:16,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:16,595 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1355 transitions. [2020-01-16 19:02:16,596 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1355 transitions. [2020-01-16 19:02:16,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:16,596 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:16,596 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:16,596 INFO L426 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:16,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:16,597 INFO L82 PathProgramCache]: Analyzing trace with hash 685299542, now seen corresponding path program 476 times [2020-01-16 19:02:16,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:16,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663495253] [2020-01-16 19:02:16,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:16,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663495253] [2020-01-16 19:02:16,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:16,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:16,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863325177] [2020-01-16 19:02:16,841 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:16,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:16,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:16,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:16,841 INFO L87 Difference]: Start difference. First operand 394 states and 1355 transitions. Second operand 9 states. [2020-01-16 19:02:16,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:16,939 INFO L93 Difference]: Finished difference Result 643 states and 1917 transitions. [2020-01-16 19:02:16,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:16,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:16,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:16,941 INFO L225 Difference]: With dead ends: 643 [2020-01-16 19:02:16,941 INFO L226 Difference]: Without dead ends: 627 [2020-01-16 19:02:16,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:16,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-01-16 19:02:16,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 392. [2020-01-16 19:02:16,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1350 transitions. [2020-01-16 19:02:16,951 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1350 transitions. Word has length 22 [2020-01-16 19:02:16,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:16,951 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1350 transitions. [2020-01-16 19:02:16,951 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:16,951 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1350 transitions. [2020-01-16 19:02:16,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:16,952 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:16,952 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:16,952 INFO L426 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:16,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:16,952 INFO L82 PathProgramCache]: Analyzing trace with hash 530164352, now seen corresponding path program 477 times [2020-01-16 19:02:16,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:16,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921049905] [2020-01-16 19:02:16,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:17,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921049905] [2020-01-16 19:02:17,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:17,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:17,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405934317] [2020-01-16 19:02:17,211 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:17,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:17,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:17,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:17,212 INFO L87 Difference]: Start difference. First operand 392 states and 1350 transitions. Second operand 9 states. [2020-01-16 19:02:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:17,310 INFO L93 Difference]: Finished difference Result 638 states and 1907 transitions. [2020-01-16 19:02:17,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:17,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:17,312 INFO L225 Difference]: With dead ends: 638 [2020-01-16 19:02:17,312 INFO L226 Difference]: Without dead ends: 628 [2020-01-16 19:02:17,312 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:17,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-01-16 19:02:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 394. [2020-01-16 19:02:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:02:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1353 transitions. [2020-01-16 19:02:17,322 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1353 transitions. Word has length 22 [2020-01-16 19:02:17,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:17,322 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1353 transitions. [2020-01-16 19:02:17,322 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:17,322 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1353 transitions. [2020-01-16 19:02:17,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:17,323 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:17,323 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:17,323 INFO L426 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:17,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:17,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1101619158, now seen corresponding path program 478 times [2020-01-16 19:02:17,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:17,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074860595] [2020-01-16 19:02:17,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:17,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-01-16 19:02:17,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074860595] [2020-01-16 19:02:17,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:17,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:17,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984837441] [2020-01-16 19:02:17,572 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:17,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:17,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:17,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:17,573 INFO L87 Difference]: Start difference. First operand 394 states and 1353 transitions. Second operand 9 states. [2020-01-16 19:02:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:17,676 INFO L93 Difference]: Finished difference Result 641 states and 1911 transitions. [2020-01-16 19:02:17,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:17,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:17,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:17,678 INFO L225 Difference]: With dead ends: 641 [2020-01-16 19:02:17,678 INFO L226 Difference]: Without dead ends: 626 [2020-01-16 19:02:17,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:17,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-01-16 19:02:17,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 392. [2020-01-16 19:02:17,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1348 transitions. [2020-01-16 19:02:17,688 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1348 transitions. Word has length 22 [2020-01-16 19:02:17,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:17,688 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1348 transitions. [2020-01-16 19:02:17,688 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:17,688 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1348 transitions. [2020-01-16 19:02:17,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:17,689 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:17,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, 1, 1, 1] [2020-01-16 19:02:17,689 INFO L426 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:17,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:17,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1220529344, now seen corresponding path program 479 times [2020-01-16 19:02:17,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:17,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45824302] [2020-01-16 19:02:17,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:17,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-01-16 19:02:17,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45824302] [2020-01-16 19:02:17,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:17,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:17,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143453659] [2020-01-16 19:02:17,949 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:17,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:17,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:17,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:17,949 INFO L87 Difference]: Start difference. First operand 392 states and 1348 transitions. Second operand 9 states. [2020-01-16 19:02:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:18,059 INFO L93 Difference]: Finished difference Result 649 states and 1930 transitions. [2020-01-16 19:02:18,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:18,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:18,061 INFO L225 Difference]: With dead ends: 649 [2020-01-16 19:02:18,061 INFO L226 Difference]: Without dead ends: 635 [2020-01-16 19:02:18,062 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:18,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-01-16 19:02:18,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 397. [2020-01-16 19:02:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:02:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1357 transitions. [2020-01-16 19:02:18,071 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1357 transitions. Word has length 22 [2020-01-16 19:02:18,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:18,071 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1357 transitions. [2020-01-16 19:02:18,071 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:18,071 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1357 transitions. [2020-01-16 19:02:18,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:18,072 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:18,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, 1, 1, 1] [2020-01-16 19:02:18,072 INFO L426 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:18,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:18,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1585032956, now seen corresponding path program 480 times [2020-01-16 19:02:18,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:18,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900805820] [2020-01-16 19:02:18,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:18,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900805820] [2020-01-16 19:02:18,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:18,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:18,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083898972] [2020-01-16 19:02:18,328 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:18,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:18,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:18,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:18,328 INFO L87 Difference]: Start difference. First operand 397 states and 1357 transitions. Second operand 9 states. [2020-01-16 19:02:18,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:18,434 INFO L93 Difference]: Finished difference Result 648 states and 1923 transitions. [2020-01-16 19:02:18,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:18,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:18,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:18,436 INFO L225 Difference]: With dead ends: 648 [2020-01-16 19:02:18,436 INFO L226 Difference]: Without dead ends: 621 [2020-01-16 19:02:18,437 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:18,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-01-16 19:02:18,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 383. [2020-01-16 19:02:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:02:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1332 transitions. [2020-01-16 19:02:18,446 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1332 transitions. Word has length 22 [2020-01-16 19:02:18,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:18,447 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1332 transitions. [2020-01-16 19:02:18,447 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1332 transitions. [2020-01-16 19:02:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:18,447 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:18,447 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:18,447 INFO L426 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:18,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:18,448 INFO L82 PathProgramCache]: Analyzing trace with hash -241342128, now seen corresponding path program 481 times [2020-01-16 19:02:18,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:18,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49661054] [2020-01-16 19:02:18,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:18,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-01-16 19:02:18,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49661054] [2020-01-16 19:02:18,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:18,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:18,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781083986] [2020-01-16 19:02:18,732 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:18,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:18,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:18,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:18,733 INFO L87 Difference]: Start difference. First operand 383 states and 1332 transitions. Second operand 9 states. [2020-01-16 19:02:18,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:18,820 INFO L93 Difference]: Finished difference Result 620 states and 1827 transitions. [2020-01-16 19:02:18,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:18,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:18,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:18,822 INFO L225 Difference]: With dead ends: 620 [2020-01-16 19:02:18,822 INFO L226 Difference]: Without dead ends: 604 [2020-01-16 19:02:18,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:18,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-01-16 19:02:18,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 394. [2020-01-16 19:02:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:02:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1368 transitions. [2020-01-16 19:02:18,831 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1368 transitions. Word has length 22 [2020-01-16 19:02:18,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:18,831 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1368 transitions. [2020-01-16 19:02:18,831 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:18,831 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1368 transitions. [2020-01-16 19:02:18,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:18,831 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:18,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, 1, 1, 1] [2020-01-16 19:02:18,832 INFO L426 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:18,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:18,832 INFO L82 PathProgramCache]: Analyzing trace with hash 319726364, now seen corresponding path program 482 times [2020-01-16 19:02:18,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:18,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084657347] [2020-01-16 19:02:18,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:19,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-01-16 19:02:19,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084657347] [2020-01-16 19:02:19,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:19,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:19,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89446597] [2020-01-16 19:02:19,118 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:19,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:19,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:19,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:19,119 INFO L87 Difference]: Start difference. First operand 394 states and 1368 transitions. Second operand 9 states. [2020-01-16 19:02:19,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:19,195 INFO L93 Difference]: Finished difference Result 613 states and 1812 transitions. [2020-01-16 19:02:19,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:19,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:19,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:19,196 INFO L225 Difference]: With dead ends: 613 [2020-01-16 19:02:19,196 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:02:19,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:19,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:02:19,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 392. [2020-01-16 19:02:19,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1364 transitions. [2020-01-16 19:02:19,206 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1364 transitions. Word has length 22 [2020-01-16 19:02:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:19,206 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1364 transitions. [2020-01-16 19:02:19,206 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:19,206 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1364 transitions. [2020-01-16 19:02:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:19,207 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:19,207 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:19,207 INFO L426 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:19,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:19,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1841779982, now seen corresponding path program 483 times [2020-01-16 19:02:19,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:19,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31058016] [2020-01-16 19:02:19,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:19,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31058016] [2020-01-16 19:02:19,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:19,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:19,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411798315] [2020-01-16 19:02:19,504 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:19,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:19,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:19,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:19,504 INFO L87 Difference]: Start difference. First operand 392 states and 1364 transitions. Second operand 9 states. [2020-01-16 19:02:19,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:19,580 INFO L93 Difference]: Finished difference Result 622 states and 1830 transitions. [2020-01-16 19:02:19,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:19,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:19,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:19,582 INFO L225 Difference]: With dead ends: 622 [2020-01-16 19:02:19,582 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 19:02:19,582 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:19,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 19:02:19,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 395. [2020-01-16 19:02:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:02:19,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1368 transitions. [2020-01-16 19:02:19,592 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1368 transitions. Word has length 22 [2020-01-16 19:02:19,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:19,592 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1368 transitions. [2020-01-16 19:02:19,592 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1368 transitions. [2020-01-16 19:02:19,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:19,593 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:19,593 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:19,593 INFO L426 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:19,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:19,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1490983652, now seen corresponding path program 484 times [2020-01-16 19:02:19,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:19,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874504856] [2020-01-16 19:02:19,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:19,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-01-16 19:02:19,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874504856] [2020-01-16 19:02:19,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:19,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:19,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157403231] [2020-01-16 19:02:19,890 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:19,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:19,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:19,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:19,897 INFO L87 Difference]: Start difference. First operand 395 states and 1368 transitions. Second operand 9 states. [2020-01-16 19:02:19,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:19,997 INFO L93 Difference]: Finished difference Result 616 states and 1816 transitions. [2020-01-16 19:02:19,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:19,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:19,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:19,999 INFO L225 Difference]: With dead ends: 616 [2020-01-16 19:02:19,999 INFO L226 Difference]: Without dead ends: 603 [2020-01-16 19:02:19,999 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:20,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-01-16 19:02:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 392. [2020-01-16 19:02:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:20,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1362 transitions. [2020-01-16 19:02:20,008 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1362 transitions. Word has length 22 [2020-01-16 19:02:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:20,008 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1362 transitions. [2020-01-16 19:02:20,008 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:20,008 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1362 transitions. [2020-01-16 19:02:20,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:20,008 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:20,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, 1, 1, 1] [2020-01-16 19:02:20,009 INFO L426 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:20,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:20,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1787057756, now seen corresponding path program 485 times [2020-01-16 19:02:20,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:20,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327968594] [2020-01-16 19:02:20,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:20,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327968594] [2020-01-16 19:02:20,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:20,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:20,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088150665] [2020-01-16 19:02:20,305 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:20,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:20,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:20,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:20,306 INFO L87 Difference]: Start difference. First operand 392 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:02:20,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:20,381 INFO L93 Difference]: Finished difference Result 606 states and 1797 transitions. [2020-01-16 19:02:20,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:20,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:20,383 INFO L225 Difference]: With dead ends: 606 [2020-01-16 19:02:20,383 INFO L226 Difference]: Without dead ends: 597 [2020-01-16 19:02:20,383 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:20,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-01-16 19:02:20,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 393. [2020-01-16 19:02:20,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:02:20,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1363 transitions. [2020-01-16 19:02:20,393 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1363 transitions. Word has length 22 [2020-01-16 19:02:20,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:20,393 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1363 transitions. [2020-01-16 19:02:20,393 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:20,393 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1363 transitions. [2020-01-16 19:02:20,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:20,394 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:20,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:20,394 INFO L426 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:20,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:20,394 INFO L82 PathProgramCache]: Analyzing trace with hash -176116798, now seen corresponding path program 486 times [2020-01-16 19:02:20,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:20,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354937287] [2020-01-16 19:02:20,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:20,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-01-16 19:02:20,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354937287] [2020-01-16 19:02:20,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:20,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:20,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934084241] [2020-01-16 19:02:20,688 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:20,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:20,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:20,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:20,688 INFO L87 Difference]: Start difference. First operand 393 states and 1363 transitions. Second operand 9 states. [2020-01-16 19:02:20,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:20,786 INFO L93 Difference]: Finished difference Result 607 states and 1798 transitions. [2020-01-16 19:02:20,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:20,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:20,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:20,788 INFO L225 Difference]: With dead ends: 607 [2020-01-16 19:02:20,788 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:02:20,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:02:20,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 390. [2020-01-16 19:02:20,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:02:20,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1358 transitions. [2020-01-16 19:02:20,798 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1358 transitions. Word has length 22 [2020-01-16 19:02:20,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:20,798 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1358 transitions. [2020-01-16 19:02:20,798 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1358 transitions. [2020-01-16 19:02:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:20,799 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:20,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, 1, 1, 1] [2020-01-16 19:02:20,799 INFO L426 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:20,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:20,799 INFO L82 PathProgramCache]: Analyzing trace with hash -838678786, now seen corresponding path program 487 times [2020-01-16 19:02:20,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:20,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536698503] [2020-01-16 19:02:20,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:21,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-01-16 19:02:21,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536698503] [2020-01-16 19:02:21,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:21,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:21,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086893788] [2020-01-16 19:02:21,069 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:21,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:21,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:21,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:21,069 INFO L87 Difference]: Start difference. First operand 390 states and 1358 transitions. Second operand 9 states. [2020-01-16 19:02:21,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:21,143 INFO L93 Difference]: Finished difference Result 630 states and 1848 transitions. [2020-01-16 19:02:21,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:21,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:21,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:21,145 INFO L225 Difference]: With dead ends: 630 [2020-01-16 19:02:21,145 INFO L226 Difference]: Without dead ends: 614 [2020-01-16 19:02:21,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:21,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-01-16 19:02:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 395. [2020-01-16 19:02:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:02:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1368 transitions. [2020-01-16 19:02:21,154 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1368 transitions. Word has length 22 [2020-01-16 19:02:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:21,154 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1368 transitions. [2020-01-16 19:02:21,154 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1368 transitions. [2020-01-16 19:02:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:21,155 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:21,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, 1, 1, 1] [2020-01-16 19:02:21,155 INFO L426 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:21,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:21,155 INFO L82 PathProgramCache]: Analyzing trace with hash -277610294, now seen corresponding path program 488 times [2020-01-16 19:02:21,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:21,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436842608] [2020-01-16 19:02:21,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:21,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436842608] [2020-01-16 19:02:21,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:21,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:21,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53573737] [2020-01-16 19:02:21,427 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:21,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:21,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:21,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:21,427 INFO L87 Difference]: Start difference. First operand 395 states and 1368 transitions. Second operand 9 states. [2020-01-16 19:02:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:21,501 INFO L93 Difference]: Finished difference Result 623 states and 1833 transitions. [2020-01-16 19:02:21,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:21,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:21,503 INFO L225 Difference]: With dead ends: 623 [2020-01-16 19:02:21,503 INFO L226 Difference]: Without dead ends: 612 [2020-01-16 19:02:21,503 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:21,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-01-16 19:02:21,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 393. [2020-01-16 19:02:21,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:02:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1364 transitions. [2020-01-16 19:02:21,513 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1364 transitions. Word has length 22 [2020-01-16 19:02:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:21,513 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1364 transitions. [2020-01-16 19:02:21,513 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1364 transitions. [2020-01-16 19:02:21,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:21,514 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:21,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, 1, 1, 1] [2020-01-16 19:02:21,514 INFO L426 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:21,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:21,514 INFO L82 PathProgramCache]: Analyzing trace with hash 174013746, now seen corresponding path program 489 times [2020-01-16 19:02:21,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:21,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758078134] [2020-01-16 19:02:21,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:21,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-01-16 19:02:21,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758078134] [2020-01-16 19:02:21,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:21,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:21,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662250305] [2020-01-16 19:02:21,805 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:21,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:21,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:21,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:21,806 INFO L87 Difference]: Start difference. First operand 393 states and 1364 transitions. Second operand 9 states. [2020-01-16 19:02:21,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:21,888 INFO L93 Difference]: Finished difference Result 641 states and 1872 transitions. [2020-01-16 19:02:21,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:21,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:21,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:21,890 INFO L225 Difference]: With dead ends: 641 [2020-01-16 19:02:21,890 INFO L226 Difference]: Without dead ends: 625 [2020-01-16 19:02:21,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:21,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-01-16 19:02:21,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 401. [2020-01-16 19:02:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-01-16 19:02:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1377 transitions. [2020-01-16 19:02:21,899 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1377 transitions. Word has length 22 [2020-01-16 19:02:21,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:21,900 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 1377 transitions. [2020-01-16 19:02:21,900 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1377 transitions. [2020-01-16 19:02:21,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:21,900 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:21,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:21,900 INFO L426 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:21,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:21,901 INFO L82 PathProgramCache]: Analyzing trace with hash 44043300, now seen corresponding path program 490 times [2020-01-16 19:02:21,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:21,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533705272] [2020-01-16 19:02:21,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:22,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-01-16 19:02:22,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533705272] [2020-01-16 19:02:22,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:22,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:22,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720070889] [2020-01-16 19:02:22,177 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:22,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:22,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:22,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:22,178 INFO L87 Difference]: Start difference. First operand 401 states and 1377 transitions. Second operand 9 states. [2020-01-16 19:02:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:22,277 INFO L93 Difference]: Finished difference Result 639 states and 1862 transitions. [2020-01-16 19:02:22,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:22,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:22,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:22,279 INFO L225 Difference]: With dead ends: 639 [2020-01-16 19:02:22,279 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 19:02:22,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:22,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 19:02:22,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 393. [2020-01-16 19:02:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:02:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1361 transitions. [2020-01-16 19:02:22,289 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1361 transitions. Word has length 22 [2020-01-16 19:02:22,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:22,289 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1361 transitions. [2020-01-16 19:02:22,289 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1361 transitions. [2020-01-16 19:02:22,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:22,289 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:22,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, 1, 1, 1] [2020-01-16 19:02:22,289 INFO L426 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:22,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:22,290 INFO L82 PathProgramCache]: Analyzing trace with hash 228735972, now seen corresponding path program 491 times [2020-01-16 19:02:22,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:22,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814773419] [2020-01-16 19:02:22,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:22,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-01-16 19:02:22,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814773419] [2020-01-16 19:02:22,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:22,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:22,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358217786] [2020-01-16 19:02:22,559 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:22,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:22,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:22,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:22,559 INFO L87 Difference]: Start difference. First operand 393 states and 1361 transitions. Second operand 9 states. [2020-01-16 19:02:22,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:22,633 INFO L93 Difference]: Finished difference Result 620 states and 1825 transitions. [2020-01-16 19:02:22,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:22,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:22,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:22,635 INFO L225 Difference]: With dead ends: 620 [2020-01-16 19:02:22,635 INFO L226 Difference]: Without dead ends: 611 [2020-01-16 19:02:22,635 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-01-16 19:02:22,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 394. [2020-01-16 19:02:22,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:02:22,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1362 transitions. [2020-01-16 19:02:22,645 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1362 transitions. Word has length 22 [2020-01-16 19:02:22,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:22,646 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1362 transitions. [2020-01-16 19:02:22,646 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:22,646 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1362 transitions. [2020-01-16 19:02:22,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:22,646 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:22,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, 1, 1, 1] [2020-01-16 19:02:22,646 INFO L426 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:22,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:22,647 INFO L82 PathProgramCache]: Analyzing trace with hash -846975184, now seen corresponding path program 492 times [2020-01-16 19:02:22,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:22,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545927791] [2020-01-16 19:02:22,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:22,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:22,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545927791] [2020-01-16 19:02:22,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:22,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:22,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837520541] [2020-01-16 19:02:22,908 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:22,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:22,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:22,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:22,908 INFO L87 Difference]: Start difference. First operand 394 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:02:23,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:23,014 INFO L93 Difference]: Finished difference Result 625 states and 1834 transitions. [2020-01-16 19:02:23,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:23,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:23,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:23,016 INFO L225 Difference]: With dead ends: 625 [2020-01-16 19:02:23,016 INFO L226 Difference]: Without dead ends: 607 [2020-01-16 19:02:23,016 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:23,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-01-16 19:02:23,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 390. [2020-01-16 19:02:23,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:02:23,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1355 transitions. [2020-01-16 19:02:23,026 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1355 transitions. Word has length 22 [2020-01-16 19:02:23,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:23,026 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1355 transitions. [2020-01-16 19:02:23,026 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:23,026 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1355 transitions. [2020-01-16 19:02:23,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:23,027 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:23,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, 1, 1, 1] [2020-01-16 19:02:23,027 INFO L426 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:23,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:23,027 INFO L82 PathProgramCache]: Analyzing trace with hash -513082562, now seen corresponding path program 493 times [2020-01-16 19:02:23,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:23,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490156423] [2020-01-16 19:02:23,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:23,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490156423] [2020-01-16 19:02:23,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:23,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:23,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397548201] [2020-01-16 19:02:23,307 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:23,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:23,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:23,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:23,307 INFO L87 Difference]: Start difference. First operand 390 states and 1355 transitions. Second operand 9 states. [2020-01-16 19:02:23,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:23,386 INFO L93 Difference]: Finished difference Result 636 states and 1862 transitions. [2020-01-16 19:02:23,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:23,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:23,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:23,388 INFO L225 Difference]: With dead ends: 636 [2020-01-16 19:02:23,388 INFO L226 Difference]: Without dead ends: 620 [2020-01-16 19:02:23,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:23,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-01-16 19:02:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 397. [2020-01-16 19:02:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:02:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1371 transitions. [2020-01-16 19:02:23,397 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1371 transitions. Word has length 22 [2020-01-16 19:02:23,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:23,397 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1371 transitions. [2020-01-16 19:02:23,397 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1371 transitions. [2020-01-16 19:02:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:23,398 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02: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, 1, 1, 1] [2020-01-16 19:02:23,398 INFO L426 AbstractCegarLoop]: === Iteration 500 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:23,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:23,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1475286224, now seen corresponding path program 494 times [2020-01-16 19:02:23,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:23,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066666038] [2020-01-16 19:02:23,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:23,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066666038] [2020-01-16 19:02:23,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:23,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:23,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034418004] [2020-01-16 19:02:23,687 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:23,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:23,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:23,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:23,688 INFO L87 Difference]: Start difference. First operand 397 states and 1371 transitions. Second operand 9 states. [2020-01-16 19:02:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:23,792 INFO L93 Difference]: Finished difference Result 630 states and 1848 transitions. [2020-01-16 19:02:23,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:23,792 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:23,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:23,794 INFO L225 Difference]: With dead ends: 630 [2020-01-16 19:02:23,794 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 19:02:23,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:23,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 19:02:23,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 394. [2020-01-16 19:02:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:02:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1364 transitions. [2020-01-16 19:02:23,804 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1364 transitions. Word has length 22 [2020-01-16 19:02:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:23,804 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1364 transitions. [2020-01-16 19:02:23,804 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1364 transitions. [2020-01-16 19:02:23,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:23,804 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:23,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, 1, 1, 1] [2020-01-16 19:02:23,804 INFO L426 AbstractCegarLoop]: === Iteration 501 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:23,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:23,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2100047824, now seen corresponding path program 495 times [2020-01-16 19:02:23,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:23,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014195740] [2020-01-16 19:02:23,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:24,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-01-16 19:02:24,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014195740] [2020-01-16 19:02:24,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:24,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:24,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250164344] [2020-01-16 19:02:24,092 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:24,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:24,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:24,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:24,092 INFO L87 Difference]: Start difference. First operand 394 states and 1364 transitions. Second operand 9 states. [2020-01-16 19:02:24,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:24,177 INFO L93 Difference]: Finished difference Result 645 states and 1880 transitions. [2020-01-16 19:02:24,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:24,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:24,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:24,178 INFO L225 Difference]: With dead ends: 645 [2020-01-16 19:02:24,179 INFO L226 Difference]: Without dead ends: 629 [2020-01-16 19:02:24,179 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:24,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-01-16 19:02:24,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 402. [2020-01-16 19:02:24,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-01-16 19:02:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1377 transitions. [2020-01-16 19:02:24,187 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1377 transitions. Word has length 22 [2020-01-16 19:02:24,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:24,188 INFO L478 AbstractCegarLoop]: Abstraction has 402 states and 1377 transitions. [2020-01-16 19:02:24,188 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:24,188 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1377 transitions. [2020-01-16 19:02:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:24,188 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:24,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, 1, 1, 1] [2020-01-16 19:02:24,188 INFO L426 AbstractCegarLoop]: === Iteration 502 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:24,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:24,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1970077378, now seen corresponding path program 496 times [2020-01-16 19:02:24,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:24,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125248663] [2020-01-16 19:02:24,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:24,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125248663] [2020-01-16 19:02:24,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:24,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:24,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259710440] [2020-01-16 19:02:24,470 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:24,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:24,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:24,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:24,471 INFO L87 Difference]: Start difference. First operand 402 states and 1377 transitions. Second operand 9 states. [2020-01-16 19:02:24,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:24,577 INFO L93 Difference]: Finished difference Result 643 states and 1870 transitions. [2020-01-16 19:02:24,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:24,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:24,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:24,579 INFO L225 Difference]: With dead ends: 643 [2020-01-16 19:02:24,579 INFO L226 Difference]: Without dead ends: 621 [2020-01-16 19:02:24,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-01-16 19:02:24,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 394. [2020-01-16 19:02:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:02:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1360 transitions. [2020-01-16 19:02:24,588 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1360 transitions. Word has length 22 [2020-01-16 19:02:24,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:24,589 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1360 transitions. [2020-01-16 19:02:24,589 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:24,589 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1360 transitions. [2020-01-16 19:02:24,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:24,589 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:24,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, 1, 1, 1] [2020-01-16 19:02:24,589 INFO L426 AbstractCegarLoop]: === Iteration 503 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:24,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:24,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1205685836, now seen corresponding path program 497 times [2020-01-16 19:02:24,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:24,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427016000] [2020-01-16 19:02:24,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:24,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-01-16 19:02:24,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427016000] [2020-01-16 19:02:24,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:24,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:24,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924098088] [2020-01-16 19:02:24,855 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:24,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:24,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:24,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:24,855 INFO L87 Difference]: Start difference. First operand 394 states and 1360 transitions. Second operand 9 states. [2020-01-16 19:02:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:24,960 INFO L93 Difference]: Finished difference Result 627 states and 1839 transitions. [2020-01-16 19:02:24,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:24,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:24,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:24,962 INFO L225 Difference]: With dead ends: 627 [2020-01-16 19:02:24,962 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 19:02:24,962 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:24,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 19:02:24,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 396. [2020-01-16 19:02:24,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:02:24,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1363 transitions. [2020-01-16 19:02:24,971 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1363 transitions. Word has length 22 [2020-01-16 19:02:24,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:24,971 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1363 transitions. [2020-01-16 19:02:24,971 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:24,971 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1363 transitions. [2020-01-16 19:02:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:24,972 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02: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, 1, 1, 1] [2020-01-16 19:02:24,972 INFO L426 AbstractCegarLoop]: === Iteration 504 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:24,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:24,972 INFO L82 PathProgramCache]: Analyzing trace with hash 287735646, now seen corresponding path program 498 times [2020-01-16 19:02:24,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:24,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666680225] [2020-01-16 19:02:24,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:25,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666680225] [2020-01-16 19:02:25,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:25,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:25,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676366441] [2020-01-16 19:02:25,237 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:25,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:25,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:25,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:25,237 INFO L87 Difference]: Start difference. First operand 396 states and 1363 transitions. Second operand 9 states. [2020-01-16 19:02:25,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:25,367 INFO L93 Difference]: Finished difference Result 631 states and 1845 transitions. [2020-01-16 19:02:25,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:25,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:25,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:25,369 INFO L225 Difference]: With dead ends: 631 [2020-01-16 19:02:25,369 INFO L226 Difference]: Without dead ends: 611 [2020-01-16 19:02:25,369 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-01-16 19:02:25,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 390. [2020-01-16 19:02:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:02:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1352 transitions. [2020-01-16 19:02:25,377 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1352 transitions. Word has length 22 [2020-01-16 19:02:25,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:25,377 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1352 transitions. [2020-01-16 19:02:25,377 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1352 transitions. [2020-01-16 19:02:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:25,378 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:25,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, 1, 1, 1] [2020-01-16 19:02:25,378 INFO L426 AbstractCegarLoop]: === Iteration 505 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:25,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:25,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1024774602, now seen corresponding path program 499 times [2020-01-16 19:02:25,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:25,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335301214] [2020-01-16 19:02:25,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:25,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:25,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335301214] [2020-01-16 19:02:25,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:25,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:25,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854132939] [2020-01-16 19:02:25,662 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:25,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:25,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:25,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:25,663 INFO L87 Difference]: Start difference. First operand 390 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:02:25,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:25,744 INFO L93 Difference]: Finished difference Result 601 states and 1783 transitions. [2020-01-16 19:02:25,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:25,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:25,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:25,746 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:02:25,746 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 19:02:25,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:25,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 19:02:25,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 392. [2020-01-16 19:02:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:25,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1356 transitions. [2020-01-16 19:02:25,756 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1356 transitions. Word has length 22 [2020-01-16 19:02:25,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:25,756 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1356 transitions. [2020-01-16 19:02:25,756 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:25,757 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1356 transitions. [2020-01-16 19:02:25,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:25,757 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:25,757 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:25,757 INFO L426 AbstractCegarLoop]: === Iteration 506 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:25,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:25,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1659251736, now seen corresponding path program 500 times [2020-01-16 19:02:25,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:25,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161945301] [2020-01-16 19:02:25,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:26,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161945301] [2020-01-16 19:02:26,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:26,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:26,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689047598] [2020-01-16 19:02:26,041 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:26,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:26,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:26,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:26,041 INFO L87 Difference]: Start difference. First operand 392 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:02:26,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:26,169 INFO L93 Difference]: Finished difference Result 602 states and 1784 transitions. [2020-01-16 19:02:26,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:26,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:26,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:26,171 INFO L225 Difference]: With dead ends: 602 [2020-01-16 19:02:26,171 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 19:02:26,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:26,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 19:02:26,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 391. [2020-01-16 19:02:26,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:02:26,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1354 transitions. [2020-01-16 19:02:26,180 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1354 transitions. Word has length 22 [2020-01-16 19:02:26,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:26,180 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1354 transitions. [2020-01-16 19:02:26,180 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:26,181 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1354 transitions. [2020-01-16 19:02:26,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:26,181 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:26,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, 1, 1, 1] [2020-01-16 19:02:26,181 INFO L426 AbstractCegarLoop]: === Iteration 507 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:26,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:26,181 INFO L82 PathProgramCache]: Analyzing trace with hash -657062308, now seen corresponding path program 501 times [2020-01-16 19:02:26,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:26,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583560911] [2020-01-16 19:02:26,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:26,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-01-16 19:02:26,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583560911] [2020-01-16 19:02:26,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:26,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:26,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945862520] [2020-01-16 19:02:26,452 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:26,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:26,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:26,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:26,452 INFO L87 Difference]: Start difference. First operand 391 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:02:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:26,534 INFO L93 Difference]: Finished difference Result 605 states and 1790 transitions. [2020-01-16 19:02:26,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:26,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:26,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:26,535 INFO L225 Difference]: With dead ends: 605 [2020-01-16 19:02:26,536 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 19:02:26,536 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:26,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 19:02:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 392. [2020-01-16 19:02:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1355 transitions. [2020-01-16 19:02:26,544 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1355 transitions. Word has length 22 [2020-01-16 19:02:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:26,544 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1355 transitions. [2020-01-16 19:02:26,544 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1355 transitions. [2020-01-16 19:02:26,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:26,545 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:26,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, 1, 1, 1] [2020-01-16 19:02:26,545 INFO L426 AbstractCegarLoop]: === Iteration 508 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:26,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:26,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1732773464, now seen corresponding path program 502 times [2020-01-16 19:02:26,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:26,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778815309] [2020-01-16 19:02:26,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:26,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-01-16 19:02:26,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778815309] [2020-01-16 19:02:26,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:26,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:26,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063031373] [2020-01-16 19:02:26,810 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:26,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:26,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:26,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:26,811 INFO L87 Difference]: Start difference. First operand 392 states and 1355 transitions. Second operand 9 states. [2020-01-16 19:02:26,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:26,916 INFO L93 Difference]: Finished difference Result 610 states and 1799 transitions. [2020-01-16 19:02:26,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:26,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:26,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:26,918 INFO L225 Difference]: With dead ends: 610 [2020-01-16 19:02:26,918 INFO L226 Difference]: Without dead ends: 595 [2020-01-16 19:02:26,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:26,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-01-16 19:02:26,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 391. [2020-01-16 19:02:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:02:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1353 transitions. [2020-01-16 19:02:26,928 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1353 transitions. Word has length 22 [2020-01-16 19:02:26,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:26,928 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1353 transitions. [2020-01-16 19:02:26,928 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:26,928 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1353 transitions. [2020-01-16 19:02:26,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:26,929 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:26,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, 1, 1, 1] [2020-01-16 19:02:26,929 INFO L426 AbstractCegarLoop]: === Iteration 509 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:26,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:26,929 INFO L82 PathProgramCache]: Analyzing trace with hash -646559204, now seen corresponding path program 503 times [2020-01-16 19:02:26,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:26,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892599991] [2020-01-16 19:02:26,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:27,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892599991] [2020-01-16 19:02:27,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:27,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:27,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261151476] [2020-01-16 19:02:27,206 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:27,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:27,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:27,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:27,207 INFO L87 Difference]: Start difference. First operand 391 states and 1353 transitions. Second operand 9 states. [2020-01-16 19:02:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:27,309 INFO L93 Difference]: Finished difference Result 608 states and 1796 transitions. [2020-01-16 19:02:27,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:27,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:27,311 INFO L225 Difference]: With dead ends: 608 [2020-01-16 19:02:27,311 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:02:27,312 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:27,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:02:27,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 393. [2020-01-16 19:02:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:02:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1356 transitions. [2020-01-16 19:02:27,321 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1356 transitions. Word has length 22 [2020-01-16 19:02:27,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:27,321 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1356 transitions. [2020-01-16 19:02:27,321 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:27,321 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1356 transitions. [2020-01-16 19:02:27,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:27,322 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:27,322 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:27,322 INFO L426 AbstractCegarLoop]: === Iteration 510 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:27,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:27,322 INFO L82 PathProgramCache]: Analyzing trace with hash 961755978, now seen corresponding path program 504 times [2020-01-16 19:02:27,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:27,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467161028] [2020-01-16 19:02:27,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:27,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467161028] [2020-01-16 19:02:27,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:27,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:27,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871894234] [2020-01-16 19:02:27,588 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:27,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:27,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:27,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:27,588 INFO L87 Difference]: Start difference. First operand 393 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:02:27,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:27,697 INFO L93 Difference]: Finished difference Result 612 states and 1802 transitions. [2020-01-16 19:02:27,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:27,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:27,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:27,698 INFO L225 Difference]: With dead ends: 612 [2020-01-16 19:02:27,699 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 19:02:27,699 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:27,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 19:02:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 387. [2020-01-16 19:02:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:02:27,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1346 transitions. [2020-01-16 19:02:27,708 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1346 transitions. Word has length 22 [2020-01-16 19:02:27,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:27,708 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1346 transitions. [2020-01-16 19:02:27,708 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:27,708 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1346 transitions. [2020-01-16 19:02:27,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:27,708 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:27,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, 1, 1, 1] [2020-01-16 19:02:27,709 INFO L426 AbstractCegarLoop]: === Iteration 511 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:27,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1086313580, now seen corresponding path program 505 times [2020-01-16 19:02:27,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:27,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276903010] [2020-01-16 19:02:27,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:27,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276903010] [2020-01-16 19:02:27,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:27,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:27,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386755915] [2020-01-16 19:02:27,995 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:27,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:27,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:27,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:27,995 INFO L87 Difference]: Start difference. First operand 387 states and 1346 transitions. Second operand 9 states. [2020-01-16 19:02:28,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:28,078 INFO L93 Difference]: Finished difference Result 614 states and 1811 transitions. [2020-01-16 19:02:28,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:28,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:28,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:28,080 INFO L225 Difference]: With dead ends: 614 [2020-01-16 19:02:28,080 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:02:28,081 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:28,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:02:28,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 393. [2020-01-16 19:02:28,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:02:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1362 transitions. [2020-01-16 19:02:28,091 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1362 transitions. Word has length 22 [2020-01-16 19:02:28,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:28,091 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1362 transitions. [2020-01-16 19:02:28,091 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1362 transitions. [2020-01-16 19:02:28,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:28,092 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:28,092 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:28,092 INFO L426 AbstractCegarLoop]: === Iteration 512 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:28,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:28,092 INFO L82 PathProgramCache]: Analyzing trace with hash -525245088, now seen corresponding path program 506 times [2020-01-16 19:02:28,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:28,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99493358] [2020-01-16 19:02:28,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:28,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-01-16 19:02:28,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99493358] [2020-01-16 19:02:28,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:28,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:28,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871528324] [2020-01-16 19:02:28,378 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:28,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:28,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:28,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:28,379 INFO L87 Difference]: Start difference. First operand 393 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:02:28,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:28,467 INFO L93 Difference]: Finished difference Result 607 states and 1796 transitions. [2020-01-16 19:02:28,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:28,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:28,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:28,469 INFO L225 Difference]: With dead ends: 607 [2020-01-16 19:02:28,469 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 19:02:28,470 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:28,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 19:02:28,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 391. [2020-01-16 19:02:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:02:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1358 transitions. [2020-01-16 19:02:28,479 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1358 transitions. Word has length 22 [2020-01-16 19:02:28,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:28,480 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1358 transitions. [2020-01-16 19:02:28,480 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:28,480 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1358 transitions. [2020-01-16 19:02:28,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:28,480 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:28,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, 1, 1, 1] [2020-01-16 19:02:28,480 INFO L426 AbstractCegarLoop]: === Iteration 513 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:28,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:28,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1608215862, now seen corresponding path program 507 times [2020-01-16 19:02:28,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:28,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765608536] [2020-01-16 19:02:28,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:28,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-01-16 19:02:28,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765608536] [2020-01-16 19:02:28,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:28,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:28,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005631103] [2020-01-16 19:02:28,769 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:28,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:28,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:28,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:28,769 INFO L87 Difference]: Start difference. First operand 391 states and 1358 transitions. Second operand 9 states. [2020-01-16 19:02:28,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:28,853 INFO L93 Difference]: Finished difference Result 616 states and 1814 transitions. [2020-01-16 19:02:28,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:28,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:28,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:28,855 INFO L225 Difference]: With dead ends: 616 [2020-01-16 19:02:28,855 INFO L226 Difference]: Without dead ends: 600 [2020-01-16 19:02:28,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:28,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-01-16 19:02:28,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 394. [2020-01-16 19:02:28,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:02:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1362 transitions. [2020-01-16 19:02:28,865 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1362 transitions. Word has length 22 [2020-01-16 19:02:28,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:28,865 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1362 transitions. [2020-01-16 19:02:28,865 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:28,865 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1362 transitions. [2020-01-16 19:02:28,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:28,866 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:28,866 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:28,866 INFO L426 AbstractCegarLoop]: === Iteration 514 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:28,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:28,866 INFO L82 PathProgramCache]: Analyzing trace with hash 646012200, now seen corresponding path program 508 times [2020-01-16 19:02:28,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:28,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803699312] [2020-01-16 19:02:28,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:29,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-01-16 19:02:29,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803699312] [2020-01-16 19:02:29,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:29,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:29,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484703172] [2020-01-16 19:02:29,156 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:29,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:29,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:29,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:29,157 INFO L87 Difference]: Start difference. First operand 394 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:02:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:29,263 INFO L93 Difference]: Finished difference Result 610 states and 1800 transitions. [2020-01-16 19:02:29,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:29,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:29,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:29,265 INFO L225 Difference]: With dead ends: 610 [2020-01-16 19:02:29,265 INFO L226 Difference]: Without dead ends: 597 [2020-01-16 19:02:29,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:29,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-01-16 19:02:29,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 391. [2020-01-16 19:02:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:02:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1356 transitions. [2020-01-16 19:02:29,275 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1356 transitions. Word has length 22 [2020-01-16 19:02:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:29,275 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1356 transitions. [2020-01-16 19:02:29,275 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1356 transitions. [2020-01-16 19:02:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:29,276 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:29,276 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:29,276 INFO L426 AbstractCegarLoop]: === Iteration 515 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:29,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:29,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1662938088, now seen corresponding path program 509 times [2020-01-16 19:02:29,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:29,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121319285] [2020-01-16 19:02:29,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:29,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:29,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121319285] [2020-01-16 19:02:29,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:29,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:29,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273400008] [2020-01-16 19:02:29,567 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:29,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:29,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:29,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:29,568 INFO L87 Difference]: Start difference. First operand 391 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:02:29,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:29,654 INFO L93 Difference]: Finished difference Result 600 states and 1781 transitions. [2020-01-16 19:02:29,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:29,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:29,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:29,655 INFO L225 Difference]: With dead ends: 600 [2020-01-16 19:02:29,656 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 19:02:29,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:29,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 19:02:29,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 392. [2020-01-16 19:02:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1357 transitions. [2020-01-16 19:02:29,664 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1357 transitions. Word has length 22 [2020-01-16 19:02:29,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:29,664 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1357 transitions. [2020-01-16 19:02:29,664 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:29,664 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1357 transitions. [2020-01-16 19:02:29,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:29,665 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:29,665 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:29,665 INFO L426 AbstractCegarLoop]: === Iteration 516 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:29,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:29,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1021088250, now seen corresponding path program 510 times [2020-01-16 19:02:29,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:29,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571255806] [2020-01-16 19:02:29,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:29,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571255806] [2020-01-16 19:02:29,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:29,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:29,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699636409] [2020-01-16 19:02:29,951 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:29,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:29,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:29,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:29,951 INFO L87 Difference]: Start difference. First operand 392 states and 1357 transitions. Second operand 9 states. [2020-01-16 19:02:30,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:30,059 INFO L93 Difference]: Finished difference Result 601 states and 1782 transitions. [2020-01-16 19:02:30,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:30,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:30,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:30,060 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:02:30,061 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 19:02:30,061 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 19:02:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 389. [2020-01-16 19:02:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:02:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1352 transitions. [2020-01-16 19:02:30,069 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1352 transitions. Word has length 22 [2020-01-16 19:02:30,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:30,069 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1352 transitions. [2020-01-16 19:02:30,069 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1352 transitions. [2020-01-16 19:02:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:30,070 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:30,070 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:30,070 INFO L426 AbstractCegarLoop]: === Iteration 517 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:30,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:30,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2126549378, now seen corresponding path program 511 times [2020-01-16 19:02:30,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:30,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96123668] [2020-01-16 19:02:30,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:30,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96123668] [2020-01-16 19:02:30,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:30,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:30,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780328567] [2020-01-16 19:02:30,359 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:30,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:30,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:30,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:30,359 INFO L87 Difference]: Start difference. First operand 389 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:02:30,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:30,439 INFO L93 Difference]: Finished difference Result 620 states and 1824 transitions. [2020-01-16 19:02:30,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:30,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:30,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:30,440 INFO L225 Difference]: With dead ends: 620 [2020-01-16 19:02:30,441 INFO L226 Difference]: Without dead ends: 604 [2020-01-16 19:02:30,441 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:30,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-01-16 19:02:30,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 393. [2020-01-16 19:02:30,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:02:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1360 transitions. [2020-01-16 19:02:30,450 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1360 transitions. Word has length 22 [2020-01-16 19:02:30,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:30,450 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1360 transitions. [2020-01-16 19:02:30,450 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1360 transitions. [2020-01-16 19:02:30,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:30,451 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:30,451 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:30,451 INFO L426 AbstractCegarLoop]: === Iteration 518 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:30,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:30,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1565480886, now seen corresponding path program 512 times [2020-01-16 19:02:30,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:30,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983823882] [2020-01-16 19:02:30,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:30,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-01-16 19:02:30,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983823882] [2020-01-16 19:02:30,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:30,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:30,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304811316] [2020-01-16 19:02:30,730 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:30,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:30,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:30,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:30,731 INFO L87 Difference]: Start difference. First operand 393 states and 1360 transitions. Second operand 9 states. [2020-01-16 19:02:30,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:30,832 INFO L93 Difference]: Finished difference Result 613 states and 1809 transitions. [2020-01-16 19:02:30,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:30,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:30,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:30,833 INFO L225 Difference]: With dead ends: 613 [2020-01-16 19:02:30,834 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:02:30,834 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:30,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:02:30,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 391. [2020-01-16 19:02:30,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:02:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1356 transitions. [2020-01-16 19:02:30,842 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1356 transitions. Word has length 22 [2020-01-16 19:02:30,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:30,842 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1356 transitions. [2020-01-16 19:02:30,842 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1356 transitions. [2020-01-16 19:02:30,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:30,843 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:30,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, 1, 1, 1] [2020-01-16 19:02:30,843 INFO L426 AbstractCegarLoop]: === Iteration 519 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:30,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:30,843 INFO L82 PathProgramCache]: Analyzing trace with hash -19765258, now seen corresponding path program 513 times [2020-01-16 19:02:30,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:30,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046258236] [2020-01-16 19:02:30,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:31,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046258236] [2020-01-16 19:02:31,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:31,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:31,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408816974] [2020-01-16 19:02:31,126 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:31,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:31,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:31,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:31,126 INFO L87 Difference]: Start difference. First operand 391 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:02:31,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:31,212 INFO L93 Difference]: Finished difference Result 628 states and 1842 transitions. [2020-01-16 19:02:31,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:31,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:31,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:31,214 INFO L225 Difference]: With dead ends: 628 [2020-01-16 19:02:31,214 INFO L226 Difference]: Without dead ends: 612 [2020-01-16 19:02:31,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:31,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-01-16 19:02:31,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 397. [2020-01-16 19:02:31,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:02:31,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1366 transitions. [2020-01-16 19:02:31,223 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1366 transitions. Word has length 22 [2020-01-16 19:02:31,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:31,223 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1366 transitions. [2020-01-16 19:02:31,223 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:31,223 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1366 transitions. [2020-01-16 19:02:31,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:31,224 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:31,224 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:31,224 INFO L426 AbstractCegarLoop]: === Iteration 520 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:31,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:31,224 INFO L82 PathProgramCache]: Analyzing trace with hash 173055434, now seen corresponding path program 514 times [2020-01-16 19:02:31,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:31,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41987391] [2020-01-16 19:02:31,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:31,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-01-16 19:02:31,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41987391] [2020-01-16 19:02:31,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:31,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:31,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111413699] [2020-01-16 19:02:31,505 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:31,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:31,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:31,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:31,505 INFO L87 Difference]: Start difference. First operand 397 states and 1366 transitions. Second operand 9 states. [2020-01-16 19:02:31,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:31,611 INFO L93 Difference]: Finished difference Result 625 states and 1831 transitions. [2020-01-16 19:02:31,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:31,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:31,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:31,613 INFO L225 Difference]: With dead ends: 625 [2020-01-16 19:02:31,613 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 19:02:31,613 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:31,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 19:02:31,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 391. [2020-01-16 19:02:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:02:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1354 transitions. [2020-01-16 19:02:31,623 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1354 transitions. Word has length 22 [2020-01-16 19:02:31,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:31,623 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1354 transitions. [2020-01-16 19:02:31,623 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1354 transitions. [2020-01-16 19:02:31,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:31,624 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:31,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, 1, 1, 1] [2020-01-16 19:02:31,624 INFO L426 AbstractCegarLoop]: === Iteration 521 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:31,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:31,624 INFO L82 PathProgramCache]: Analyzing trace with hash 34956968, now seen corresponding path program 515 times [2020-01-16 19:02:31,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:31,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499940773] [2020-01-16 19:02:31,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:31,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-01-16 19:02:31,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499940773] [2020-01-16 19:02:31,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:31,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:31,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279014042] [2020-01-16 19:02:31,920 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:31,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:31,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:31,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:31,921 INFO L87 Difference]: Start difference. First operand 391 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:02:32,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:32,024 INFO L93 Difference]: Finished difference Result 609 states and 1800 transitions. [2020-01-16 19:02:32,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:32,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:32,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:32,026 INFO L225 Difference]: With dead ends: 609 [2020-01-16 19:02:32,026 INFO L226 Difference]: Without dead ends: 600 [2020-01-16 19:02:32,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:32,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-01-16 19:02:32,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 392. [2020-01-16 19:02:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1355 transitions. [2020-01-16 19:02:32,035 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1355 transitions. Word has length 22 [2020-01-16 19:02:32,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:32,035 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1355 transitions. [2020-01-16 19:02:32,035 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:32,035 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1355 transitions. [2020-01-16 19:02:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:32,036 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:32,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, 1, 1, 1] [2020-01-16 19:02:32,036 INFO L426 AbstractCegarLoop]: === Iteration 522 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:32,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:32,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2113839568, now seen corresponding path program 516 times [2020-01-16 19:02:32,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:32,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249672948] [2020-01-16 19:02:32,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:32,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249672948] [2020-01-16 19:02:32,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:32,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:32,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815169325] [2020-01-16 19:02:32,313 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:32,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:32,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:32,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:32,314 INFO L87 Difference]: Start difference. First operand 392 states and 1355 transitions. Second operand 9 states. [2020-01-16 19:02:32,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:32,418 INFO L93 Difference]: Finished difference Result 613 states and 1807 transitions. [2020-01-16 19:02:32,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:32,419 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:32,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:32,420 INFO L225 Difference]: With dead ends: 613 [2020-01-16 19:02:32,420 INFO L226 Difference]: Without dead ends: 597 [2020-01-16 19:02:32,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-01-16 19:02:32,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 389. [2020-01-16 19:02:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:02:32,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1350 transitions. [2020-01-16 19:02:32,429 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1350 transitions. Word has length 22 [2020-01-16 19:02:32,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:32,429 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1350 transitions. [2020-01-16 19:02:32,429 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:32,429 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1350 transitions. [2020-01-16 19:02:32,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:32,430 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:32,430 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:32,430 INFO L426 AbstractCegarLoop]: === Iteration 523 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:32,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:32,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1800953154, now seen corresponding path program 517 times [2020-01-16 19:02:32,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:32,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301440364] [2020-01-16 19:02:32,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:32,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301440364] [2020-01-16 19:02:32,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:32,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:32,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148890518] [2020-01-16 19:02:32,703 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:32,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:32,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:32,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:32,704 INFO L87 Difference]: Start difference. First operand 389 states and 1350 transitions. Second operand 9 states. [2020-01-16 19:02:32,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:32,782 INFO L93 Difference]: Finished difference Result 626 states and 1839 transitions. [2020-01-16 19:02:32,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:32,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:32,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:32,784 INFO L225 Difference]: With dead ends: 626 [2020-01-16 19:02:32,784 INFO L226 Difference]: Without dead ends: 610 [2020-01-16 19:02:32,784 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:32,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-01-16 19:02:32,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 395. [2020-01-16 19:02:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:02:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1364 transitions. [2020-01-16 19:02:32,793 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1364 transitions. Word has length 22 [2020-01-16 19:02:32,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:32,793 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1364 transitions. [2020-01-16 19:02:32,793 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:32,793 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1364 transitions. [2020-01-16 19:02:32,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:32,794 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:32,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, 1, 1, 1] [2020-01-16 19:02:32,794 INFO L426 AbstractCegarLoop]: === Iteration 524 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:32,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:32,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1531810480, now seen corresponding path program 518 times [2020-01-16 19:02:32,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:32,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737457478] [2020-01-16 19:02:32,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:33,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-01-16 19:02:33,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737457478] [2020-01-16 19:02:33,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:33,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:33,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819604687] [2020-01-16 19:02:33,069 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:33,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:33,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:33,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:33,069 INFO L87 Difference]: Start difference. First operand 395 states and 1364 transitions. Second operand 9 states. [2020-01-16 19:02:33,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:33,177 INFO L93 Difference]: Finished difference Result 620 states and 1825 transitions. [2020-01-16 19:02:33,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:33,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:33,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:33,178 INFO L225 Difference]: With dead ends: 620 [2020-01-16 19:02:33,179 INFO L226 Difference]: Without dead ends: 607 [2020-01-16 19:02:33,179 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:33,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-01-16 19:02:33,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 392. [2020-01-16 19:02:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1357 transitions. [2020-01-16 19:02:33,188 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1357 transitions. Word has length 22 [2020-01-16 19:02:33,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:33,188 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1357 transitions. [2020-01-16 19:02:33,188 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:33,188 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1357 transitions. [2020-01-16 19:02:33,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:33,188 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:33,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, 1, 1, 1] [2020-01-16 19:02:33,189 INFO L426 AbstractCegarLoop]: === Iteration 525 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:33,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:33,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1906268820, now seen corresponding path program 519 times [2020-01-16 19:02:33,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:33,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619566715] [2020-01-16 19:02:33,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:33,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-01-16 19:02:33,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619566715] [2020-01-16 19:02:33,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:33,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:33,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895964661] [2020-01-16 19:02:33,478 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:33,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:33,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:33,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:33,479 INFO L87 Difference]: Start difference. First operand 392 states and 1357 transitions. Second operand 9 states. [2020-01-16 19:02:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:33,579 INFO L93 Difference]: Finished difference Result 632 states and 1851 transitions. [2020-01-16 19:02:33,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:33,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:33,580 INFO L225 Difference]: With dead ends: 632 [2020-01-16 19:02:33,580 INFO L226 Difference]: Without dead ends: 616 [2020-01-16 19:02:33,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:33,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-01-16 19:02:33,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 398. [2020-01-16 19:02:33,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 19:02:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1367 transitions. [2020-01-16 19:02:33,590 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1367 transitions. Word has length 22 [2020-01-16 19:02:33,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:33,590 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1367 transitions. [2020-01-16 19:02:33,590 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1367 transitions. [2020-01-16 19:02:33,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:33,591 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:33,591 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:33,591 INFO L426 AbstractCegarLoop]: === Iteration 526 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:33,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:33,591 INFO L82 PathProgramCache]: Analyzing trace with hash 2099089512, now seen corresponding path program 520 times [2020-01-16 19:02:33,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:33,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362918321] [2020-01-16 19:02:33,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:33,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-01-16 19:02:33,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362918321] [2020-01-16 19:02:33,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:33,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:33,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989089422] [2020-01-16 19:02:33,881 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:33,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:33,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:33,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:33,881 INFO L87 Difference]: Start difference. First operand 398 states and 1367 transitions. Second operand 9 states. [2020-01-16 19:02:34,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:34,007 INFO L93 Difference]: Finished difference Result 629 states and 1840 transitions. [2020-01-16 19:02:34,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:34,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:34,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:34,008 INFO L225 Difference]: With dead ends: 629 [2020-01-16 19:02:34,009 INFO L226 Difference]: Without dead ends: 610 [2020-01-16 19:02:34,009 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:34,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-01-16 19:02:34,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 392. [2020-01-16 19:02:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1354 transitions. [2020-01-16 19:02:34,018 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1354 transitions. Word has length 22 [2020-01-16 19:02:34,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:34,018 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1354 transitions. [2020-01-16 19:02:34,018 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:34,018 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1354 transitions. [2020-01-16 19:02:34,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:34,019 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:34,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, 1, 1, 1] [2020-01-16 19:02:34,019 INFO L426 AbstractCegarLoop]: === Iteration 527 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:34,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:34,019 INFO L82 PathProgramCache]: Analyzing trace with hash -61178548, now seen corresponding path program 521 times [2020-01-16 19:02:34,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:34,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686694482] [2020-01-16 19:02:34,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:34,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686694482] [2020-01-16 19:02:34,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:34,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:34,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859207271] [2020-01-16 19:02:34,292 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:34,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:34,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:34,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:34,292 INFO L87 Difference]: Start difference. First operand 392 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:02:34,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:34,417 INFO L93 Difference]: Finished difference Result 616 states and 1815 transitions. [2020-01-16 19:02:34,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:34,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:34,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:34,419 INFO L225 Difference]: With dead ends: 616 [2020-01-16 19:02:34,419 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 19:02:34,419 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:34,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 19:02:34,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 394. [2020-01-16 19:02:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:02:34,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1357 transitions. [2020-01-16 19:02:34,429 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1357 transitions. Word has length 22 [2020-01-16 19:02:34,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:34,429 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1357 transitions. [2020-01-16 19:02:34,429 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:34,429 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1357 transitions. [2020-01-16 19:02:34,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:34,429 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:34,429 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:34,430 INFO L426 AbstractCegarLoop]: === Iteration 528 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:34,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:34,430 INFO L82 PathProgramCache]: Analyzing trace with hash 510276258, now seen corresponding path program 522 times [2020-01-16 19:02:34,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:34,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334735337] [2020-01-16 19:02:34,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:34,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-01-16 19:02:34,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334735337] [2020-01-16 19:02:34,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:34,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:34,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826235089] [2020-01-16 19:02:34,704 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:34,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:34,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:34,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:34,705 INFO L87 Difference]: Start difference. First operand 394 states and 1357 transitions. Second operand 9 states. [2020-01-16 19:02:34,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:34,815 INFO L93 Difference]: Finished difference Result 619 states and 1819 transitions. [2020-01-16 19:02:34,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:34,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:34,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:34,817 INFO L225 Difference]: With dead ends: 619 [2020-01-16 19:02:34,817 INFO L226 Difference]: Without dead ends: 601 [2020-01-16 19:02:34,817 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:34,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-01-16 19:02:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 389. [2020-01-16 19:02:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:02:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1348 transitions. [2020-01-16 19:02:34,826 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1348 transitions. Word has length 22 [2020-01-16 19:02:34,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:34,826 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1348 transitions. [2020-01-16 19:02:34,826 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1348 transitions. [2020-01-16 19:02:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:34,827 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:34,827 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:34,827 INFO L426 AbstractCegarLoop]: === Iteration 529 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:34,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:34,827 INFO L82 PathProgramCache]: Analyzing trace with hash -263095990, now seen corresponding path program 523 times [2020-01-16 19:02:34,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:34,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138867340] [2020-01-16 19:02:34,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:35,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138867340] [2020-01-16 19:02:35,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:35,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:35,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131382214] [2020-01-16 19:02:35,135 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:35,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:35,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:35,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:35,135 INFO L87 Difference]: Start difference. First operand 389 states and 1348 transitions. Second operand 9 states. [2020-01-16 19:02:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:35,216 INFO L93 Difference]: Finished difference Result 594 states and 1767 transitions. [2020-01-16 19:02:35,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:35,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:35,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:35,218 INFO L225 Difference]: With dead ends: 594 [2020-01-16 19:02:35,218 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 19:02:35,218 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:35,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 19:02:35,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 391. [2020-01-16 19:02:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:02:35,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1352 transitions. [2020-01-16 19:02:35,230 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1352 transitions. Word has length 22 [2020-01-16 19:02:35,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:35,230 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1352 transitions. [2020-01-16 19:02:35,231 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:35,231 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1352 transitions. [2020-01-16 19:02:35,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:35,231 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:35,232 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:35,232 INFO L426 AbstractCegarLoop]: === Iteration 530 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:35,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:35,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1347844968, now seen corresponding path program 524 times [2020-01-16 19:02:35,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:35,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397304980] [2020-01-16 19:02:35,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:35,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-01-16 19:02:35,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397304980] [2020-01-16 19:02:35,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:35,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:35,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069675809] [2020-01-16 19:02:35,522 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:35,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:35,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:35,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:35,522 INFO L87 Difference]: Start difference. First operand 391 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:02:35,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:35,652 INFO L93 Difference]: Finished difference Result 595 states and 1768 transitions. [2020-01-16 19:02:35,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:35,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:35,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:35,654 INFO L225 Difference]: With dead ends: 595 [2020-01-16 19:02:35,654 INFO L226 Difference]: Without dead ends: 584 [2020-01-16 19:02:35,654 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:35,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-01-16 19:02:35,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 390. [2020-01-16 19:02:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:02:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1350 transitions. [2020-01-16 19:02:35,663 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1350 transitions. Word has length 22 [2020-01-16 19:02:35,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:35,663 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1350 transitions. [2020-01-16 19:02:35,663 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:35,663 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1350 transitions. [2020-01-16 19:02:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:35,663 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:35,663 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:35,663 INFO L426 AbstractCegarLoop]: === Iteration 531 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:35,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:35,664 INFO L82 PathProgramCache]: Analyzing trace with hash -850841312, now seen corresponding path program 525 times [2020-01-16 19:02:35,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:35,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280074481] [2020-01-16 19:02:35,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:35,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-01-16 19:02:35,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280074481] [2020-01-16 19:02:35,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:35,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:35,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294826751] [2020-01-16 19:02:35,949 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:35,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:35,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:35,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:35,949 INFO L87 Difference]: Start difference. First operand 390 states and 1350 transitions. Second operand 9 states. [2020-01-16 19:02:36,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:36,028 INFO L93 Difference]: Finished difference Result 597 states and 1772 transitions. [2020-01-16 19:02:36,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:36,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:36,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:36,029 INFO L225 Difference]: With dead ends: 597 [2020-01-16 19:02:36,029 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 19:02:36,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:36,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 19:02:36,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 391. [2020-01-16 19:02:36,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:02:36,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1351 transitions. [2020-01-16 19:02:36,039 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1351 transitions. Word has length 22 [2020-01-16 19:02:36,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:36,039 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1351 transitions. [2020-01-16 19:02:36,039 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:36,039 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1351 transitions. [2020-01-16 19:02:36,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:36,040 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:36,040 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:36,040 INFO L426 AbstractCegarLoop]: === Iteration 532 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:36,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:36,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1295329448, now seen corresponding path program 526 times [2020-01-16 19:02:36,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:36,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585767493] [2020-01-16 19:02:36,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:36,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-01-16 19:02:36,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585767493] [2020-01-16 19:02:36,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:36,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:36,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572447263] [2020-01-16 19:02:36,318 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:36,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:36,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:36,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:36,319 INFO L87 Difference]: Start difference. First operand 391 states and 1351 transitions. Second operand 9 states. [2020-01-16 19:02:36,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:36,429 INFO L93 Difference]: Finished difference Result 601 states and 1779 transitions. [2020-01-16 19:02:36,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:36,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:36,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:36,431 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:02:36,431 INFO L226 Difference]: Without dead ends: 587 [2020-01-16 19:02:36,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-01-16 19:02:36,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 390. [2020-01-16 19:02:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:02:36,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1349 transitions. [2020-01-16 19:02:36,440 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1349 transitions. Word has length 22 [2020-01-16 19:02:36,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:36,441 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1349 transitions. [2020-01-16 19:02:36,441 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:36,441 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1349 transitions. [2020-01-16 19:02:36,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:36,441 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:36,441 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:36,441 INFO L426 AbstractCegarLoop]: === Iteration 533 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:36,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:36,442 INFO L82 PathProgramCache]: Analyzing trace with hash -840338208, now seen corresponding path program 527 times [2020-01-16 19:02:36,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:36,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988122592] [2020-01-16 19:02:36,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:36,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-01-16 19:02:36,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988122592] [2020-01-16 19:02:36,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:36,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:36,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369844421] [2020-01-16 19:02:36,720 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:36,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:36,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:36,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:36,720 INFO L87 Difference]: Start difference. First operand 390 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:02:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:36,831 INFO L93 Difference]: Finished difference Result 600 states and 1778 transitions. [2020-01-16 19:02:36,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:36,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:36,833 INFO L225 Difference]: With dead ends: 600 [2020-01-16 19:02:36,833 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 19:02:36,833 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:36,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 19:02:36,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 392. [2020-01-16 19:02:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:36,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1352 transitions. [2020-01-16 19:02:36,843 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1352 transitions. Word has length 22 [2020-01-16 19:02:36,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:36,843 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1352 transitions. [2020-01-16 19:02:36,843 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:36,843 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1352 transitions. [2020-01-16 19:02:36,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:36,844 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:36,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, 1, 1, 1] [2020-01-16 19:02:36,844 INFO L426 AbstractCegarLoop]: === Iteration 534 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:36,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:36,844 INFO L82 PathProgramCache]: Analyzing trace with hash -305108406, now seen corresponding path program 528 times [2020-01-16 19:02:36,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:36,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658612865] [2020-01-16 19:02:36,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:37,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-01-16 19:02:37,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658612865] [2020-01-16 19:02:37,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:37,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:37,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860037631] [2020-01-16 19:02:37,122 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:37,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:37,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:37,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:37,122 INFO L87 Difference]: Start difference. First operand 392 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:02:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:37,232 INFO L93 Difference]: Finished difference Result 603 states and 1782 transitions. [2020-01-16 19:02:37,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:37,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:37,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:37,233 INFO L225 Difference]: With dead ends: 603 [2020-01-16 19:02:37,234 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 19:02:37,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:37,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 19:02:37,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 387. [2020-01-16 19:02:37,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:02:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1344 transitions. [2020-01-16 19:02:37,243 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1344 transitions. Word has length 22 [2020-01-16 19:02:37,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:37,243 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1344 transitions. [2020-01-16 19:02:37,243 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:37,243 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1344 transitions. [2020-01-16 19:02:37,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:37,244 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02: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, 1, 1, 1] [2020-01-16 19:02:37,244 INFO L426 AbstractCegarLoop]: === Iteration 535 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:37,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:37,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1273749844, now seen corresponding path program 529 times [2020-01-16 19:02:37,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:37,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445173193] [2020-01-16 19:02:37,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:37,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445173193] [2020-01-16 19:02:37,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:37,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:37,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152917740] [2020-01-16 19:02:37,517 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:37,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:37,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:37,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:37,517 INFO L87 Difference]: Start difference. First operand 387 states and 1344 transitions. Second operand 9 states. [2020-01-16 19:02:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:37,599 INFO L93 Difference]: Finished difference Result 644 states and 1884 transitions. [2020-01-16 19:02:37,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:37,600 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:37,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:37,601 INFO L225 Difference]: With dead ends: 644 [2020-01-16 19:02:37,601 INFO L226 Difference]: Without dead ends: 628 [2020-01-16 19:02:37,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:37,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-01-16 19:02:37,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 396. [2020-01-16 19:02:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:02:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1367 transitions. [2020-01-16 19:02:37,610 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1367 transitions. Word has length 22 [2020-01-16 19:02:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:37,610 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1367 transitions. [2020-01-16 19:02:37,611 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1367 transitions. [2020-01-16 19:02:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:37,611 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:37,611 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:37,611 INFO L426 AbstractCegarLoop]: === Iteration 536 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:37,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:37,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1834818336, now seen corresponding path program 530 times [2020-01-16 19:02:37,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:37,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478020888] [2020-01-16 19:02:37,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:37,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-01-16 19:02:37,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478020888] [2020-01-16 19:02:37,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:37,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:37,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092600349] [2020-01-16 19:02:37,882 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:37,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:37,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:37,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:37,883 INFO L87 Difference]: Start difference. First operand 396 states and 1367 transitions. Second operand 9 states. [2020-01-16 19:02:37,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:37,984 INFO L93 Difference]: Finished difference Result 637 states and 1869 transitions. [2020-01-16 19:02:37,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:37,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:37,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:37,986 INFO L225 Difference]: With dead ends: 637 [2020-01-16 19:02:37,986 INFO L226 Difference]: Without dead ends: 626 [2020-01-16 19:02:37,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:37,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-01-16 19:02:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 394. [2020-01-16 19:02:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:02:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1363 transitions. [2020-01-16 19:02:37,996 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1363 transitions. Word has length 22 [2020-01-16 19:02:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:37,996 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1363 transitions. [2020-01-16 19:02:37,996 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:37,996 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1363 transitions. [2020-01-16 19:02:37,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:37,996 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:37,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, 1, 1, 1] [2020-01-16 19:02:37,997 INFO L426 AbstractCegarLoop]: === Iteration 537 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:37,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:37,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2008524920, now seen corresponding path program 531 times [2020-01-16 19:02:37,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:37,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701899254] [2020-01-16 19:02:37,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:38,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-01-16 19:02:38,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701899254] [2020-01-16 19:02:38,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:38,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:38,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77891440] [2020-01-16 19:02:38,279 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:38,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:38,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:38,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:38,279 INFO L87 Difference]: Start difference. First operand 394 states and 1363 transitions. Second operand 9 states. [2020-01-16 19:02:38,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:38,359 INFO L93 Difference]: Finished difference Result 655 states and 1908 transitions. [2020-01-16 19:02:38,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:38,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:38,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:38,361 INFO L225 Difference]: With dead ends: 655 [2020-01-16 19:02:38,361 INFO L226 Difference]: Without dead ends: 639 [2020-01-16 19:02:38,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-01-16 19:02:38,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 402. [2020-01-16 19:02:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-01-16 19:02:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1376 transitions. [2020-01-16 19:02:38,370 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1376 transitions. Word has length 22 [2020-01-16 19:02:38,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:38,371 INFO L478 AbstractCegarLoop]: Abstraction has 402 states and 1376 transitions. [2020-01-16 19:02:38,371 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:38,371 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1376 transitions. [2020-01-16 19:02:38,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:38,371 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:38,371 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:38,371 INFO L426 AbstractCegarLoop]: === Iteration 538 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:38,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:38,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2138495366, now seen corresponding path program 532 times [2020-01-16 19:02:38,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:38,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704091636] [2020-01-16 19:02:38,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:38,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704091636] [2020-01-16 19:02:38,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:38,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:38,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354731731] [2020-01-16 19:02:38,657 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:38,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:38,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:38,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:38,657 INFO L87 Difference]: Start difference. First operand 402 states and 1376 transitions. Second operand 9 states. [2020-01-16 19:02:38,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:38,768 INFO L93 Difference]: Finished difference Result 653 states and 1898 transitions. [2020-01-16 19:02:38,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:38,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:38,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:38,770 INFO L225 Difference]: With dead ends: 653 [2020-01-16 19:02:38,770 INFO L226 Difference]: Without dead ends: 631 [2020-01-16 19:02:38,770 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:38,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-01-16 19:02:38,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 394. [2020-01-16 19:02:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:02:38,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1360 transitions. [2020-01-16 19:02:38,780 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1360 transitions. Word has length 22 [2020-01-16 19:02:38,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:38,780 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1360 transitions. [2020-01-16 19:02:38,780 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1360 transitions. [2020-01-16 19:02:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:38,781 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:38,781 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:38,781 INFO L426 AbstractCegarLoop]: === Iteration 539 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:38,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:38,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1953802694, now seen corresponding path program 533 times [2020-01-16 19:02:38,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:38,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668289119] [2020-01-16 19:02:38,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:39,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-01-16 19:02:39,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668289119] [2020-01-16 19:02:39,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:39,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:39,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33594693] [2020-01-16 19:02:39,051 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:39,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:39,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:39,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:39,052 INFO L87 Difference]: Start difference. First operand 394 states and 1360 transitions. Second operand 9 states. [2020-01-16 19:02:39,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:39,135 INFO L93 Difference]: Finished difference Result 634 states and 1861 transitions. [2020-01-16 19:02:39,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:39,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:39,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:39,137 INFO L225 Difference]: With dead ends: 634 [2020-01-16 19:02:39,137 INFO L226 Difference]: Without dead ends: 625 [2020-01-16 19:02:39,137 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:39,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-01-16 19:02:39,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 395. [2020-01-16 19:02:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:02:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1361 transitions. [2020-01-16 19:02:39,145 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1361 transitions. Word has length 22 [2020-01-16 19:02:39,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:39,145 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1361 transitions. [2020-01-16 19:02:39,145 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:39,146 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1361 transitions. [2020-01-16 19:02:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:39,146 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:39,146 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:39,146 INFO L426 AbstractCegarLoop]: === Iteration 540 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:39,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:39,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1265453446, now seen corresponding path program 534 times [2020-01-16 19:02:39,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:39,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627171366] [2020-01-16 19:02:39,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:39,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:39,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627171366] [2020-01-16 19:02:39,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:39,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:39,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731671829] [2020-01-16 19:02:39,410 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:39,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:39,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:39,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:39,411 INFO L87 Difference]: Start difference. First operand 395 states and 1361 transitions. Second operand 9 states. [2020-01-16 19:02:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:39,538 INFO L93 Difference]: Finished difference Result 639 states and 1870 transitions. [2020-01-16 19:02:39,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:39,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:39,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:39,539 INFO L225 Difference]: With dead ends: 639 [2020-01-16 19:02:39,540 INFO L226 Difference]: Without dead ends: 621 [2020-01-16 19:02:39,540 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:39,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-01-16 19:02:39,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 391. [2020-01-16 19:02:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:02:39,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1354 transitions. [2020-01-16 19:02:39,549 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1354 transitions. Word has length 22 [2020-01-16 19:02:39,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:39,549 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1354 transitions. [2020-01-16 19:02:39,549 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:39,549 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1354 transitions. [2020-01-16 19:02:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:39,549 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:39,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, 1, 1, 1] [2020-01-16 19:02:39,549 INFO L426 AbstractCegarLoop]: === Iteration 541 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:39,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:39,550 INFO L82 PathProgramCache]: Analyzing trace with hash 830850704, now seen corresponding path program 535 times [2020-01-16 19:02:39,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:39,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625248997] [2020-01-16 19:02:39,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:39,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625248997] [2020-01-16 19:02:39,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:39,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:39,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494711671] [2020-01-16 19:02:39,830 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:39,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:39,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:39,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:39,831 INFO L87 Difference]: Start difference. First operand 391 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:02:39,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:39,910 INFO L93 Difference]: Finished difference Result 640 states and 1873 transitions. [2020-01-16 19:02:39,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:39,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:39,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:39,912 INFO L225 Difference]: With dead ends: 640 [2020-01-16 19:02:39,912 INFO L226 Difference]: Without dead ends: 624 [2020-01-16 19:02:39,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:39,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-01-16 19:02:39,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 395. [2020-01-16 19:02:39,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:02:39,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1362 transitions. [2020-01-16 19:02:39,922 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1362 transitions. Word has length 22 [2020-01-16 19:02:39,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:39,922 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1362 transitions. [2020-01-16 19:02:39,922 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:39,922 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1362 transitions. [2020-01-16 19:02:39,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:39,922 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:39,922 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:39,923 INFO L426 AbstractCegarLoop]: === Iteration 542 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:39,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:39,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1391919196, now seen corresponding path program 536 times [2020-01-16 19:02:39,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:39,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346865089] [2020-01-16 19:02:39,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:40,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:40,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346865089] [2020-01-16 19:02:40,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:40,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:40,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766003768] [2020-01-16 19:02:40,216 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:40,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:40,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:40,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:40,216 INFO L87 Difference]: Start difference. First operand 395 states and 1362 transitions. Second operand 9 states. [2020-01-16 19:02:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:40,300 INFO L93 Difference]: Finished difference Result 633 states and 1858 transitions. [2020-01-16 19:02:40,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:40,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:40,302 INFO L225 Difference]: With dead ends: 633 [2020-01-16 19:02:40,302 INFO L226 Difference]: Without dead ends: 622 [2020-01-16 19:02:40,303 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-01-16 19:02:40,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 393. [2020-01-16 19:02:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:02:40,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1358 transitions. [2020-01-16 19:02:40,318 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1358 transitions. Word has length 22 [2020-01-16 19:02:40,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:40,318 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1358 transitions. [2020-01-16 19:02:40,318 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:40,318 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1358 transitions. [2020-01-16 19:02:40,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:40,318 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:40,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, 1, 1, 1] [2020-01-16 19:02:40,319 INFO L426 AbstractCegarLoop]: === Iteration 543 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:40,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:40,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1357332472, now seen corresponding path program 537 times [2020-01-16 19:02:40,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:40,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15074933] [2020-01-16 19:02:40,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:40,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15074933] [2020-01-16 19:02:40,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:40,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:40,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425882097] [2020-01-16 19:02:40,602 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:40,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:40,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:40,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:40,603 INFO L87 Difference]: Start difference. First operand 393 states and 1358 transitions. Second operand 9 states. [2020-01-16 19:02:40,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:40,704 INFO L93 Difference]: Finished difference Result 648 states and 1891 transitions. [2020-01-16 19:02:40,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:40,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:40,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:40,706 INFO L225 Difference]: With dead ends: 648 [2020-01-16 19:02:40,706 INFO L226 Difference]: Without dead ends: 632 [2020-01-16 19:02:40,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:40,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-01-16 19:02:40,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 399. [2020-01-16 19:02:40,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:02:40,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1368 transitions. [2020-01-16 19:02:40,716 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1368 transitions. Word has length 22 [2020-01-16 19:02:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:40,716 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1368 transitions. [2020-01-16 19:02:40,716 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1368 transitions. [2020-01-16 19:02:40,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:40,716 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:40,716 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:40,716 INFO L426 AbstractCegarLoop]: === Iteration 544 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:40,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:40,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1164511780, now seen corresponding path program 538 times [2020-01-16 19:02:40,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:40,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285719484] [2020-01-16 19:02:40,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:40,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-01-16 19:02:40,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285719484] [2020-01-16 19:02:40,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:40,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:40,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978215563] [2020-01-16 19:02:40,999 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:40,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:40,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:40,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:41,000 INFO L87 Difference]: Start difference. First operand 399 states and 1368 transitions. Second operand 9 states. [2020-01-16 19:02:41,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:41,102 INFO L93 Difference]: Finished difference Result 645 states and 1880 transitions. [2020-01-16 19:02:41,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:41,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:41,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:41,104 INFO L225 Difference]: With dead ends: 645 [2020-01-16 19:02:41,104 INFO L226 Difference]: Without dead ends: 626 [2020-01-16 19:02:41,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:41,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-01-16 19:02:41,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 393. [2020-01-16 19:02:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:02:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1356 transitions. [2020-01-16 19:02:41,114 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1356 transitions. Word has length 22 [2020-01-16 19:02:41,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:41,114 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1356 transitions. [2020-01-16 19:02:41,114 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:41,114 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1356 transitions. [2020-01-16 19:02:41,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:41,115 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:41,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, 1, 1, 1] [2020-01-16 19:02:41,115 INFO L426 AbstractCegarLoop]: === Iteration 545 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:41,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:41,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1302610246, now seen corresponding path program 539 times [2020-01-16 19:02:41,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:41,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241335907] [2020-01-16 19:02:41,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:41,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241335907] [2020-01-16 19:02:41,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:41,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:41,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159607612] [2020-01-16 19:02:41,397 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:41,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:41,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:41,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:41,398 INFO L87 Difference]: Start difference. First operand 393 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:02:41,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:41,482 INFO L93 Difference]: Finished difference Result 629 states and 1849 transitions. [2020-01-16 19:02:41,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:41,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:41,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:41,484 INFO L225 Difference]: With dead ends: 629 [2020-01-16 19:02:41,484 INFO L226 Difference]: Without dead ends: 620 [2020-01-16 19:02:41,484 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:41,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-01-16 19:02:41,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 394. [2020-01-16 19:02:41,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:02:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1357 transitions. [2020-01-16 19:02:41,493 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1357 transitions. Word has length 22 [2020-01-16 19:02:41,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:41,493 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1357 transitions. [2020-01-16 19:02:41,493 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:41,493 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1357 transitions. [2020-01-16 19:02:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:41,494 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:41,494 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:41,494 INFO L426 AbstractCegarLoop]: === Iteration 546 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:41,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:41,494 INFO L82 PathProgramCache]: Analyzing trace with hash 843560514, now seen corresponding path program 540 times [2020-01-16 19:02:41,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:41,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160032851] [2020-01-16 19:02:41,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:41,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-01-16 19:02:41,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160032851] [2020-01-16 19:02:41,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:41,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:41,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843247504] [2020-01-16 19:02:41,774 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:41,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:41,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:41,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:41,774 INFO L87 Difference]: Start difference. First operand 394 states and 1357 transitions. Second operand 9 states. [2020-01-16 19:02:41,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:41,869 INFO L93 Difference]: Finished difference Result 633 states and 1856 transitions. [2020-01-16 19:02:41,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:41,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:41,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:41,871 INFO L225 Difference]: With dead ends: 633 [2020-01-16 19:02:41,871 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 19:02:41,872 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:41,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 19:02:41,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 391. [2020-01-16 19:02:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:02:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1352 transitions. [2020-01-16 19:02:41,881 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1352 transitions. Word has length 22 [2020-01-16 19:02:41,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:41,881 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1352 transitions. [2020-01-16 19:02:41,881 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1352 transitions. [2020-01-16 19:02:41,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:41,882 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:41,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, 1, 1, 1] [2020-01-16 19:02:41,882 INFO L426 AbstractCegarLoop]: === Iteration 547 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:41,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:41,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1122726640, now seen corresponding path program 541 times [2020-01-16 19:02:41,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:41,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79317051] [2020-01-16 19:02:41,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:42,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:42,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79317051] [2020-01-16 19:02:42,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:42,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:42,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628948513] [2020-01-16 19:02:42,186 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:42,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:42,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:42,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:42,187 INFO L87 Difference]: Start difference. First operand 391 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:02:42,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:42,260 INFO L93 Difference]: Finished difference Result 672 states and 1954 transitions. [2020-01-16 19:02:42,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:42,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:42,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:42,262 INFO L225 Difference]: With dead ends: 672 [2020-01-16 19:02:42,262 INFO L226 Difference]: Without dead ends: 656 [2020-01-16 19:02:42,262 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:42,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-01-16 19:02:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 407. [2020-01-16 19:02:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-01-16 19:02:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1390 transitions. [2020-01-16 19:02:42,271 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1390 transitions. Word has length 22 [2020-01-16 19:02:42,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:42,271 INFO L478 AbstractCegarLoop]: Abstraction has 407 states and 1390 transitions. [2020-01-16 19:02:42,271 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:42,271 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1390 transitions. [2020-01-16 19:02:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:42,272 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:42,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, 1, 1, 1] [2020-01-16 19:02:42,272 INFO L426 AbstractCegarLoop]: === Iteration 548 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:42,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:42,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1252697086, now seen corresponding path program 542 times [2020-01-16 19:02:42,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:42,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041386711] [2020-01-16 19:02:42,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:42,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041386711] [2020-01-16 19:02:42,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:42,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:42,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611312942] [2020-01-16 19:02:42,569 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:42,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:42,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:42,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:42,569 INFO L87 Difference]: Start difference. First operand 407 states and 1390 transitions. Second operand 9 states. [2020-01-16 19:02:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:42,667 INFO L93 Difference]: Finished difference Result 670 states and 1944 transitions. [2020-01-16 19:02:42,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:42,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:42,669 INFO L225 Difference]: With dead ends: 670 [2020-01-16 19:02:42,669 INFO L226 Difference]: Without dead ends: 648 [2020-01-16 19:02:42,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-01-16 19:02:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 399. [2020-01-16 19:02:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:02:42,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1370 transitions. [2020-01-16 19:02:42,679 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1370 transitions. Word has length 22 [2020-01-16 19:02:42,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:42,679 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1370 transitions. [2020-01-16 19:02:42,679 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:42,679 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1370 transitions. [2020-01-16 19:02:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:42,679 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:42,679 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:42,679 INFO L426 AbstractCegarLoop]: === Iteration 549 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:42,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:42,680 INFO L82 PathProgramCache]: Analyzing trace with hash -28635052, now seen corresponding path program 543 times [2020-01-16 19:02:42,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:42,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161567761] [2020-01-16 19:02:42,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:42,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:42,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161567761] [2020-01-16 19:02:42,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:42,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:42,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209131590] [2020-01-16 19:02:42,965 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:42,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:42,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:42,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:42,965 INFO L87 Difference]: Start difference. First operand 399 states and 1370 transitions. Second operand 9 states. [2020-01-16 19:02:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:43,037 INFO L93 Difference]: Finished difference Result 669 states and 1941 transitions. [2020-01-16 19:02:43,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:43,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:43,039 INFO L225 Difference]: With dead ends: 669 [2020-01-16 19:02:43,039 INFO L226 Difference]: Without dead ends: 653 [2020-01-16 19:02:43,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:43,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-01-16 19:02:43,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 405. [2020-01-16 19:02:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-01-16 19:02:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1380 transitions. [2020-01-16 19:02:43,049 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1380 transitions. Word has length 22 [2020-01-16 19:02:43,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:43,050 INFO L478 AbstractCegarLoop]: Abstraction has 405 states and 1380 transitions. [2020-01-16 19:02:43,050 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1380 transitions. [2020-01-16 19:02:43,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:43,050 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:43,050 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:43,050 INFO L426 AbstractCegarLoop]: === Iteration 550 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:43,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:43,051 INFO L82 PathProgramCache]: Analyzing trace with hash 164185640, now seen corresponding path program 544 times [2020-01-16 19:02:43,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:43,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490440532] [2020-01-16 19:02:43,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:43,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-01-16 19:02:43,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490440532] [2020-01-16 19:02:43,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:43,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:43,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048821840] [2020-01-16 19:02:43,336 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:43,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:43,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:43,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:43,336 INFO L87 Difference]: Start difference. First operand 405 states and 1380 transitions. Second operand 9 states. [2020-01-16 19:02:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:43,444 INFO L93 Difference]: Finished difference Result 666 states and 1930 transitions. [2020-01-16 19:02:43,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:43,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:43,446 INFO L225 Difference]: With dead ends: 666 [2020-01-16 19:02:43,446 INFO L226 Difference]: Without dead ends: 647 [2020-01-16 19:02:43,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:43,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2020-01-16 19:02:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 399. [2020-01-16 19:02:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:02:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1364 transitions. [2020-01-16 19:02:43,456 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1364 transitions. Word has length 22 [2020-01-16 19:02:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:43,456 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1364 transitions. [2020-01-16 19:02:43,457 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1364 transitions. [2020-01-16 19:02:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:43,457 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:43,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, 1, 1, 1] [2020-01-16 19:02:43,457 INFO L426 AbstractCegarLoop]: === Iteration 551 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:43,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:43,458 INFO L82 PathProgramCache]: Analyzing trace with hash 454801510, now seen corresponding path program 545 times [2020-01-16 19:02:43,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:43,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943837254] [2020-01-16 19:02:43,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:43,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943837254] [2020-01-16 19:02:43,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:43,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:43,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51800296] [2020-01-16 19:02:43,751 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:43,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:43,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:43,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:43,752 INFO L87 Difference]: Start difference. First operand 399 states and 1364 transitions. Second operand 9 states. [2020-01-16 19:02:43,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:43,853 INFO L93 Difference]: Finished difference Result 664 states and 1927 transitions. [2020-01-16 19:02:43,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:43,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:43,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:43,854 INFO L225 Difference]: With dead ends: 664 [2020-01-16 19:02:43,855 INFO L226 Difference]: Without dead ends: 650 [2020-01-16 19:02:43,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:43,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-01-16 19:02:43,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 404. [2020-01-16 19:02:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-01-16 19:02:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1373 transitions. [2020-01-16 19:02:43,864 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1373 transitions. Word has length 22 [2020-01-16 19:02:43,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:43,864 INFO L478 AbstractCegarLoop]: Abstraction has 404 states and 1373 transitions. [2020-01-16 19:02:43,864 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:43,864 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1373 transitions. [2020-01-16 19:02:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:43,864 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:43,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, 1, 1, 1] [2020-01-16 19:02:43,864 INFO L426 AbstractCegarLoop]: === Iteration 552 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:43,865 INFO L82 PathProgramCache]: Analyzing trace with hash 510212770, now seen corresponding path program 546 times [2020-01-16 19:02:43,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:43,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173016248] [2020-01-16 19:02:43,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02: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-01-16 19:02:44,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173016248] [2020-01-16 19:02:44,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:44,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:44,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773355313] [2020-01-16 19:02:44,152 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:44,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:44,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:44,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:44,153 INFO L87 Difference]: Start difference. First operand 404 states and 1373 transitions. Second operand 9 states. [2020-01-16 19:02:44,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:44,252 INFO L93 Difference]: Finished difference Result 663 states and 1920 transitions. [2020-01-16 19:02:44,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:44,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:44,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:44,254 INFO L225 Difference]: With dead ends: 663 [2020-01-16 19:02:44,254 INFO L226 Difference]: Without dead ends: 637 [2020-01-16 19:02:44,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-01-16 19:02:44,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 391. [2020-01-16 19:02:44,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:02:44,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1348 transitions. [2020-01-16 19:02:44,263 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1348 transitions. Word has length 22 [2020-01-16 19:02:44,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:44,263 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1348 transitions. [2020-01-16 19:02:44,264 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:44,264 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1348 transitions. [2020-01-16 19:02:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:44,264 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:44,264 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:44,264 INFO L426 AbstractCegarLoop]: === Iteration 553 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:44,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:44,264 INFO L82 PathProgramCache]: Analyzing trace with hash 415130524, now seen corresponding path program 547 times [2020-01-16 19:02:44,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:44,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051186244] [2020-01-16 19:02:44,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:44,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051186244] [2020-01-16 19:02:44,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:44,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:44,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478202265] [2020-01-16 19:02:44,542 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:44,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:44,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:44,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:44,542 INFO L87 Difference]: Start difference. First operand 391 states and 1348 transitions. Second operand 9 states. [2020-01-16 19:02:44,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:44,618 INFO L93 Difference]: Finished difference Result 625 states and 1839 transitions. [2020-01-16 19:02:44,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:44,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:44,620 INFO L225 Difference]: With dead ends: 625 [2020-01-16 19:02:44,620 INFO L226 Difference]: Without dead ends: 616 [2020-01-16 19:02:44,620 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:44,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-01-16 19:02:44,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 393. [2020-01-16 19:02:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:02:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1352 transitions. [2020-01-16 19:02:44,628 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1352 transitions. Word has length 22 [2020-01-16 19:02:44,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:44,629 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1352 transitions. [2020-01-16 19:02:44,629 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:44,629 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1352 transitions. [2020-01-16 19:02:44,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:44,629 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:44,629 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:44,629 INFO L426 AbstractCegarLoop]: === Iteration 554 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:44,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:44,630 INFO L82 PathProgramCache]: Analyzing trace with hash -660580632, now seen corresponding path program 548 times [2020-01-16 19:02:44,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:44,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321869644] [2020-01-16 19:02:44,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:44,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-01-16 19:02:44,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321869644] [2020-01-16 19:02:44,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:44,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:44,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068926566] [2020-01-16 19:02:44,900 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:44,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:44,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:44,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:44,900 INFO L87 Difference]: Start difference. First operand 393 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:02:44,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:44,999 INFO L93 Difference]: Finished difference Result 630 states and 1848 transitions. [2020-01-16 19:02:44,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:44,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:44,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:45,000 INFO L225 Difference]: With dead ends: 630 [2020-01-16 19:02:45,001 INFO L226 Difference]: Without dead ends: 615 [2020-01-16 19:02:45,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-01-16 19:02:45,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 392. [2020-01-16 19:02:45,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1350 transitions. [2020-01-16 19:02:45,010 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1350 transitions. Word has length 22 [2020-01-16 19:02:45,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:45,010 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1350 transitions. [2020-01-16 19:02:45,010 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:45,010 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1350 transitions. [2020-01-16 19:02:45,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:45,011 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:45,011 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:45,011 INFO L426 AbstractCegarLoop]: === Iteration 555 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:45,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:45,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1509222112, now seen corresponding path program 549 times [2020-01-16 19:02:45,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:45,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379717000] [2020-01-16 19:02:45,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:45,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-01-16 19:02:45,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379717000] [2020-01-16 19:02:45,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:45,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:45,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477129810] [2020-01-16 19:02:45,299 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:45,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:45,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:45,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:45,299 INFO L87 Difference]: Start difference. First operand 392 states and 1350 transitions. Second operand 9 states. [2020-01-16 19:02:45,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:45,372 INFO L93 Difference]: Finished difference Result 624 states and 1836 transitions. [2020-01-16 19:02:45,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:45,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:45,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:45,374 INFO L225 Difference]: With dead ends: 624 [2020-01-16 19:02:45,374 INFO L226 Difference]: Without dead ends: 615 [2020-01-16 19:02:45,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:45,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-01-16 19:02:45,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 393. [2020-01-16 19:02:45,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:02:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1351 transitions. [2020-01-16 19:02:45,383 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1351 transitions. Word has length 22 [2020-01-16 19:02:45,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:45,383 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1351 transitions. [2020-01-16 19:02:45,383 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:45,384 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1351 transitions. [2020-01-16 19:02:45,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:45,384 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:45,384 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:45,384 INFO L426 AbstractCegarLoop]: === Iteration 556 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:45,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:45,384 INFO L82 PathProgramCache]: Analyzing trace with hash -639574424, now seen corresponding path program 550 times [2020-01-16 19:02:45,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:45,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352497301] [2020-01-16 19:02:45,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:45,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-01-16 19:02:45,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352497301] [2020-01-16 19:02:45,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:45,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:45,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872471003] [2020-01-16 19:02:45,664 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:45,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:45,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:45,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:45,664 INFO L87 Difference]: Start difference. First operand 393 states and 1351 transitions. Second operand 9 states. [2020-01-16 19:02:45,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:45,768 INFO L93 Difference]: Finished difference Result 628 states and 1843 transitions. [2020-01-16 19:02:45,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:45,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:45,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:45,770 INFO L225 Difference]: With dead ends: 628 [2020-01-16 19:02:45,770 INFO L226 Difference]: Without dead ends: 614 [2020-01-16 19:02:45,770 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:45,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-01-16 19:02:45,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 392. [2020-01-16 19:02:45,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1349 transitions. [2020-01-16 19:02:45,780 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1349 transitions. Word has length 22 [2020-01-16 19:02:45,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:45,780 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1349 transitions. [2020-01-16 19:02:45,780 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:45,780 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1349 transitions. [2020-01-16 19:02:45,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:45,781 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:45,781 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:45,781 INFO L426 AbstractCegarLoop]: === Iteration 557 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:45,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:45,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1446203488, now seen corresponding path program 551 times [2020-01-16 19:02:45,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:45,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045992448] [2020-01-16 19:02:45,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:46,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-01-16 19:02:46,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045992448] [2020-01-16 19:02:46,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:46,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:46,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003585210] [2020-01-16 19:02:46,056 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:46,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:46,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:46,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:46,057 INFO L87 Difference]: Start difference. First operand 392 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:02:46,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:46,174 INFO L93 Difference]: Finished difference Result 638 states and 1867 transitions. [2020-01-16 19:02:46,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:46,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:46,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:46,176 INFO L225 Difference]: With dead ends: 638 [2020-01-16 19:02:46,176 INFO L226 Difference]: Without dead ends: 624 [2020-01-16 19:02:46,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:46,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-01-16 19:02:46,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 397. [2020-01-16 19:02:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:02:46,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1358 transitions. [2020-01-16 19:02:46,186 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1358 transitions. Word has length 22 [2020-01-16 19:02:46,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:46,186 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1358 transitions. [2020-01-16 19:02:46,186 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:46,187 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1358 transitions. [2020-01-16 19:02:46,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:46,187 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:46,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, 1, 1, 1] [2020-01-16 19:02:46,187 INFO L426 AbstractCegarLoop]: === Iteration 558 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:46,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:46,187 INFO L82 PathProgramCache]: Analyzing trace with hash 373118108, now seen corresponding path program 552 times [2020-01-16 19:02:46,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:46,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801730496] [2020-01-16 19:02:46,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:46,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801730496] [2020-01-16 19:02:46,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:46,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:46,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440212663] [2020-01-16 19:02:46,474 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:46,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:46,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:46,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:46,474 INFO L87 Difference]: Start difference. First operand 397 states and 1358 transitions. Second operand 9 states. [2020-01-16 19:02:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:46,576 INFO L93 Difference]: Finished difference Result 637 states and 1860 transitions. [2020-01-16 19:02:46,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:46,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:46,578 INFO L225 Difference]: With dead ends: 637 [2020-01-16 19:02:46,578 INFO L226 Difference]: Without dead ends: 614 [2020-01-16 19:02:46,578 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-01-16 19:02:46,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 387. [2020-01-16 19:02:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:02:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1340 transitions. [2020-01-16 19:02:46,588 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1340 transitions. Word has length 22 [2020-01-16 19:02:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:46,589 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1340 transitions. [2020-01-16 19:02:46,589 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1340 transitions. [2020-01-16 19:02:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:46,589 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02: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, 1, 1, 1] [2020-01-16 19:02:46,589 INFO L426 AbstractCegarLoop]: === Iteration 559 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:46,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:46,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1176860342, now seen corresponding path program 553 times [2020-01-16 19:02:46,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:46,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660222454] [2020-01-16 19:02:46,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:46,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660222454] [2020-01-16 19:02:46,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:46,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:46,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725447401] [2020-01-16 19:02:46,878 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:46,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:46,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:46,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:46,878 INFO L87 Difference]: Start difference. First operand 387 states and 1340 transitions. Second operand 9 states. [2020-01-16 19:02:46,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:46,956 INFO L93 Difference]: Finished difference Result 658 states and 1925 transitions. [2020-01-16 19:02:46,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:46,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:46,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:46,958 INFO L225 Difference]: With dead ends: 658 [2020-01-16 19:02:46,958 INFO L226 Difference]: Without dead ends: 642 [2020-01-16 19:02:46,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:46,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-01-16 19:02:46,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 399. [2020-01-16 19:02:46,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:02:46,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1374 transitions. [2020-01-16 19:02:46,968 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1374 transitions. Word has length 22 [2020-01-16 19:02:46,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:46,969 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1374 transitions. [2020-01-16 19:02:46,969 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:46,969 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1374 transitions. [2020-01-16 19:02:46,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:46,969 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:46,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, 1, 1, 1] [2020-01-16 19:02:46,969 INFO L426 AbstractCegarLoop]: === Iteration 560 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:46,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:46,970 INFO L82 PathProgramCache]: Analyzing trace with hash 214656680, now seen corresponding path program 554 times [2020-01-16 19:02:46,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:46,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550811784] [2020-01-16 19:02:46,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:47,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:47,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550811784] [2020-01-16 19:02:47,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:47,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:47,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686660261] [2020-01-16 19:02:47,255 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:47,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:47,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:47,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:47,255 INFO L87 Difference]: Start difference. First operand 399 states and 1374 transitions. Second operand 9 states. [2020-01-16 19:02:47,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:47,361 INFO L93 Difference]: Finished difference Result 652 states and 1911 transitions. [2020-01-16 19:02:47,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:47,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:47,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:47,362 INFO L225 Difference]: With dead ends: 652 [2020-01-16 19:02:47,363 INFO L226 Difference]: Without dead ends: 639 [2020-01-16 19:02:47,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-01-16 19:02:47,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 396. [2020-01-16 19:02:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:02:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1367 transitions. [2020-01-16 19:02:47,372 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1367 transitions. Word has length 22 [2020-01-16 19:02:47,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:47,372 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1367 transitions. [2020-01-16 19:02:47,372 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1367 transitions. [2020-01-16 19:02:47,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:47,373 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:47,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, 1, 1, 1] [2020-01-16 19:02:47,373 INFO L426 AbstractCegarLoop]: === Iteration 561 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:47,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:47,373 INFO L82 PathProgramCache]: Analyzing trace with hash -504976568, now seen corresponding path program 555 times [2020-01-16 19:02:47,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:47,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280326302] [2020-01-16 19:02:47,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:47,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280326302] [2020-01-16 19:02:47,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:47,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:47,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636365614] [2020-01-16 19:02:47,657 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:47,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:47,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:47,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:47,658 INFO L87 Difference]: Start difference. First operand 396 states and 1367 transitions. Second operand 9 states. [2020-01-16 19:02:47,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:47,742 INFO L93 Difference]: Finished difference Result 667 states and 1943 transitions. [2020-01-16 19:02:47,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:47,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:47,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:47,744 INFO L225 Difference]: With dead ends: 667 [2020-01-16 19:02:47,744 INFO L226 Difference]: Without dead ends: 651 [2020-01-16 19:02:47,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:47,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2020-01-16 19:02:47,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 404. [2020-01-16 19:02:47,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-01-16 19:02:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1380 transitions. [2020-01-16 19:02:47,754 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1380 transitions. Word has length 22 [2020-01-16 19:02:47,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:47,754 INFO L478 AbstractCegarLoop]: Abstraction has 404 states and 1380 transitions. [2020-01-16 19:02:47,754 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:47,754 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1380 transitions. [2020-01-16 19:02:47,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:47,754 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:47,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, 1, 1, 1] [2020-01-16 19:02:47,754 INFO L426 AbstractCegarLoop]: === Iteration 562 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:47,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:47,755 INFO L82 PathProgramCache]: Analyzing trace with hash -634947014, now seen corresponding path program 556 times [2020-01-16 19:02:47,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:47,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063486794] [2020-01-16 19:02:47,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:48,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-01-16 19:02:48,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063486794] [2020-01-16 19:02:48,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:48,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:48,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183725386] [2020-01-16 19:02:48,038 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:48,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:48,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:48,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:48,038 INFO L87 Difference]: Start difference. First operand 404 states and 1380 transitions. Second operand 9 states. [2020-01-16 19:02:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:48,139 INFO L93 Difference]: Finished difference Result 665 states and 1933 transitions. [2020-01-16 19:02:48,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:48,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:48,141 INFO L225 Difference]: With dead ends: 665 [2020-01-16 19:02:48,141 INFO L226 Difference]: Without dead ends: 643 [2020-01-16 19:02:48,141 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:48,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-01-16 19:02:48,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 396. [2020-01-16 19:02:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:02:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1363 transitions. [2020-01-16 19:02:48,150 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1363 transitions. Word has length 22 [2020-01-16 19:02:48,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:48,150 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1363 transitions. [2020-01-16 19:02:48,150 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:48,150 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1363 transitions. [2020-01-16 19:02:48,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:48,151 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:48,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, 1, 1, 1] [2020-01-16 19:02:48,151 INFO L426 AbstractCegarLoop]: === Iteration 563 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:48,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:48,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1399338556, now seen corresponding path program 557 times [2020-01-16 19:02:48,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:48,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311156204] [2020-01-16 19:02:48,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:48,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:48,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311156204] [2020-01-16 19:02:48,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:48,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:48,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402207114] [2020-01-16 19:02:48,419 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:48,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:48,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:48,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:48,419 INFO L87 Difference]: Start difference. First operand 396 states and 1363 transitions. Second operand 9 states. [2020-01-16 19:02:48,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:48,514 INFO L93 Difference]: Finished difference Result 649 states and 1902 transitions. [2020-01-16 19:02:48,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:48,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:48,515 INFO L225 Difference]: With dead ends: 649 [2020-01-16 19:02:48,516 INFO L226 Difference]: Without dead ends: 639 [2020-01-16 19:02:48,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-01-16 19:02:48,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 398. [2020-01-16 19:02:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 19:02:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1366 transitions. [2020-01-16 19:02:48,526 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1366 transitions. Word has length 22 [2020-01-16 19:02:48,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:48,526 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1366 transitions. [2020-01-16 19:02:48,526 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:48,526 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1366 transitions. [2020-01-16 19:02:48,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:48,526 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:48,527 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:48,527 INFO L426 AbstractCegarLoop]: === Iteration 564 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:48,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:48,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1977678550, now seen corresponding path program 558 times [2020-01-16 19:02:48,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:48,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407866632] [2020-01-16 19:02:48,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:48,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-01-16 19:02:48,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407866632] [2020-01-16 19:02:48,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:48,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:48,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514775422] [2020-01-16 19:02:48,799 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:48,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:48,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:48,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:48,800 INFO L87 Difference]: Start difference. First operand 398 states and 1366 transitions. Second operand 9 states. [2020-01-16 19:02:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:48,896 INFO L93 Difference]: Finished difference Result 653 states and 1908 transitions. [2020-01-16 19:02:48,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:48,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:48,898 INFO L225 Difference]: With dead ends: 653 [2020-01-16 19:02:48,898 INFO L226 Difference]: Without dead ends: 633 [2020-01-16 19:02:48,899 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:48,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-01-16 19:02:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 392. [2020-01-16 19:02:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1354 transitions. [2020-01-16 19:02:48,908 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1354 transitions. Word has length 22 [2020-01-16 19:02:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:48,908 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1354 transitions. [2020-01-16 19:02:48,908 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:48,908 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1354 transitions. [2020-01-16 19:02:48,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:48,908 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:48,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, 1, 1, 1] [2020-01-16 19:02:48,909 INFO L426 AbstractCegarLoop]: === Iteration 565 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:48,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:48,909 INFO L82 PathProgramCache]: Analyzing trace with hash 733961202, now seen corresponding path program 559 times [2020-01-16 19:02:48,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:48,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638177013] [2020-01-16 19:02:48,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:49,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-01-16 19:02:49,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638177013] [2020-01-16 19:02:49,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:49,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:49,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788995220] [2020-01-16 19:02:49,192 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:49,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:49,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:49,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:49,192 INFO L87 Difference]: Start difference. First operand 392 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:02:49,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:49,274 INFO L93 Difference]: Finished difference Result 654 states and 1913 transitions. [2020-01-16 19:02:49,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:49,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:49,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:49,276 INFO L225 Difference]: With dead ends: 654 [2020-01-16 19:02:49,276 INFO L226 Difference]: Without dead ends: 638 [2020-01-16 19:02:49,277 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:49,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-01-16 19:02:49,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 398. [2020-01-16 19:02:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 19:02:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1368 transitions. [2020-01-16 19:02:49,286 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1368 transitions. Word has length 22 [2020-01-16 19:02:49,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:49,286 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1368 transitions. [2020-01-16 19:02:49,286 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:49,286 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1368 transitions. [2020-01-16 19:02:49,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:49,287 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:49,287 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:49,287 INFO L426 AbstractCegarLoop]: === Iteration 566 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:49,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:49,287 INFO L82 PathProgramCache]: Analyzing trace with hash -228242460, now seen corresponding path program 560 times [2020-01-16 19:02:49,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:49,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010293606] [2020-01-16 19:02:49,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:49,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:49,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010293606] [2020-01-16 19:02:49,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:49,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:49,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887668465] [2020-01-16 19:02:49,558 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:49,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:49,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:49,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:49,559 INFO L87 Difference]: Start difference. First operand 398 states and 1368 transitions. Second operand 9 states. [2020-01-16 19:02:49,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:49,658 INFO L93 Difference]: Finished difference Result 648 states and 1899 transitions. [2020-01-16 19:02:49,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:49,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:49,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:49,660 INFO L225 Difference]: With dead ends: 648 [2020-01-16 19:02:49,660 INFO L226 Difference]: Without dead ends: 635 [2020-01-16 19:02:49,660 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:49,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-01-16 19:02:49,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 395. [2020-01-16 19:02:49,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:02:49,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1361 transitions. [2020-01-16 19:02:49,670 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1361 transitions. Word has length 22 [2020-01-16 19:02:49,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:49,670 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1361 transitions. [2020-01-16 19:02:49,670 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:49,670 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1361 transitions. [2020-01-16 19:02:49,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:49,670 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:49,670 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:49,671 INFO L426 AbstractCegarLoop]: === Iteration 567 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:49,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:49,671 INFO L82 PathProgramCache]: Analyzing trace with hash 146215880, now seen corresponding path program 561 times [2020-01-16 19:02:49,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:49,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628483890] [2020-01-16 19:02:49,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:49,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-01-16 19:02:49,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628483890] [2020-01-16 19:02:49,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:49,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:49,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547714224] [2020-01-16 19:02:49,950 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:49,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:49,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:49,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:49,951 INFO L87 Difference]: Start difference. First operand 395 states and 1361 transitions. Second operand 9 states. [2020-01-16 19:02:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:50,036 INFO L93 Difference]: Finished difference Result 660 states and 1925 transitions. [2020-01-16 19:02:50,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:50,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:50,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:50,038 INFO L225 Difference]: With dead ends: 660 [2020-01-16 19:02:50,038 INFO L226 Difference]: Without dead ends: 644 [2020-01-16 19:02:50,038 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:50,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-01-16 19:02:50,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 401. [2020-01-16 19:02:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-01-16 19:02:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1371 transitions. [2020-01-16 19:02:50,048 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1371 transitions. Word has length 22 [2020-01-16 19:02:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:50,049 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 1371 transitions. [2020-01-16 19:02:50,049 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:50,049 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1371 transitions. [2020-01-16 19:02:50,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:50,049 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:50,049 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:50,049 INFO L426 AbstractCegarLoop]: === Iteration 568 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:50,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:50,050 INFO L82 PathProgramCache]: Analyzing trace with hash 339036572, now seen corresponding path program 562 times [2020-01-16 19:02:50,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:50,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20493541] [2020-01-16 19:02:50,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:50,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-01-16 19:02:50,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20493541] [2020-01-16 19:02:50,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:50,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:50,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303731247] [2020-01-16 19:02:50,330 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:50,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:50,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:50,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:50,331 INFO L87 Difference]: Start difference. First operand 401 states and 1371 transitions. Second operand 9 states. [2020-01-16 19:02:50,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:50,435 INFO L93 Difference]: Finished difference Result 657 states and 1914 transitions. [2020-01-16 19:02:50,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:50,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:50,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:50,437 INFO L225 Difference]: With dead ends: 657 [2020-01-16 19:02:50,437 INFO L226 Difference]: Without dead ends: 638 [2020-01-16 19:02:50,438 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:50,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-01-16 19:02:50,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 395. [2020-01-16 19:02:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:02:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1358 transitions. [2020-01-16 19:02:50,447 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1358 transitions. Word has length 22 [2020-01-16 19:02:50,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:50,447 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1358 transitions. [2020-01-16 19:02:50,447 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:50,447 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1358 transitions. [2020-01-16 19:02:50,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:50,448 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:50,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, 1, 1, 1] [2020-01-16 19:02:50,448 INFO L426 AbstractCegarLoop]: === Iteration 569 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:50,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:50,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1821231488, now seen corresponding path program 563 times [2020-01-16 19:02:50,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:50,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420538625] [2020-01-16 19:02:50,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:50,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-01-16 19:02:50,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420538625] [2020-01-16 19:02:50,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:50,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:50,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349023307] [2020-01-16 19:02:50,732 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:50,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:50,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:50,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:50,733 INFO L87 Difference]: Start difference. First operand 395 states and 1358 transitions. Second operand 9 states. [2020-01-16 19:02:50,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:50,830 INFO L93 Difference]: Finished difference Result 644 states and 1889 transitions. [2020-01-16 19:02:50,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:50,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:50,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:50,832 INFO L225 Difference]: With dead ends: 644 [2020-01-16 19:02:50,832 INFO L226 Difference]: Without dead ends: 634 [2020-01-16 19:02:50,832 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-01-16 19:02:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 397. [2020-01-16 19:02:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:02:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1361 transitions. [2020-01-16 19:02:50,841 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1361 transitions. Word has length 22 [2020-01-16 19:02:50,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:50,841 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1361 transitions. [2020-01-16 19:02:50,841 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:50,841 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1361 transitions. [2020-01-16 19:02:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:50,842 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:50,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, 1, 1, 1] [2020-01-16 19:02:50,842 INFO L426 AbstractCegarLoop]: === Iteration 570 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:50,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:50,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1249776682, now seen corresponding path program 564 times [2020-01-16 19:02:50,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:50,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162806925] [2020-01-16 19:02:50,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:51,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-01-16 19:02:51,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162806925] [2020-01-16 19:02:51,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:51,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:51,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408840369] [2020-01-16 19:02:51,115 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:51,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:51,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:51,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:51,116 INFO L87 Difference]: Start difference. First operand 397 states and 1361 transitions. Second operand 9 states. [2020-01-16 19:02:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:51,222 INFO L93 Difference]: Finished difference Result 647 states and 1893 transitions. [2020-01-16 19:02:51,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:51,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:51,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:51,224 INFO L225 Difference]: With dead ends: 647 [2020-01-16 19:02:51,224 INFO L226 Difference]: Without dead ends: 629 [2020-01-16 19:02:51,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:51,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-01-16 19:02:51,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 392. [2020-01-16 19:02:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:51,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1351 transitions. [2020-01-16 19:02:51,234 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1351 transitions. Word has length 22 [2020-01-16 19:02:51,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:51,234 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1351 transitions. [2020-01-16 19:02:51,234 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:51,234 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1351 transitions. [2020-01-16 19:02:51,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:51,234 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:51,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, 1, 1, 1] [2020-01-16 19:02:51,235 INFO L426 AbstractCegarLoop]: === Iteration 571 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:51,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:51,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1545212366, now seen corresponding path program 565 times [2020-01-16 19:02:51,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:51,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595240591] [2020-01-16 19:02:51,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:51,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-01-16 19:02:51,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595240591] [2020-01-16 19:02:51,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:51,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:51,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477058244] [2020-01-16 19:02:51,526 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:51,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:51,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:51,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:51,527 INFO L87 Difference]: Start difference. First operand 392 states and 1351 transitions. Second operand 9 states. [2020-01-16 19:02:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:51,604 INFO L93 Difference]: Finished difference Result 680 states and 1976 transitions. [2020-01-16 19:02:51,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:51,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:51,606 INFO L225 Difference]: With dead ends: 680 [2020-01-16 19:02:51,606 INFO L226 Difference]: Without dead ends: 664 [2020-01-16 19:02:51,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:51,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-01-16 19:02:51,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 408. [2020-01-16 19:02:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2020-01-16 19:02:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1389 transitions. [2020-01-16 19:02:51,615 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 1389 transitions. Word has length 22 [2020-01-16 19:02:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:51,615 INFO L478 AbstractCegarLoop]: Abstraction has 408 states and 1389 transitions. [2020-01-16 19:02:51,615 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:51,615 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 1389 transitions. [2020-01-16 19:02:51,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:51,616 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:51,616 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:51,616 INFO L426 AbstractCegarLoop]: === Iteration 572 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:51,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:51,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1675182812, now seen corresponding path program 566 times [2020-01-16 19:02:51,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:51,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532744351] [2020-01-16 19:02:51,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:51,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532744351] [2020-01-16 19:02:51,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:51,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:51,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250708718] [2020-01-16 19:02:51,916 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:51,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:51,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:51,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:51,917 INFO L87 Difference]: Start difference. First operand 408 states and 1389 transitions. Second operand 9 states. [2020-01-16 19:02:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:52,018 INFO L93 Difference]: Finished difference Result 678 states and 1966 transitions. [2020-01-16 19:02:52,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:52,019 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:52,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:52,020 INFO L225 Difference]: With dead ends: 678 [2020-01-16 19:02:52,020 INFO L226 Difference]: Without dead ends: 656 [2020-01-16 19:02:52,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:52,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-01-16 19:02:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 400. [2020-01-16 19:02:52,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-01-16 19:02:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1369 transitions. [2020-01-16 19:02:52,029 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1369 transitions. Word has length 22 [2020-01-16 19:02:52,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:52,029 INFO L478 AbstractCegarLoop]: Abstraction has 400 states and 1369 transitions. [2020-01-16 19:02:52,030 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1369 transitions. [2020-01-16 19:02:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:52,030 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:52,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, 1, 1, 1] [2020-01-16 19:02:52,030 INFO L426 AbstractCegarLoop]: === Iteration 573 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:52,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:52,031 INFO L82 PathProgramCache]: Analyzing trace with hash -451120778, now seen corresponding path program 567 times [2020-01-16 19:02:52,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:52,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066643085] [2020-01-16 19:02:52,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:52,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-01-16 19:02:52,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066643085] [2020-01-16 19:02:52,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:52,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:52,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501992922] [2020-01-16 19:02:52,323 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:52,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:52,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:52,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:52,323 INFO L87 Difference]: Start difference. First operand 400 states and 1369 transitions. Second operand 9 states. [2020-01-16 19:02:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:52,400 INFO L93 Difference]: Finished difference Result 677 states and 1963 transitions. [2020-01-16 19:02:52,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:52,401 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:52,402 INFO L225 Difference]: With dead ends: 677 [2020-01-16 19:02:52,402 INFO L226 Difference]: Without dead ends: 661 [2020-01-16 19:02:52,403 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:52,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2020-01-16 19:02:52,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 406. [2020-01-16 19:02:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-01-16 19:02:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1379 transitions. [2020-01-16 19:02:52,412 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1379 transitions. Word has length 22 [2020-01-16 19:02:52,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:52,412 INFO L478 AbstractCegarLoop]: Abstraction has 406 states and 1379 transitions. [2020-01-16 19:02:52,412 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1379 transitions. [2020-01-16 19:02:52,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:52,413 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:52,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, 1, 1, 1] [2020-01-16 19:02:52,413 INFO L426 AbstractCegarLoop]: === Iteration 574 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:52,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:52,413 INFO L82 PathProgramCache]: Analyzing trace with hash -258300086, now seen corresponding path program 568 times [2020-01-16 19:02:52,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:52,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496032161] [2020-01-16 19:02:52,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:52,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:52,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496032161] [2020-01-16 19:02:52,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:52,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:52,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581672792] [2020-01-16 19:02:52,703 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:52,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:52,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:52,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:52,703 INFO L87 Difference]: Start difference. First operand 406 states and 1379 transitions. Second operand 9 states. [2020-01-16 19:02:52,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:52,807 INFO L93 Difference]: Finished difference Result 674 states and 1952 transitions. [2020-01-16 19:02:52,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:52,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:52,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:52,809 INFO L225 Difference]: With dead ends: 674 [2020-01-16 19:02:52,809 INFO L226 Difference]: Without dead ends: 655 [2020-01-16 19:02:52,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:52,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2020-01-16 19:02:52,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 400. [2020-01-16 19:02:52,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-01-16 19:02:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1363 transitions. [2020-01-16 19:02:52,819 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1363 transitions. Word has length 22 [2020-01-16 19:02:52,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:52,819 INFO L478 AbstractCegarLoop]: Abstraction has 400 states and 1363 transitions. [2020-01-16 19:02:52,819 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:52,819 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1363 transitions. [2020-01-16 19:02:52,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:52,820 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:52,820 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:52,820 INFO L426 AbstractCegarLoop]: === Iteration 575 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:52,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:52,820 INFO L82 PathProgramCache]: Analyzing trace with hash 32315784, now seen corresponding path program 569 times [2020-01-16 19:02:52,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:52,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202406456] [2020-01-16 19:02:52,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:53,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:53,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202406456] [2020-01-16 19:02:53,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:53,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:53,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573566885] [2020-01-16 19:02:53,116 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:53,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:53,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:53,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:53,116 INFO L87 Difference]: Start difference. First operand 400 states and 1363 transitions. Second operand 9 states. [2020-01-16 19:02:53,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:53,212 INFO L93 Difference]: Finished difference Result 672 states and 1949 transitions. [2020-01-16 19:02:53,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:53,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:53,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:53,214 INFO L225 Difference]: With dead ends: 672 [2020-01-16 19:02:53,214 INFO L226 Difference]: Without dead ends: 658 [2020-01-16 19:02:53,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:53,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-01-16 19:02:53,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 405. [2020-01-16 19:02:53,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-01-16 19:02:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1372 transitions. [2020-01-16 19:02:53,224 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1372 transitions. Word has length 22 [2020-01-16 19:02:53,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:53,225 INFO L478 AbstractCegarLoop]: Abstraction has 405 states and 1372 transitions. [2020-01-16 19:02:53,225 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:53,225 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1372 transitions. [2020-01-16 19:02:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:53,225 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:53,225 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:53,226 INFO L426 AbstractCegarLoop]: === Iteration 576 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:53,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:53,226 INFO L82 PathProgramCache]: Analyzing trace with hash 87727044, now seen corresponding path program 570 times [2020-01-16 19:02:53,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:53,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58300107] [2020-01-16 19:02:53,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:53,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58300107] [2020-01-16 19:02:53,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:53,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:53,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706333825] [2020-01-16 19:02:53,508 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:53,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:53,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:53,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:53,509 INFO L87 Difference]: Start difference. First operand 405 states and 1372 transitions. Second operand 9 states. [2020-01-16 19:02:53,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:53,626 INFO L93 Difference]: Finished difference Result 671 states and 1942 transitions. [2020-01-16 19:02:53,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:53,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:53,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:53,628 INFO L225 Difference]: With dead ends: 671 [2020-01-16 19:02:53,628 INFO L226 Difference]: Without dead ends: 645 [2020-01-16 19:02:53,629 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-01-16 19:02:53,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 392. [2020-01-16 19:02:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:02:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1346 transitions. [2020-01-16 19:02:53,638 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1346 transitions. Word has length 22 [2020-01-16 19:02:53,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:53,638 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1346 transitions. [2020-01-16 19:02:53,638 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1346 transitions. [2020-01-16 19:02:53,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:53,639 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:53,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, 1, 1, 1] [2020-01-16 19:02:53,639 INFO L426 AbstractCegarLoop]: === Iteration 577 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:53,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:53,639 INFO L82 PathProgramCache]: Analyzing trace with hash 757609128, now seen corresponding path program 571 times [2020-01-16 19:02:53,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:53,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062386235] [2020-01-16 19:02:53,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:53,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-01-16 19:02:53,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062386235] [2020-01-16 19:02:53,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:53,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:53,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398978315] [2020-01-16 19:02:53,909 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:53,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:53,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:53,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:53,909 INFO L87 Difference]: Start difference. First operand 392 states and 1346 transitions. Second operand 9 states. [2020-01-16 19:02:54,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:54,010 INFO L93 Difference]: Finished difference Result 640 states and 1879 transitions. [2020-01-16 19:02:54,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:54,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:54,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:54,011 INFO L225 Difference]: With dead ends: 640 [2020-01-16 19:02:54,012 INFO L226 Difference]: Without dead ends: 630 [2020-01-16 19:02:54,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:54,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-01-16 19:02:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 396. [2020-01-16 19:02:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:02:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1356 transitions. [2020-01-16 19:02:54,021 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1356 transitions. Word has length 22 [2020-01-16 19:02:54,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:54,021 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1356 transitions. [2020-01-16 19:02:54,021 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1356 transitions. [2020-01-16 19:02:54,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:54,021 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:54,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, 1, 1, 1] [2020-01-16 19:02:54,021 INFO L426 AbstractCegarLoop]: === Iteration 578 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:54,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:54,022 INFO L82 PathProgramCache]: Analyzing trace with hash -160341062, now seen corresponding path program 572 times [2020-01-16 19:02:54,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:54,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152320392] [2020-01-16 19:02:54,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:54,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-01-16 19:02:54,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152320392] [2020-01-16 19:02:54,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:54,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:54,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10102333] [2020-01-16 19:02:54,296 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:54,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:54,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:54,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:54,296 INFO L87 Difference]: Start difference. First operand 396 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:02:54,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:54,406 INFO L93 Difference]: Finished difference Result 644 states and 1885 transitions. [2020-01-16 19:02:54,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:54,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:54,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:54,408 INFO L225 Difference]: With dead ends: 644 [2020-01-16 19:02:54,408 INFO L226 Difference]: Without dead ends: 628 [2020-01-16 19:02:54,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-01-16 19:02:54,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 394. [2020-01-16 19:02:54,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:02:54,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1351 transitions. [2020-01-16 19:02:54,417 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1351 transitions. Word has length 22 [2020-01-16 19:02:54,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:54,417 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1351 transitions. [2020-01-16 19:02:54,417 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:54,417 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1351 transitions. [2020-01-16 19:02:54,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:54,418 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:54,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, 1, 1, 1] [2020-01-16 19:02:54,418 INFO L426 AbstractCegarLoop]: === Iteration 579 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:54,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:54,418 INFO L82 PathProgramCache]: Analyzing trace with hash -315476252, now seen corresponding path program 573 times [2020-01-16 19:02:54,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:54,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811551172] [2020-01-16 19:02:54,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:54,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:54,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811551172] [2020-01-16 19:02:54,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:54,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:54,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188204693] [2020-01-16 19:02:54,687 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:54,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:54,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:54,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:54,687 INFO L87 Difference]: Start difference. First operand 394 states and 1351 transitions. Second operand 9 states. [2020-01-16 19:02:54,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:54,799 INFO L93 Difference]: Finished difference Result 639 states and 1875 transitions. [2020-01-16 19:02:54,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:54,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:54,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:54,801 INFO L225 Difference]: With dead ends: 639 [2020-01-16 19:02:54,801 INFO L226 Difference]: Without dead ends: 629 [2020-01-16 19:02:54,801 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:54,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-01-16 19:02:54,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 396. [2020-01-16 19:02:54,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:02:54,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1354 transitions. [2020-01-16 19:02:54,810 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1354 transitions. Word has length 22 [2020-01-16 19:02:54,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:54,811 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1354 transitions. [2020-01-16 19:02:54,811 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:54,811 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1354 transitions. [2020-01-16 19:02:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:54,811 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:54,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, 1, 1, 1] [2020-01-16 19:02:54,811 INFO L426 AbstractCegarLoop]: === Iteration 580 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:54,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:54,812 INFO L82 PathProgramCache]: Analyzing trace with hash 255978554, now seen corresponding path program 574 times [2020-01-16 19:02:54,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:54,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626698799] [2020-01-16 19:02:54,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:55,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-01-16 19:02:55,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626698799] [2020-01-16 19:02:55,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:55,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:55,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261110105] [2020-01-16 19:02:55,088 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:55,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:55,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:55,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:55,088 INFO L87 Difference]: Start difference. First operand 396 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:02:55,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:55,203 INFO L93 Difference]: Finished difference Result 642 states and 1879 transitions. [2020-01-16 19:02:55,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:55,203 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:55,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:55,205 INFO L225 Difference]: With dead ends: 642 [2020-01-16 19:02:55,205 INFO L226 Difference]: Without dead ends: 627 [2020-01-16 19:02:55,205 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:55,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-01-16 19:02:55,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 394. [2020-01-16 19:02:55,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:02:55,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1349 transitions. [2020-01-16 19:02:55,215 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1349 transitions. Word has length 22 [2020-01-16 19:02:55,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:55,215 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1349 transitions. [2020-01-16 19:02:55,215 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:55,215 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1349 transitions. [2020-01-16 19:02:55,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:55,215 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:55,215 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:55,216 INFO L426 AbstractCegarLoop]: === Iteration 581 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:55,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:55,216 INFO L82 PathProgramCache]: Analyzing trace with hash 374888740, now seen corresponding path program 575 times [2020-01-16 19:02:55,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:55,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251890244] [2020-01-16 19:02:55,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:55,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-01-16 19:02:55,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251890244] [2020-01-16 19:02:55,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:55,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:55,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654847978] [2020-01-16 19:02:55,498 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:55,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:55,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:55,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:55,498 INFO L87 Difference]: Start difference. First operand 394 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:02:55,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:55,596 INFO L93 Difference]: Finished difference Result 650 states and 1898 transitions. [2020-01-16 19:02:55,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:55,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:55,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:55,598 INFO L225 Difference]: With dead ends: 650 [2020-01-16 19:02:55,598 INFO L226 Difference]: Without dead ends: 636 [2020-01-16 19:02:55,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:55,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2020-01-16 19:02:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 399. [2020-01-16 19:02:55,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:02:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1358 transitions. [2020-01-16 19:02:55,608 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1358 transitions. Word has length 22 [2020-01-16 19:02:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:55,608 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1358 transitions. [2020-01-16 19:02:55,608 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:55,608 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1358 transitions. [2020-01-16 19:02:55,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:55,609 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:55,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, 1, 1, 1] [2020-01-16 19:02:55,609 INFO L426 AbstractCegarLoop]: === Iteration 582 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:55,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:55,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1864293736, now seen corresponding path program 576 times [2020-01-16 19:02:55,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:55,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012244813] [2020-01-16 19:02:55,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:55,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-01-16 19:02:55,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012244813] [2020-01-16 19:02:55,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:55,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:55,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150968999] [2020-01-16 19:02:55,885 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:55,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:55,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:55,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:55,885 INFO L87 Difference]: Start difference. First operand 399 states and 1358 transitions. Second operand 9 states. [2020-01-16 19:02:55,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:55,994 INFO L93 Difference]: Finished difference Result 649 states and 1891 transitions. [2020-01-16 19:02:55,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:55,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:55,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:55,996 INFO L225 Difference]: With dead ends: 649 [2020-01-16 19:02:55,996 INFO L226 Difference]: Without dead ends: 624 [2020-01-16 19:02:55,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:56,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-01-16 19:02:56,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 387. [2020-01-16 19:02:56,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:02:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-01-16 19:02:56,006 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-01-16 19:02:56,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:56,006 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-01-16 19:02:56,006 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-01-16 19:02:56,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:56,006 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:56,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, 1, 1, 1] [2020-01-16 19:02:56,006 INFO L426 AbstractCegarLoop]: === Iteration 583 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:56,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:56,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1447260328, now seen corresponding path program 577 times [2020-01-16 19:02:56,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:56,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682494271] [2020-01-16 19:02:56,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:56,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682494271] [2020-01-16 19:02:56,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:56,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:56,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109385019] [2020-01-16 19:02:56,306 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:56,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:56,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:56,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:56,306 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:02:56,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:56,402 INFO L93 Difference]: Finished difference Result 586 states and 1743 transitions. [2020-01-16 19:02:56,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:56,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:56,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:56,404 INFO L225 Difference]: With dead ends: 586 [2020-01-16 19:02:56,404 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:02:56,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:56,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:02:56,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 390. [2020-01-16 19:02:56,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:02:56,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1344 transitions. [2020-01-16 19:02:56,414 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1344 transitions. Word has length 22 [2020-01-16 19:02:56,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:56,414 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1344 transitions. [2020-01-16 19:02:56,414 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1344 transitions. [2020-01-16 19:02:56,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:56,415 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:56,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, 1, 1, 1] [2020-01-16 19:02:56,415 INFO L426 AbstractCegarLoop]: === Iteration 584 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:56,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:56,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1236766010, now seen corresponding path program 578 times [2020-01-16 19:02:56,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:56,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516570654] [2020-01-16 19:02:56,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:56,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-01-16 19:02:56,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516570654] [2020-01-16 19:02:56,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:56,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:56,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808626391] [2020-01-16 19:02:56,698 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:56,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:56,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:56,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:56,698 INFO L87 Difference]: Start difference. First operand 390 states and 1344 transitions. Second operand 9 states. [2020-01-16 19:02:56,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:56,809 INFO L93 Difference]: Finished difference Result 587 states and 1744 transitions. [2020-01-16 19:02:56,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:56,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:56,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:56,813 INFO L225 Difference]: With dead ends: 587 [2020-01-16 19:02:56,813 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:02:56,814 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:02:56,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 389. [2020-01-16 19:02:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:02:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1342 transitions. [2020-01-16 19:02:56,823 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1342 transitions. Word has length 22 [2020-01-16 19:02:56,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:56,823 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1342 transitions. [2020-01-16 19:02:56,823 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:56,823 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1342 transitions. [2020-01-16 19:02:56,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:56,824 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:56,824 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:56,824 INFO L426 AbstractCegarLoop]: === Iteration 585 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:56,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:56,824 INFO L82 PathProgramCache]: Analyzing trace with hash -234576582, now seen corresponding path program 579 times [2020-01-16 19:02:56,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:56,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215421591] [2020-01-16 19:02:56,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:57,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-01-16 19:02:57,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215421591] [2020-01-16 19:02:57,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:57,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:57,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693476645] [2020-01-16 19:02:57,092 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:57,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:57,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:57,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:57,092 INFO L87 Difference]: Start difference. First operand 389 states and 1342 transitions. Second operand 9 states. [2020-01-16 19:02:57,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:57,178 INFO L93 Difference]: Finished difference Result 590 states and 1750 transitions. [2020-01-16 19:02:57,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:57,178 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:57,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:57,180 INFO L225 Difference]: With dead ends: 590 [2020-01-16 19:02:57,180 INFO L226 Difference]: Without dead ends: 581 [2020-01-16 19:02:57,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:57,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-01-16 19:02:57,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 390. [2020-01-16 19:02:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:02:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1343 transitions. [2020-01-16 19:02:57,189 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1343 transitions. Word has length 22 [2020-01-16 19:02:57,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:57,189 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1343 transitions. [2020-01-16 19:02:57,190 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:57,190 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1343 transitions. [2020-01-16 19:02:57,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:57,190 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:57,190 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:57,190 INFO L426 AbstractCegarLoop]: === Iteration 586 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:57,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:57,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1310287738, now seen corresponding path program 580 times [2020-01-16 19:02:57,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:57,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269216568] [2020-01-16 19:02:57,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:57,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269216568] [2020-01-16 19:02:57,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:57,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:57,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765907879] [2020-01-16 19:02:57,454 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:57,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:57,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:57,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:57,454 INFO L87 Difference]: Start difference. First operand 390 states and 1343 transitions. Second operand 9 states. [2020-01-16 19:02:57,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:57,572 INFO L93 Difference]: Finished difference Result 595 states and 1759 transitions. [2020-01-16 19:02:57,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:57,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:57,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:57,573 INFO L225 Difference]: With dead ends: 595 [2020-01-16 19:02:57,574 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:02:57,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:57,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:02:57,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 389. [2020-01-16 19:02:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:02:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1341 transitions. [2020-01-16 19:02:57,582 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1341 transitions. Word has length 22 [2020-01-16 19:02:57,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:57,582 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1341 transitions. [2020-01-16 19:02:57,582 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1341 transitions. [2020-01-16 19:02:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:57,583 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:57,583 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:57,583 INFO L426 AbstractCegarLoop]: === Iteration 587 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:57,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:57,583 INFO L82 PathProgramCache]: Analyzing trace with hash -224073478, now seen corresponding path program 581 times [2020-01-16 19:02:57,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:57,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713014868] [2020-01-16 19:02:57,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:57,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713014868] [2020-01-16 19:02:57,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:57,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:57,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013876753] [2020-01-16 19:02:57,847 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:57,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:57,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:57,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:57,848 INFO L87 Difference]: Start difference. First operand 389 states and 1341 transitions. Second operand 9 states. [2020-01-16 19:02:57,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:57,952 INFO L93 Difference]: Finished difference Result 593 states and 1756 transitions. [2020-01-16 19:02:57,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:57,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:57,954 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:02:57,954 INFO L226 Difference]: Without dead ends: 583 [2020-01-16 19:02:57,954 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:57,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-01-16 19:02:57,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 391. [2020-01-16 19:02:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:02:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1344 transitions. [2020-01-16 19:02:57,963 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1344 transitions. Word has length 22 [2020-01-16 19:02:57,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:57,963 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1344 transitions. [2020-01-16 19:02:57,963 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1344 transitions. [2020-01-16 19:02:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:57,964 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:57,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, 1, 1, 1] [2020-01-16 19:02:57,964 INFO L426 AbstractCegarLoop]: === Iteration 588 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:57,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:57,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1384241704, now seen corresponding path program 582 times [2020-01-16 19:02:57,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:57,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330339658] [2020-01-16 19:02:57,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:58,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330339658] [2020-01-16 19:02:58,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:58,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:58,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013004503] [2020-01-16 19:02:58,231 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:58,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:58,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:58,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:58,231 INFO L87 Difference]: Start difference. First operand 391 states and 1344 transitions. Second operand 9 states. [2020-01-16 19:02:58,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:58,333 INFO L93 Difference]: Finished difference Result 597 states and 1762 transitions. [2020-01-16 19:02:58,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:58,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:58,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:58,335 INFO L225 Difference]: With dead ends: 597 [2020-01-16 19:02:58,335 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:02:58,335 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:58,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:02:58,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 388. [2020-01-16 19:02:58,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:02:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1339 transitions. [2020-01-16 19:02:58,345 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1339 transitions. Word has length 22 [2020-01-16 19:02:58,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:58,345 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1339 transitions. [2020-01-16 19:02:58,345 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:58,345 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1339 transitions. [2020-01-16 19:02:58,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:58,346 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:58,346 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:58,346 INFO L426 AbstractCegarLoop]: === Iteration 589 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:58,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:58,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1004361188, now seen corresponding path program 583 times [2020-01-16 19:02:58,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:58,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034218713] [2020-01-16 19:02:58,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:58,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-01-16 19:02:58,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034218713] [2020-01-16 19:02:58,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:58,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:58,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6296162] [2020-01-16 19:02:58,644 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:58,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:58,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:58,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:58,644 INFO L87 Difference]: Start difference. First operand 388 states and 1339 transitions. Second operand 9 states. [2020-01-16 19:02:58,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:58,767 INFO L93 Difference]: Finished difference Result 585 states and 1740 transitions. [2020-01-16 19:02:58,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:58,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:58,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:58,769 INFO L225 Difference]: With dead ends: 585 [2020-01-16 19:02:58,769 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:02:58,769 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:58,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:02:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 390. [2020-01-16 19:02:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:02:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1343 transitions. [2020-01-16 19:02:58,779 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1343 transitions. Word has length 22 [2020-01-16 19:02:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:58,779 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1343 transitions. [2020-01-16 19:02:58,779 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1343 transitions. [2020-01-16 19:02:58,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:58,780 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:58,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, 1, 1, 1] [2020-01-16 19:02:58,780 INFO L426 AbstractCegarLoop]: === Iteration 590 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:58,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:58,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1679665150, now seen corresponding path program 584 times [2020-01-16 19:02:58,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:58,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389489811] [2020-01-16 19:02:58,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:59,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-01-16 19:02:59,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389489811] [2020-01-16 19:02:59,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:59,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:59,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892340642] [2020-01-16 19:02:59,089 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:59,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:59,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:59,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:59,090 INFO L87 Difference]: Start difference. First operand 390 states and 1343 transitions. Second operand 9 states. [2020-01-16 19:02:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:59,194 INFO L93 Difference]: Finished difference Result 586 states and 1741 transitions. [2020-01-16 19:02:59,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:59,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:59,195 INFO L225 Difference]: With dead ends: 586 [2020-01-16 19:02:59,195 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:02:59,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:59,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:02:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 389. [2020-01-16 19:02:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:02:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1341 transitions. [2020-01-16 19:02:59,206 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1341 transitions. Word has length 22 [2020-01-16 19:02:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:59,206 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1341 transitions. [2020-01-16 19:02:59,206 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1341 transitions. [2020-01-16 19:02:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:59,207 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:59,207 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:59,207 INFO L426 AbstractCegarLoop]: === Iteration 591 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:59,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:59,207 INFO L82 PathProgramCache]: Analyzing trace with hash 416615866, now seen corresponding path program 585 times [2020-01-16 19:02:59,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:59,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524100119] [2020-01-16 19:02:59,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:59,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524100119] [2020-01-16 19:02:59,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:59,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:59,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789226107] [2020-01-16 19:02:59,496 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:59,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:59,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:59,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:59,497 INFO L87 Difference]: Start difference. First operand 389 states and 1341 transitions. Second operand 9 states. [2020-01-16 19:02:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:59,584 INFO L93 Difference]: Finished difference Result 588 states and 1745 transitions. [2020-01-16 19:02:59,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:02:59,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:02:59,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:59,586 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:02:59,586 INFO L226 Difference]: Without dead ends: 579 [2020-01-16 19:02:59,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:02:59,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-01-16 19:02:59,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 390. [2020-01-16 19:02:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:02:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1342 transitions. [2020-01-16 19:02:59,596 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1342 transitions. Word has length 22 [2020-01-16 19:02:59,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:59,596 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1342 transitions. [2020-01-16 19:02:59,596 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:02:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1342 transitions. [2020-01-16 19:02:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:02:59,597 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:59,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, 1, 1, 1] [2020-01-16 19:02:59,597 INFO L426 AbstractCegarLoop]: === Iteration 592 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:02:59,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:59,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1732180670, now seen corresponding path program 586 times [2020-01-16 19:02:59,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:59,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990031207] [2020-01-16 19:02:59,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:59,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-01-16 19:02:59,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990031207] [2020-01-16 19:02:59,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:59,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:02:59,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527827591] [2020-01-16 19:02:59,880 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:02:59,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:59,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:02:59,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:59,881 INFO L87 Difference]: Start difference. First operand 390 states and 1342 transitions. Second operand 9 states. [2020-01-16 19:03:00,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:00,000 INFO L93 Difference]: Finished difference Result 592 states and 1752 transitions. [2020-01-16 19:03:00,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:00,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:00,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:00,002 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:03:00,002 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:03:00,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:03:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 389. [2020-01-16 19:03:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:03:00,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1340 transitions. [2020-01-16 19:03:00,012 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1340 transitions. Word has length 22 [2020-01-16 19:03:00,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:00,012 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1340 transitions. [2020-01-16 19:03:00,012 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1340 transitions. [2020-01-16 19:03:00,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:00,013 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:00,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, 1, 1, 1] [2020-01-16 19:03:00,013 INFO L426 AbstractCegarLoop]: === Iteration 593 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:00,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:00,013 INFO L82 PathProgramCache]: Analyzing trace with hash 427118970, now seen corresponding path program 587 times [2020-01-16 19:03:00,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:00,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357251143] [2020-01-16 19:03:00,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:00,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357251143] [2020-01-16 19:03:00,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:00,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:00,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562919768] [2020-01-16 19:03:00,307 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:00,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:00,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:00,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:00,307 INFO L87 Difference]: Start difference. First operand 389 states and 1340 transitions. Second operand 9 states. [2020-01-16 19:03:00,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:00,418 INFO L93 Difference]: Finished difference Result 591 states and 1751 transitions. [2020-01-16 19:03:00,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:00,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:00,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:00,419 INFO L225 Difference]: With dead ends: 591 [2020-01-16 19:03:00,420 INFO L226 Difference]: Without dead ends: 581 [2020-01-16 19:03:00,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:00,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-01-16 19:03:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 391. [2020-01-16 19:03:00,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:03:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1343 transitions. [2020-01-16 19:03:00,429 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1343 transitions. Word has length 22 [2020-01-16 19:03:00,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:00,429 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1343 transitions. [2020-01-16 19:03:00,430 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1343 transitions. [2020-01-16 19:03:00,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:00,430 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:00,430 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:00,430 INFO L426 AbstractCegarLoop]: === Iteration 594 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:00,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:00,430 INFO L82 PathProgramCache]: Analyzing trace with hash 962348772, now seen corresponding path program 588 times [2020-01-16 19:03:00,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:00,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810257095] [2020-01-16 19:03:00,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:00,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810257095] [2020-01-16 19:03:00,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:00,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:00,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725349084] [2020-01-16 19:03:00,711 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:00,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:00,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:00,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:00,711 INFO L87 Difference]: Start difference. First operand 391 states and 1343 transitions. Second operand 9 states. [2020-01-16 19:03:00,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:00,824 INFO L93 Difference]: Finished difference Result 594 states and 1755 transitions. [2020-01-16 19:03:00,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:00,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:00,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:00,826 INFO L225 Difference]: With dead ends: 594 [2020-01-16 19:03:00,826 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:03:00,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:00,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:03:00,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 388. [2020-01-16 19:03:00,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:03:00,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-01-16 19:03:00,836 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-01-16 19:03:00,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:00,836 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-01-16 19:03:00,836 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-01-16 19:03:00,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:00,836 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:00,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, 1, 1, 1] [2020-01-16 19:03:00,836 INFO L426 AbstractCegarLoop]: === Iteration 595 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:00,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:00,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1274812380, now seen corresponding path program 589 times [2020-01-16 19:03:00,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:00,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071866039] [2020-01-16 19:03:00,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:01,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071866039] [2020-01-16 19:03:01,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:01,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:01,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139835228] [2020-01-16 19:03:01,111 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:01,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:01,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:01,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:01,111 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:03:01,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:01,206 INFO L93 Difference]: Finished difference Result 596 states and 1764 transitions. [2020-01-16 19:03:01,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:01,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:01,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:01,208 INFO L225 Difference]: With dead ends: 596 [2020-01-16 19:03:01,208 INFO L226 Difference]: Without dead ends: 587 [2020-01-16 19:03:01,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:01,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-01-16 19:03:01,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 390. [2020-01-16 19:03:01,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:03:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1342 transitions. [2020-01-16 19:03:01,218 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1342 transitions. Word has length 22 [2020-01-16 19:03:01,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:01,218 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1342 transitions. [2020-01-16 19:03:01,218 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:01,218 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1342 transitions. [2020-01-16 19:03:01,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:01,219 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:01,219 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:01,219 INFO L426 AbstractCegarLoop]: === Iteration 596 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:01,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:01,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1944443760, now seen corresponding path program 590 times [2020-01-16 19:03:01,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:01,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541830641] [2020-01-16 19:03:01,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:01,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-01-16 19:03:01,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541830641] [2020-01-16 19:03:01,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:01,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:01,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572217040] [2020-01-16 19:03:01,497 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:01,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:01,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:01,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:01,498 INFO L87 Difference]: Start difference. First operand 390 states and 1342 transitions. Second operand 9 states. [2020-01-16 19:03:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:01,607 INFO L93 Difference]: Finished difference Result 601 states and 1773 transitions. [2020-01-16 19:03:01,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:01,608 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:01,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:01,609 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:03:01,609 INFO L226 Difference]: Without dead ends: 586 [2020-01-16 19:03:01,610 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:01,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-01-16 19:03:01,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 389. [2020-01-16 19:03:01,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:03:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1340 transitions. [2020-01-16 19:03:01,618 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1340 transitions. Word has length 22 [2020-01-16 19:03:01,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:01,618 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1340 transitions. [2020-01-16 19:03:01,618 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1340 transitions. [2020-01-16 19:03:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:01,619 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:01,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, 1, 1, 1] [2020-01-16 19:03:01,619 INFO L426 AbstractCegarLoop]: === Iteration 597 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:01,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:01,619 INFO L82 PathProgramCache]: Analyzing trace with hash -180720792, now seen corresponding path program 591 times [2020-01-16 19:03:01,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:01,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646647855] [2020-01-16 19:03:01,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:01,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-01-16 19:03:01,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646647855] [2020-01-16 19:03:01,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:01,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:01,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324870640] [2020-01-16 19:03:01,899 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:01,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:01,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:01,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:01,899 INFO L87 Difference]: Start difference. First operand 389 states and 1340 transitions. Second operand 9 states. [2020-01-16 19:03:02,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:02,001 INFO L93 Difference]: Finished difference Result 595 states and 1761 transitions. [2020-01-16 19:03:02,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:02,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:02,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:02,003 INFO L225 Difference]: With dead ends: 595 [2020-01-16 19:03:02,003 INFO L226 Difference]: Without dead ends: 586 [2020-01-16 19:03:02,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:02,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-01-16 19:03:02,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 390. [2020-01-16 19:03:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:03:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1341 transitions. [2020-01-16 19:03:02,013 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1341 transitions. Word has length 22 [2020-01-16 19:03:02,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:02,013 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1341 transitions. [2020-01-16 19:03:02,013 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1341 transitions. [2020-01-16 19:03:02,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:02,014 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:02,014 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:02,014 INFO L426 AbstractCegarLoop]: === Iteration 598 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:02,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:02,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1965449968, now seen corresponding path program 592 times [2020-01-16 19:03:02,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:02,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610421648] [2020-01-16 19:03:02,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:02,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-01-16 19:03:02,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610421648] [2020-01-16 19:03:02,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:02,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:02,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523672482] [2020-01-16 19:03:02,303 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:02,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:02,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:02,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:02,303 INFO L87 Difference]: Start difference. First operand 390 states and 1341 transitions. Second operand 9 states. [2020-01-16 19:03:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:02,413 INFO L93 Difference]: Finished difference Result 599 states and 1768 transitions. [2020-01-16 19:03:02,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:02,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:02,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:02,415 INFO L225 Difference]: With dead ends: 599 [2020-01-16 19:03:02,415 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 19:03:02,415 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 19:03:02,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 389. [2020-01-16 19:03:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:03:02,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1339 transitions. [2020-01-16 19:03:02,426 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1339 transitions. Word has length 22 [2020-01-16 19:03:02,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:02,427 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1339 transitions. [2020-01-16 19:03:02,427 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:02,427 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1339 transitions. [2020-01-16 19:03:02,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:02,428 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:02,428 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:02,428 INFO L426 AbstractCegarLoop]: === Iteration 599 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:02,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:02,428 INFO L82 PathProgramCache]: Analyzing trace with hash -243739416, now seen corresponding path program 593 times [2020-01-16 19:03:02,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:02,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997132303] [2020-01-16 19:03:02,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:02,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-01-16 19:03:02,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997132303] [2020-01-16 19:03:02,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:02,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:02,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124944977] [2020-01-16 19:03:02,734 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:02,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:02,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:02,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:02,734 INFO L87 Difference]: Start difference. First operand 389 states and 1339 transitions. Second operand 9 states. [2020-01-16 19:03:02,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:02,852 INFO L93 Difference]: Finished difference Result 609 states and 1792 transitions. [2020-01-16 19:03:02,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:02,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:02,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:02,854 INFO L225 Difference]: With dead ends: 609 [2020-01-16 19:03:02,854 INFO L226 Difference]: Without dead ends: 595 [2020-01-16 19:03:02,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:02,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-01-16 19:03:02,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 394. [2020-01-16 19:03:02,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:03:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1348 transitions. [2020-01-16 19:03:02,866 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1348 transitions. Word has length 22 [2020-01-16 19:03:02,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:02,866 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1348 transitions. [2020-01-16 19:03:02,866 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:02,866 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1348 transitions. [2020-01-16 19:03:02,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:02,866 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:02,866 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:02,867 INFO L426 AbstractCegarLoop]: === Iteration 600 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:02,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:02,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1316824796, now seen corresponding path program 594 times [2020-01-16 19:03:02,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:02,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34838409] [2020-01-16 19:03:02,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:03,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34838409] [2020-01-16 19:03:03,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:03,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:03,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661624] [2020-01-16 19:03:03,154 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:03,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:03,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:03,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:03,154 INFO L87 Difference]: Start difference. First operand 394 states and 1348 transitions. Second operand 9 states. [2020-01-16 19:03:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:03,268 INFO L93 Difference]: Finished difference Result 608 states and 1785 transitions. [2020-01-16 19:03:03,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:03,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:03,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:03,270 INFO L225 Difference]: With dead ends: 608 [2020-01-16 19:03:03,270 INFO L226 Difference]: Without dead ends: 589 [2020-01-16 19:03:03,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:03,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-01-16 19:03:03,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 388. [2020-01-16 19:03:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:03:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1337 transitions. [2020-01-16 19:03:03,279 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1337 transitions. Word has length 22 [2020-01-16 19:03:03,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:03,280 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1337 transitions. [2020-01-16 19:03:03,280 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1337 transitions. [2020-01-16 19:03:03,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:03,280 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:03,280 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:03,280 INFO L426 AbstractCegarLoop]: === Iteration 601 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:03,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:03,281 INFO L82 PathProgramCache]: Analyzing trace with hash 661724802, now seen corresponding path program 595 times [2020-01-16 19:03:03,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:03,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585946706] [2020-01-16 19:03:03,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:03,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585946706] [2020-01-16 19:03:03,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:03,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:03,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770189290] [2020-01-16 19:03:03,553 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:03,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:03,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:03,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:03,553 INFO L87 Difference]: Start difference. First operand 388 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:03:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:03,667 INFO L93 Difference]: Finished difference Result 603 states and 1782 transitions. [2020-01-16 19:03:03,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:03,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:03,669 INFO L225 Difference]: With dead ends: 603 [2020-01-16 19:03:03,669 INFO L226 Difference]: Without dead ends: 593 [2020-01-16 19:03:03,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-01-16 19:03:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 392. [2020-01-16 19:03:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:03:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1347 transitions. [2020-01-16 19:03:03,678 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1347 transitions. Word has length 22 [2020-01-16 19:03:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:03,678 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1347 transitions. [2020-01-16 19:03:03,678 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1347 transitions. [2020-01-16 19:03:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:03,679 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:03,679 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:03,679 INFO L426 AbstractCegarLoop]: === Iteration 602 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:03,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:03,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2024927312, now seen corresponding path program 596 times [2020-01-16 19:03:03,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:03,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797504802] [2020-01-16 19:03:03,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:03,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797504802] [2020-01-16 19:03:03,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:03,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:03,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427895079] [2020-01-16 19:03:03,951 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:03,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:03,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:03,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:03,951 INFO L87 Difference]: Start difference. First operand 392 states and 1347 transitions. Second operand 9 states. [2020-01-16 19:03:04,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:04,062 INFO L93 Difference]: Finished difference Result 607 states and 1788 transitions. [2020-01-16 19:03:04,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:04,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:04,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:04,064 INFO L225 Difference]: With dead ends: 607 [2020-01-16 19:03:04,064 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 19:03:04,064 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:04,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 19:03:04,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 390. [2020-01-16 19:03:04,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:03:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1342 transitions. [2020-01-16 19:03:04,074 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1342 transitions. Word has length 22 [2020-01-16 19:03:04,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:04,074 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1342 transitions. [2020-01-16 19:03:04,074 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:04,074 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1342 transitions. [2020-01-16 19:03:04,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:04,075 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:04,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, 1, 1, 1] [2020-01-16 19:03:04,075 INFO L426 AbstractCegarLoop]: === Iteration 603 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:04,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:04,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1755816390, now seen corresponding path program 597 times [2020-01-16 19:03:04,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:04,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201556787] [2020-01-16 19:03:04,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:04,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201556787] [2020-01-16 19:03:04,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:04,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:04,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780561887] [2020-01-16 19:03:04,359 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:04,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:04,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:04,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:04,360 INFO L87 Difference]: Start difference. First operand 390 states and 1342 transitions. Second operand 9 states. [2020-01-16 19:03:04,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:04,472 INFO L93 Difference]: Finished difference Result 602 states and 1778 transitions. [2020-01-16 19:03:04,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:04,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:04,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:04,474 INFO L225 Difference]: With dead ends: 602 [2020-01-16 19:03:04,474 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 19:03:04,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:04,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 19:03:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 392. [2020-01-16 19:03:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:03:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1345 transitions. [2020-01-16 19:03:04,484 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1345 transitions. Word has length 22 [2020-01-16 19:03:04,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:04,484 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1345 transitions. [2020-01-16 19:03:04,484 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:04,484 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1345 transitions. [2020-01-16 19:03:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:04,484 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:04,485 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:04,485 INFO L426 AbstractCegarLoop]: === Iteration 604 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:04,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:04,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2003921104, now seen corresponding path program 598 times [2020-01-16 19:03:04,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:04,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381951374] [2020-01-16 19:03:04,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:04,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-01-16 19:03:04,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381951374] [2020-01-16 19:03:04,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:04,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:04,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8347939] [2020-01-16 19:03:04,753 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:04,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:04,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:04,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:04,754 INFO L87 Difference]: Start difference. First operand 392 states and 1345 transitions. Second operand 9 states. [2020-01-16 19:03:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:04,865 INFO L93 Difference]: Finished difference Result 605 states and 1782 transitions. [2020-01-16 19:03:04,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:04,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:04,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:04,867 INFO L225 Difference]: With dead ends: 605 [2020-01-16 19:03:04,867 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 19:03:04,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 19:03:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 390. [2020-01-16 19:03:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:03:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1340 transitions. [2020-01-16 19:03:04,877 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1340 transitions. Word has length 22 [2020-01-16 19:03:04,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:04,877 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1340 transitions. [2020-01-16 19:03:04,877 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1340 transitions. [2020-01-16 19:03:04,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:04,877 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:04,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, 1, 1, 1] [2020-01-16 19:03:04,878 INFO L426 AbstractCegarLoop]: === Iteration 605 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:04,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:04,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1682294662, now seen corresponding path program 599 times [2020-01-16 19:03:04,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:04,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276860768] [2020-01-16 19:03:04,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:05,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-01-16 19:03:05,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276860768] [2020-01-16 19:03:05,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:05,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:05,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642360323] [2020-01-16 19:03:05,152 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:05,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:05,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:05,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:05,153 INFO L87 Difference]: Start difference. First operand 390 states and 1340 transitions. Second operand 9 states. [2020-01-16 19:03:05,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:05,255 INFO L93 Difference]: Finished difference Result 613 states and 1801 transitions. [2020-01-16 19:03:05,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:05,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:05,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:05,257 INFO L225 Difference]: With dead ends: 613 [2020-01-16 19:03:05,257 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 19:03:05,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:05,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 19:03:05,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 395. [2020-01-16 19:03:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:03:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1349 transitions. [2020-01-16 19:03:05,267 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1349 transitions. Word has length 22 [2020-01-16 19:03:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:05,267 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1349 transitions. [2020-01-16 19:03:05,267 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1349 transitions. [2020-01-16 19:03:05,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:05,268 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:05,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, 1, 1, 1] [2020-01-16 19:03:05,268 INFO L426 AbstractCegarLoop]: === Iteration 606 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:05,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:05,268 INFO L82 PathProgramCache]: Analyzing trace with hash 609209282, now seen corresponding path program 600 times [2020-01-16 19:03:05,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:05,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505569463] [2020-01-16 19:03:05,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:05,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505569463] [2020-01-16 19:03:05,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:05,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:05,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797004725] [2020-01-16 19:03:05,553 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:05,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:05,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:05,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:05,553 INFO L87 Difference]: Start difference. First operand 395 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:03:05,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:05,691 INFO L93 Difference]: Finished difference Result 612 states and 1794 transitions. [2020-01-16 19:03:05,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:05,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:05,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:05,693 INFO L225 Difference]: With dead ends: 612 [2020-01-16 19:03:05,693 INFO L226 Difference]: Without dead ends: 587 [2020-01-16 19:03:05,693 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:05,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-01-16 19:03:05,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 383. [2020-01-16 19:03:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:03:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1328 transitions. [2020-01-16 19:03:05,711 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1328 transitions. Word has length 22 [2020-01-16 19:03:05,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:05,711 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1328 transitions. [2020-01-16 19:03:05,711 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1328 transitions. [2020-01-16 19:03:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:05,711 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03: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, 1, 1, 1] [2020-01-16 19:03:05,712 INFO L426 AbstractCegarLoop]: === Iteration 607 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:05,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:05,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1147153134, now seen corresponding path program 601 times [2020-01-16 19:03:05,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:05,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731359831] [2020-01-16 19:03:05,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:05,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-01-16 19:03:05,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731359831] [2020-01-16 19:03:05,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:05,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:05,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430182074] [2020-01-16 19:03:05,993 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:05,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:05,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:05,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:05,994 INFO L87 Difference]: Start difference. First operand 383 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:03:06,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:06,137 INFO L93 Difference]: Finished difference Result 543 states and 1635 transitions. [2020-01-16 19:03:06,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:06,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:06,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:06,139 INFO L225 Difference]: With dead ends: 543 [2020-01-16 19:03:06,139 INFO L226 Difference]: Without dead ends: 532 [2020-01-16 19:03:06,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:06,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-01-16 19:03:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 387. [2020-01-16 19:03:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1341 transitions. [2020-01-16 19:03:06,148 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1341 transitions. Word has length 22 [2020-01-16 19:03:06,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:06,148 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1341 transitions. [2020-01-16 19:03:06,148 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:06,148 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1341 transitions. [2020-01-16 19:03:06,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:06,149 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:06,149 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:06,149 INFO L426 AbstractCegarLoop]: === Iteration 608 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:06,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:06,149 INFO L82 PathProgramCache]: Analyzing trace with hash -298363876, now seen corresponding path program 602 times [2020-01-16 19:03:06,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:06,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721757702] [2020-01-16 19:03:06,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:06,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721757702] [2020-01-16 19:03:06,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:06,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:06,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763032854] [2020-01-16 19:03:06,432 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:06,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:06,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:06,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:06,433 INFO L87 Difference]: Start difference. First operand 387 states and 1341 transitions. Second operand 9 states. [2020-01-16 19:03:06,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:06,529 INFO L93 Difference]: Finished difference Result 541 states and 1630 transitions. [2020-01-16 19:03:06,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:06,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:06,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:06,530 INFO L225 Difference]: With dead ends: 541 [2020-01-16 19:03:06,530 INFO L226 Difference]: Without dead ends: 531 [2020-01-16 19:03:06,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:06,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-01-16 19:03:06,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 386. [2020-01-16 19:03:06,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:06,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1339 transitions. [2020-01-16 19:03:06,539 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1339 transitions. Word has length 22 [2020-01-16 19:03:06,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:06,539 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1339 transitions. [2020-01-16 19:03:06,539 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:06,539 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1339 transitions. [2020-01-16 19:03:06,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:06,540 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:06,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, 1, 1, 1] [2020-01-16 19:03:06,540 INFO L426 AbstractCegarLoop]: === Iteration 609 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:06,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:06,540 INFO L82 PathProgramCache]: Analyzing trace with hash -453284720, now seen corresponding path program 603 times [2020-01-16 19:03:06,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:06,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317722432] [2020-01-16 19:03:06,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:06,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-01-16 19:03:06,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317722432] [2020-01-16 19:03:06,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:06,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:06,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804200673] [2020-01-16 19:03:06,818 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:06,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:06,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:06,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:06,818 INFO L87 Difference]: Start difference. First operand 386 states and 1339 transitions. Second operand 9 states. [2020-01-16 19:03:06,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:06,923 INFO L93 Difference]: Finished difference Result 545 states and 1639 transitions. [2020-01-16 19:03:06,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:06,923 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:06,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:06,924 INFO L225 Difference]: With dead ends: 545 [2020-01-16 19:03:06,924 INFO L226 Difference]: Without dead ends: 534 [2020-01-16 19:03:06,925 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-01-16 19:03:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 388. [2020-01-16 19:03:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:03:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1342 transitions. [2020-01-16 19:03:06,933 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1342 transitions. Word has length 22 [2020-01-16 19:03:06,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:06,933 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1342 transitions. [2020-01-16 19:03:06,933 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:06,933 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1342 transitions. [2020-01-16 19:03:06,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:06,934 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:06,934 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:06,934 INFO L426 AbstractCegarLoop]: === Iteration 610 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:06,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:06,934 INFO L82 PathProgramCache]: Analyzing trace with hash -200191968, now seen corresponding path program 604 times [2020-01-16 19:03:06,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:06,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084894512] [2020-01-16 19:03:06,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:07,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084894512] [2020-01-16 19:03:07,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:07,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:07,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784185550] [2020-01-16 19:03:07,212 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:07,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:07,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:07,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:07,213 INFO L87 Difference]: Start difference. First operand 388 states and 1342 transitions. Second operand 9 states. [2020-01-16 19:03:07,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:07,339 INFO L93 Difference]: Finished difference Result 544 states and 1635 transitions. [2020-01-16 19:03:07,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:07,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:07,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:07,341 INFO L225 Difference]: With dead ends: 544 [2020-01-16 19:03:07,341 INFO L226 Difference]: Without dead ends: 532 [2020-01-16 19:03:07,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:07,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-01-16 19:03:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 386. [2020-01-16 19:03:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1338 transitions. [2020-01-16 19:03:07,350 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1338 transitions. Word has length 22 [2020-01-16 19:03:07,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:07,350 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1338 transitions. [2020-01-16 19:03:07,350 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:07,350 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1338 transitions. [2020-01-16 19:03:07,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:07,351 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:07,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, 1, 1, 1] [2020-01-16 19:03:07,351 INFO L426 AbstractCegarLoop]: === Iteration 611 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:07,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:07,351 INFO L82 PathProgramCache]: Analyzing trace with hash 795727712, now seen corresponding path program 605 times [2020-01-16 19:03:07,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:07,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852752813] [2020-01-16 19:03:07,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:07,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-01-16 19:03:07,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852752813] [2020-01-16 19:03:07,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:07,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:07,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011923847] [2020-01-16 19:03:07,638 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:07,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:07,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:07,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:07,639 INFO L87 Difference]: Start difference. First operand 386 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:03:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:07,743 INFO L93 Difference]: Finished difference Result 540 states and 1627 transitions. [2020-01-16 19:03:07,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:07,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:07,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:07,745 INFO L225 Difference]: With dead ends: 540 [2020-01-16 19:03:07,745 INFO L226 Difference]: Without dead ends: 531 [2020-01-16 19:03:07,745 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:07,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-01-16 19:03:07,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 387. [2020-01-16 19:03:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1339 transitions. [2020-01-16 19:03:07,754 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1339 transitions. Word has length 22 [2020-01-16 19:03:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:07,754 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1339 transitions. [2020-01-16 19:03:07,755 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:07,755 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1339 transitions. [2020-01-16 19:03:07,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:07,755 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:07,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, 1, 1, 1] [2020-01-16 19:03:07,755 INFO L426 AbstractCegarLoop]: === Iteration 612 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:07,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:07,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1888298626, now seen corresponding path program 606 times [2020-01-16 19:03:07,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:07,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831419769] [2020-01-16 19:03:07,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:08,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-01-16 19:03:08,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831419769] [2020-01-16 19:03:08,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:08,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:08,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332770639] [2020-01-16 19:03:08,042 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:08,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:08,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:08,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:08,042 INFO L87 Difference]: Start difference. First operand 387 states and 1339 transitions. Second operand 9 states. [2020-01-16 19:03:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:08,147 INFO L93 Difference]: Finished difference Result 541 states and 1628 transitions. [2020-01-16 19:03:08,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:08,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:08,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:08,149 INFO L225 Difference]: With dead ends: 541 [2020-01-16 19:03:08,149 INFO L226 Difference]: Without dead ends: 529 [2020-01-16 19:03:08,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:08,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-01-16 19:03:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 385. [2020-01-16 19:03:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:03:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1336 transitions. [2020-01-16 19:03:08,159 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1336 transitions. Word has length 22 [2020-01-16 19:03:08,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:08,159 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1336 transitions. [2020-01-16 19:03:08,159 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1336 transitions. [2020-01-16 19:03:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:08,159 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:08,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, 1, 1, 1] [2020-01-16 19:03:08,160 INFO L426 AbstractCegarLoop]: === Iteration 613 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:08,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:08,160 INFO L82 PathProgramCache]: Analyzing trace with hash 549816476, now seen corresponding path program 607 times [2020-01-16 19:03:08,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:08,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110749021] [2020-01-16 19:03:08,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:08,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110749021] [2020-01-16 19:03:08,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:08,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:08,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713179035] [2020-01-16 19:03:08,432 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:08,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:08,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:08,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:08,432 INFO L87 Difference]: Start difference. First operand 385 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:03:08,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:08,554 INFO L93 Difference]: Finished difference Result 548 states and 1645 transitions. [2020-01-16 19:03:08,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:08,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:08,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:08,555 INFO L225 Difference]: With dead ends: 548 [2020-01-16 19:03:08,555 INFO L226 Difference]: Without dead ends: 537 [2020-01-16 19:03:08,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:08,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-01-16 19:03:08,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 387. [2020-01-16 19:03:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1340 transitions. [2020-01-16 19:03:08,565 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1340 transitions. Word has length 22 [2020-01-16 19:03:08,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:08,565 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1340 transitions. [2020-01-16 19:03:08,565 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1340 transitions. [2020-01-16 19:03:08,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:08,565 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:08,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:08,566 INFO L426 AbstractCegarLoop]: === Iteration 614 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:08,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:08,566 INFO L82 PathProgramCache]: Analyzing trace with hash -895700534, now seen corresponding path program 608 times [2020-01-16 19:03:08,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:08,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250262814] [2020-01-16 19:03:08,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:08,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-01-16 19:03:08,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250262814] [2020-01-16 19:03:08,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:08,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:08,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412935608] [2020-01-16 19:03:08,859 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:08,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:08,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:08,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:08,860 INFO L87 Difference]: Start difference. First operand 387 states and 1340 transitions. Second operand 9 states. [2020-01-16 19:03:08,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:08,939 INFO L93 Difference]: Finished difference Result 546 states and 1640 transitions. [2020-01-16 19:03:08,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:08,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:08,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:08,941 INFO L225 Difference]: With dead ends: 546 [2020-01-16 19:03:08,941 INFO L226 Difference]: Without dead ends: 536 [2020-01-16 19:03:08,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:08,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-01-16 19:03:08,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 386. [2020-01-16 19:03:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1338 transitions. [2020-01-16 19:03:08,950 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1338 transitions. Word has length 22 [2020-01-16 19:03:08,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:08,950 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1338 transitions. [2020-01-16 19:03:08,951 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1338 transitions. [2020-01-16 19:03:08,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:08,951 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:08,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, 1, 1, 1] [2020-01-16 19:03:08,951 INFO L426 AbstractCegarLoop]: === Iteration 615 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:08,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:08,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1562509008, now seen corresponding path program 609 times [2020-01-16 19:03:08,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:08,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040268939] [2020-01-16 19:03:08,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:09,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040268939] [2020-01-16 19:03:09,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:09,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:09,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762755345] [2020-01-16 19:03:09,216 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:09,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:09,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:09,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:09,216 INFO L87 Difference]: Start difference. First operand 386 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:03:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:09,317 INFO L93 Difference]: Finished difference Result 555 states and 1660 transitions. [2020-01-16 19:03:09,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:09,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:09,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:09,319 INFO L225 Difference]: With dead ends: 555 [2020-01-16 19:03:09,319 INFO L226 Difference]: Without dead ends: 544 [2020-01-16 19:03:09,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-01-16 19:03:09,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 389. [2020-01-16 19:03:09,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:03:09,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1343 transitions. [2020-01-16 19:03:09,328 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1343 transitions. Word has length 22 [2020-01-16 19:03:09,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:09,328 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1343 transitions. [2020-01-16 19:03:09,328 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:09,329 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1343 transitions. [2020-01-16 19:03:09,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:09,329 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:09,329 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:09,329 INFO L426 AbstractCegarLoop]: === Iteration 616 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:09,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:09,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1346423158, now seen corresponding path program 610 times [2020-01-16 19:03:09,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:09,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939164619] [2020-01-16 19:03:09,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:09,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-01-16 19:03:09,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939164619] [2020-01-16 19:03:09,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:09,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:09,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523368421] [2020-01-16 19:03:09,593 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:09,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:09,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:09,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:09,593 INFO L87 Difference]: Start difference. First operand 389 states and 1343 transitions. Second operand 9 states. [2020-01-16 19:03:09,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:09,697 INFO L93 Difference]: Finished difference Result 558 states and 1663 transitions. [2020-01-16 19:03:09,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:09,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:09,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:09,699 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:03:09,699 INFO L226 Difference]: Without dead ends: 541 [2020-01-16 19:03:09,699 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:09,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-01-16 19:03:09,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 386. [2020-01-16 19:03:09,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1337 transitions. [2020-01-16 19:03:09,708 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1337 transitions. Word has length 22 [2020-01-16 19:03:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:09,708 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1337 transitions. [2020-01-16 19:03:09,708 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1337 transitions. [2020-01-16 19:03:09,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:09,709 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:09,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, 1, 1, 1] [2020-01-16 19:03:09,709 INFO L426 AbstractCegarLoop]: === Iteration 617 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:09,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:09,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1483445856, now seen corresponding path program 611 times [2020-01-16 19:03:09,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:09,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280756376] [2020-01-16 19:03:09,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:09,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:09,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280756376] [2020-01-16 19:03:09,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:09,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:09,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739354720] [2020-01-16 19:03:09,971 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:09,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:09,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:09,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:09,972 INFO L87 Difference]: Start difference. First operand 386 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:03:10,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:10,056 INFO L93 Difference]: Finished difference Result 549 states and 1645 transitions. [2020-01-16 19:03:10,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:10,056 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:10,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:10,058 INFO L225 Difference]: With dead ends: 549 [2020-01-16 19:03:10,058 INFO L226 Difference]: Without dead ends: 540 [2020-01-16 19:03:10,058 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-01-16 19:03:10,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 387. [2020-01-16 19:03:10,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1338 transitions. [2020-01-16 19:03:10,066 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1338 transitions. Word has length 22 [2020-01-16 19:03:10,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:10,066 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1338 transitions. [2020-01-16 19:03:10,067 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1338 transitions. [2020-01-16 19:03:10,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:10,067 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:10,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, 1, 1, 1] [2020-01-16 19:03:10,067 INFO L426 AbstractCegarLoop]: === Iteration 618 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:10,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:10,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1735810284, now seen corresponding path program 612 times [2020-01-16 19:03:10,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:10,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629014518] [2020-01-16 19:03:10,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:10,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-01-16 19:03:10,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629014518] [2020-01-16 19:03:10,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:10,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:10,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260642364] [2020-01-16 19:03:10,330 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:10,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:10,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:10,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:10,330 INFO L87 Difference]: Start difference. First operand 387 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:03:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:10,459 INFO L93 Difference]: Finished difference Result 554 states and 1654 transitions. [2020-01-16 19:03:10,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:10,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:10,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:10,460 INFO L225 Difference]: With dead ends: 554 [2020-01-16 19:03:10,460 INFO L226 Difference]: Without dead ends: 538 [2020-01-16 19:03:10,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-01-16 19:03:10,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 385. [2020-01-16 19:03:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:03:10,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1335 transitions. [2020-01-16 19:03:10,470 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1335 transitions. Word has length 22 [2020-01-16 19:03:10,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:10,470 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1335 transitions. [2020-01-16 19:03:10,470 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:10,470 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1335 transitions. [2020-01-16 19:03:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:10,471 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:10,471 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:10,471 INFO L426 AbstractCegarLoop]: === Iteration 619 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:10,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:10,471 INFO L82 PathProgramCache]: Analyzing trace with hash 875412700, now seen corresponding path program 613 times [2020-01-16 19:03:10,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:10,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136294061] [2020-01-16 19:03:10,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:10,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136294061] [2020-01-16 19:03:10,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:10,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:10,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223325154] [2020-01-16 19:03:10,746 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:10,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:10,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:10,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:10,747 INFO L87 Difference]: Start difference. First operand 385 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:03:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:10,863 INFO L93 Difference]: Finished difference Result 554 states and 1661 transitions. [2020-01-16 19:03:10,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:10,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:10,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:10,865 INFO L225 Difference]: With dead ends: 554 [2020-01-16 19:03:10,865 INFO L226 Difference]: Without dead ends: 543 [2020-01-16 19:03:10,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-01-16 19:03:10,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 389. [2020-01-16 19:03:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:03:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1345 transitions. [2020-01-16 19:03:10,874 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1345 transitions. Word has length 22 [2020-01-16 19:03:10,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:10,874 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1345 transitions. [2020-01-16 19:03:10,874 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:10,874 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1345 transitions. [2020-01-16 19:03:10,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:10,875 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:10,875 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:10,875 INFO L426 AbstractCegarLoop]: === Iteration 620 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:10,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:10,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1128505452, now seen corresponding path program 614 times [2020-01-16 19:03:10,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:10,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399086738] [2020-01-16 19:03:10,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:11,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399086738] [2020-01-16 19:03:11,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:11,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:11,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5442104] [2020-01-16 19:03:11,142 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:11,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:11,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:11,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:11,143 INFO L87 Difference]: Start difference. First operand 389 states and 1345 transitions. Second operand 9 states. [2020-01-16 19:03:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:11,252 INFO L93 Difference]: Finished difference Result 553 states and 1657 transitions. [2020-01-16 19:03:11,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:11,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:11,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:11,254 INFO L225 Difference]: With dead ends: 553 [2020-01-16 19:03:11,254 INFO L226 Difference]: Without dead ends: 541 [2020-01-16 19:03:11,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:11,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-01-16 19:03:11,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 387. [2020-01-16 19:03:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1340 transitions. [2020-01-16 19:03:11,263 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1340 transitions. Word has length 22 [2020-01-16 19:03:11,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:11,263 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1340 transitions. [2020-01-16 19:03:11,263 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:11,264 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1340 transitions. [2020-01-16 19:03:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:11,264 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:11,264 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:11,264 INFO L426 AbstractCegarLoop]: === Iteration 621 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:11,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:11,264 INFO L82 PathProgramCache]: Analyzing trace with hash -806424210, now seen corresponding path program 615 times [2020-01-16 19:03:11,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:11,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593038731] [2020-01-16 19:03:11,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:11,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-01-16 19:03:11,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593038731] [2020-01-16 19:03:11,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:11,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:11,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879685251] [2020-01-16 19:03:11,536 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:11,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:11,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:11,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:11,537 INFO L87 Difference]: Start difference. First operand 387 states and 1340 transitions. Second operand 9 states. [2020-01-16 19:03:11,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:11,660 INFO L93 Difference]: Finished difference Result 559 states and 1670 transitions. [2020-01-16 19:03:11,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:11,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:11,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:11,662 INFO L225 Difference]: With dead ends: 559 [2020-01-16 19:03:11,662 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:03:11,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:03:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 390. [2020-01-16 19:03:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:03:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1345 transitions. [2020-01-16 19:03:11,671 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1345 transitions. Word has length 22 [2020-01-16 19:03:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:11,671 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1345 transitions. [2020-01-16 19:03:11,671 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1345 transitions. [2020-01-16 19:03:11,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:11,672 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:11,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:11,672 INFO L426 AbstractCegarLoop]: === Iteration 622 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:11,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:11,672 INFO L82 PathProgramCache]: Analyzing trace with hash 579610920, now seen corresponding path program 616 times [2020-01-16 19:03:11,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:11,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118405716] [2020-01-16 19:03:11,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:11,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118405716] [2020-01-16 19:03:11,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:11,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:11,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231852148] [2020-01-16 19:03:11,933 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:11,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:11,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:11,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:11,933 INFO L87 Difference]: Start difference. First operand 390 states and 1345 transitions. Second operand 9 states. [2020-01-16 19:03:12,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:12,041 INFO L93 Difference]: Finished difference Result 562 states and 1673 transitions. [2020-01-16 19:03:12,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:12,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:12,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:12,043 INFO L225 Difference]: With dead ends: 562 [2020-01-16 19:03:12,043 INFO L226 Difference]: Without dead ends: 545 [2020-01-16 19:03:12,044 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:12,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-01-16 19:03:12,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 387. [2020-01-16 19:03:12,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1338 transitions. [2020-01-16 19:03:12,053 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1338 transitions. Word has length 22 [2020-01-16 19:03:12,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:12,053 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1338 transitions. [2020-01-16 19:03:12,053 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1338 transitions. [2020-01-16 19:03:12,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:12,053 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:12,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, 1, 1, 1] [2020-01-16 19:03:12,054 INFO L426 AbstractCegarLoop]: === Iteration 623 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:12,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:12,054 INFO L82 PathProgramCache]: Analyzing trace with hash 587595596, now seen corresponding path program 617 times [2020-01-16 19:03:12,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:12,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852441540] [2020-01-16 19:03:12,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:12,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-01-16 19:03:12,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852441540] [2020-01-16 19:03:12,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:12,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:12,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898976471] [2020-01-16 19:03:12,316 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:12,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:12,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:12,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:12,316 INFO L87 Difference]: Start difference. First operand 387 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:03:12,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:12,428 INFO L93 Difference]: Finished difference Result 556 states and 1661 transitions. [2020-01-16 19:03:12,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:12,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:12,429 INFO L225 Difference]: With dead ends: 556 [2020-01-16 19:03:12,429 INFO L226 Difference]: Without dead ends: 546 [2020-01-16 19:03:12,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-01-16 19:03:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 389. [2020-01-16 19:03:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:03:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1341 transitions. [2020-01-16 19:03:12,438 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1341 transitions. Word has length 22 [2020-01-16 19:03:12,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:12,438 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1341 transitions. [2020-01-16 19:03:12,438 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:12,438 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1341 transitions. [2020-01-16 19:03:12,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:12,439 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:12,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, 1, 1, 1] [2020-01-16 19:03:12,439 INFO L426 AbstractCegarLoop]: === Iteration 624 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:12,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:12,439 INFO L82 PathProgramCache]: Analyzing trace with hash -330354594, now seen corresponding path program 618 times [2020-01-16 19:03:12,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:12,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386723942] [2020-01-16 19:03:12,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:12,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-01-16 19:03:12,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386723942] [2020-01-16 19:03:12,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:12,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:12,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690489509] [2020-01-16 19:03:12,698 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:12,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:12,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:12,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:12,698 INFO L87 Difference]: Start difference. First operand 389 states and 1341 transitions. Second operand 9 states. [2020-01-16 19:03:12,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:12,820 INFO L93 Difference]: Finished difference Result 560 states and 1667 transitions. [2020-01-16 19:03:12,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:12,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:12,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:12,822 INFO L225 Difference]: With dead ends: 560 [2020-01-16 19:03:12,822 INFO L226 Difference]: Without dead ends: 542 [2020-01-16 19:03:12,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:12,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-01-16 19:03:12,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 385. [2020-01-16 19:03:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:03:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1334 transitions. [2020-01-16 19:03:12,831 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1334 transitions. Word has length 22 [2020-01-16 19:03:12,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:12,831 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1334 transitions. [2020-01-16 19:03:12,831 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:12,831 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1334 transitions. [2020-01-16 19:03:12,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:12,831 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:12,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, 1, 1, 1] [2020-01-16 19:03:12,832 INFO L426 AbstractCegarLoop]: === Iteration 625 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:12,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:12,832 INFO L82 PathProgramCache]: Analyzing trace with hash -244508086, now seen corresponding path program 619 times [2020-01-16 19:03:12,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:12,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551921249] [2020-01-16 19:03:12,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:13,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551921249] [2020-01-16 19:03:13,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:13,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:13,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710456318] [2020-01-16 19:03:13,112 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:13,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:13,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:13,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:13,112 INFO L87 Difference]: Start difference. First operand 385 states and 1334 transitions. Second operand 9 states. [2020-01-16 19:03:13,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:13,205 INFO L93 Difference]: Finished difference Result 543 states and 1632 transitions. [2020-01-16 19:03:13,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:13,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:13,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:13,207 INFO L225 Difference]: With dead ends: 543 [2020-01-16 19:03:13,207 INFO L226 Difference]: Without dead ends: 534 [2020-01-16 19:03:13,207 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-01-16 19:03:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 387. [2020-01-16 19:03:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1338 transitions. [2020-01-16 19:03:13,216 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1338 transitions. Word has length 22 [2020-01-16 19:03:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:13,217 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1338 transitions. [2020-01-16 19:03:13,217 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:13,217 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1338 transitions. [2020-01-16 19:03:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:13,217 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:13,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, 1, 1, 1] [2020-01-16 19:03:13,217 INFO L426 AbstractCegarLoop]: === Iteration 626 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:13,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:13,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1366432872, now seen corresponding path program 620 times [2020-01-16 19:03:13,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:13,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966566008] [2020-01-16 19:03:13,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:13,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-01-16 19:03:13,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966566008] [2020-01-16 19:03:13,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:13,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:13,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395984399] [2020-01-16 19:03:13,495 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:13,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:13,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:13,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:13,495 INFO L87 Difference]: Start difference. First operand 387 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:03:13,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:13,613 INFO L93 Difference]: Finished difference Result 544 states and 1633 transitions. [2020-01-16 19:03:13,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:13,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:13,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:13,614 INFO L225 Difference]: With dead ends: 544 [2020-01-16 19:03:13,614 INFO L226 Difference]: Without dead ends: 533 [2020-01-16 19:03:13,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:13,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-01-16 19:03:13,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 386. [2020-01-16 19:03:13,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1336 transitions. [2020-01-16 19:03:13,623 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1336 transitions. Word has length 22 [2020-01-16 19:03:13,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:13,623 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1336 transitions. [2020-01-16 19:03:13,623 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1336 transitions. [2020-01-16 19:03:13,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:13,624 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:13,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, 1, 1, 1] [2020-01-16 19:03:13,624 INFO L426 AbstractCegarLoop]: === Iteration 627 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:13,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:13,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1926344996, now seen corresponding path program 621 times [2020-01-16 19:03:13,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:13,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594023707] [2020-01-16 19:03:13,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:13,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-01-16 19:03:13,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594023707] [2020-01-16 19:03:13,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:13,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:13,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069976239] [2020-01-16 19:03:13,892 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:13,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:13,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:13,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:13,892 INFO L87 Difference]: Start difference. First operand 386 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:03:13,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:13,977 INFO L93 Difference]: Finished difference Result 547 states and 1639 transitions. [2020-01-16 19:03:13,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:13,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:13,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:13,979 INFO L225 Difference]: With dead ends: 547 [2020-01-16 19:03:13,979 INFO L226 Difference]: Without dead ends: 538 [2020-01-16 19:03:13,979 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:13,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-01-16 19:03:13,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 387. [2020-01-16 19:03:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-01-16 19:03:13,988 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-01-16 19:03:13,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:13,988 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-01-16 19:03:13,988 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-01-16 19:03:13,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:13,989 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:13,989 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:13,989 INFO L426 AbstractCegarLoop]: === Iteration 628 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:13,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:13,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1292911144, now seen corresponding path program 622 times [2020-01-16 19:03:13,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:13,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403236095] [2020-01-16 19:03:13,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:14,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403236095] [2020-01-16 19:03:14,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:14,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:14,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220607452] [2020-01-16 19:03:14,248 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:14,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:14,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:14,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:14,248 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:03:14,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:14,358 INFO L93 Difference]: Finished difference Result 552 states and 1648 transitions. [2020-01-16 19:03:14,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:14,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:14,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:14,360 INFO L225 Difference]: With dead ends: 552 [2020-01-16 19:03:14,360 INFO L226 Difference]: Without dead ends: 537 [2020-01-16 19:03:14,360 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:14,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-01-16 19:03:14,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 386. [2020-01-16 19:03:14,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-01-16 19:03:14,369 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-01-16 19:03:14,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:14,369 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-01-16 19:03:14,369 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:14,369 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-01-16 19:03:14,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:14,370 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:14,370 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:14,370 INFO L426 AbstractCegarLoop]: === Iteration 629 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:14,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:14,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1915841892, now seen corresponding path program 623 times [2020-01-16 19:03:14,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:14,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123540880] [2020-01-16 19:03:14,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:14,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123540880] [2020-01-16 19:03:14,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:14,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:14,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425314186] [2020-01-16 19:03:14,634 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:14,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:14,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:14,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:14,635 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:03:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:14,744 INFO L93 Difference]: Finished difference Result 550 states and 1645 transitions. [2020-01-16 19:03:14,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:14,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:14,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:14,746 INFO L225 Difference]: With dead ends: 550 [2020-01-16 19:03:14,746 INFO L226 Difference]: Without dead ends: 540 [2020-01-16 19:03:14,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:14,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-01-16 19:03:14,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 388. [2020-01-16 19:03:14,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:03:14,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-01-16 19:03:14,755 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-01-16 19:03:14,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:14,756 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-01-16 19:03:14,756 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:14,756 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-01-16 19:03:14,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:14,756 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:14,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, 1, 1, 1] [2020-01-16 19:03:14,756 INFO L426 AbstractCegarLoop]: === Iteration 630 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:14,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:14,757 INFO L82 PathProgramCache]: Analyzing trace with hash -307526710, now seen corresponding path program 624 times [2020-01-16 19:03:14,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:14,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545012304] [2020-01-16 19:03:14,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:15,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545012304] [2020-01-16 19:03:15,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:15,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:15,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525284927] [2020-01-16 19:03:15,014 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:15,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:15,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:15,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:15,015 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:03:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:15,125 INFO L93 Difference]: Finished difference Result 554 states and 1651 transitions. [2020-01-16 19:03:15,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:15,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:15,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:15,127 INFO L225 Difference]: With dead ends: 554 [2020-01-16 19:03:15,127 INFO L226 Difference]: Without dead ends: 536 [2020-01-16 19:03:15,127 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-01-16 19:03:15,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 384. [2020-01-16 19:03:15,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:03:15,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1332 transitions. [2020-01-16 19:03:15,136 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1332 transitions. Word has length 22 [2020-01-16 19:03:15,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:15,136 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1332 transitions. [2020-01-16 19:03:15,136 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1332 transitions. [2020-01-16 19:03:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:15,137 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:15,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, 1, 1, 1] [2020-01-16 19:03:15,137 INFO L426 AbstractCegarLoop]: === Iteration 631 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:15,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:15,137 INFO L82 PathProgramCache]: Analyzing trace with hash 302181682, now seen corresponding path program 625 times [2020-01-16 19:03:15,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:15,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151533382] [2020-01-16 19:03:15,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:15,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-01-16 19:03:15,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151533382] [2020-01-16 19:03:15,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:15,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:15,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910876258] [2020-01-16 19:03:15,425 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:15,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:15,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:15,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:15,425 INFO L87 Difference]: Start difference. First operand 384 states and 1332 transitions. Second operand 9 states. [2020-01-16 19:03:15,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:15,536 INFO L93 Difference]: Finished difference Result 542 states and 1632 transitions. [2020-01-16 19:03:15,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:15,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:15,537 INFO L225 Difference]: With dead ends: 542 [2020-01-16 19:03:15,537 INFO L226 Difference]: Without dead ends: 531 [2020-01-16 19:03:15,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:15,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-01-16 19:03:15,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 387. [2020-01-16 19:03:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1340 transitions. [2020-01-16 19:03:15,545 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1340 transitions. Word has length 22 [2020-01-16 19:03:15,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:15,545 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1340 transitions. [2020-01-16 19:03:15,545 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1340 transitions. [2020-01-16 19:03:15,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:15,546 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:15,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, 1, 1, 1] [2020-01-16 19:03:15,546 INFO L426 AbstractCegarLoop]: === Iteration 632 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:15,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:15,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1143335328, now seen corresponding path program 626 times [2020-01-16 19:03:15,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:15,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153259714] [2020-01-16 19:03:15,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:15,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153259714] [2020-01-16 19:03:15,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:15,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:15,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306197410] [2020-01-16 19:03:15,830 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:15,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:15,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:15,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:15,830 INFO L87 Difference]: Start difference. First operand 387 states and 1340 transitions. Second operand 9 states. [2020-01-16 19:03:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:15,912 INFO L93 Difference]: Finished difference Result 540 states and 1627 transitions. [2020-01-16 19:03:15,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:15,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:15,914 INFO L225 Difference]: With dead ends: 540 [2020-01-16 19:03:15,914 INFO L226 Difference]: Without dead ends: 530 [2020-01-16 19:03:15,914 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:15,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-01-16 19:03:15,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 386. [2020-01-16 19:03:15,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1338 transitions. [2020-01-16 19:03:15,923 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1338 transitions. Word has length 22 [2020-01-16 19:03:15,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:15,923 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1338 transitions. [2020-01-16 19:03:15,923 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1338 transitions. [2020-01-16 19:03:15,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:15,924 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:15,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, 1, 1, 1] [2020-01-16 19:03:15,924 INFO L426 AbstractCegarLoop]: === Iteration 633 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:15,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:15,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1298256172, now seen corresponding path program 627 times [2020-01-16 19:03:15,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:15,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620085145] [2020-01-16 19:03:15,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:16,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-01-16 19:03:16,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620085145] [2020-01-16 19:03:16,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:16,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:16,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250017858] [2020-01-16 19:03:16,201 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:16,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:16,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:16,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:16,202 INFO L87 Difference]: Start difference. First operand 386 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:03:16,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:16,318 INFO L93 Difference]: Finished difference Result 544 states and 1636 transitions. [2020-01-16 19:03:16,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:16,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:16,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:16,319 INFO L225 Difference]: With dead ends: 544 [2020-01-16 19:03:16,319 INFO L226 Difference]: Without dead ends: 533 [2020-01-16 19:03:16,320 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:16,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-01-16 19:03:16,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 388. [2020-01-16 19:03:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:03:16,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1341 transitions. [2020-01-16 19:03:16,329 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1341 transitions. Word has length 22 [2020-01-16 19:03:16,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:16,329 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1341 transitions. [2020-01-16 19:03:16,329 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:16,329 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1341 transitions. [2020-01-16 19:03:16,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:16,330 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:16,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, 1, 1, 1] [2020-01-16 19:03:16,330 INFO L426 AbstractCegarLoop]: === Iteration 634 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:16,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:16,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1045163420, now seen corresponding path program 628 times [2020-01-16 19:03:16,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:16,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151368241] [2020-01-16 19:03:16,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:16,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-01-16 19:03:16,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151368241] [2020-01-16 19:03:16,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:16,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:16,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279458663] [2020-01-16 19:03:16,613 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:16,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:16,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:16,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:16,613 INFO L87 Difference]: Start difference. First operand 388 states and 1341 transitions. Second operand 9 states. [2020-01-16 19:03:16,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:16,717 INFO L93 Difference]: Finished difference Result 543 states and 1632 transitions. [2020-01-16 19:03:16,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:16,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:16,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:16,719 INFO L225 Difference]: With dead ends: 543 [2020-01-16 19:03:16,719 INFO L226 Difference]: Without dead ends: 531 [2020-01-16 19:03:16,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:16,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-01-16 19:03:16,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 386. [2020-01-16 19:03:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1337 transitions. [2020-01-16 19:03:16,728 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1337 transitions. Word has length 22 [2020-01-16 19:03:16,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:16,728 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1337 transitions. [2020-01-16 19:03:16,728 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1337 transitions. [2020-01-16 19:03:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:16,729 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:16,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, 1, 1, 1] [2020-01-16 19:03:16,729 INFO L426 AbstractCegarLoop]: === Iteration 635 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:16,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:16,729 INFO L82 PathProgramCache]: Analyzing trace with hash -49243740, now seen corresponding path program 629 times [2020-01-16 19:03:16,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:16,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166408148] [2020-01-16 19:03:16,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:17,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166408148] [2020-01-16 19:03:17,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:17,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:17,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884169604] [2020-01-16 19:03:17,016 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:17,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:17,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:17,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:17,016 INFO L87 Difference]: Start difference. First operand 386 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:03:17,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:17,101 INFO L93 Difference]: Finished difference Result 539 states and 1624 transitions. [2020-01-16 19:03:17,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:17,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:17,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:17,103 INFO L225 Difference]: With dead ends: 539 [2020-01-16 19:03:17,103 INFO L226 Difference]: Without dead ends: 530 [2020-01-16 19:03:17,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:17,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-01-16 19:03:17,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 387. [2020-01-16 19:03:17,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1338 transitions. [2020-01-16 19:03:17,113 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1338 transitions. Word has length 22 [2020-01-16 19:03:17,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:17,113 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1338 transitions. [2020-01-16 19:03:17,113 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1338 transitions. [2020-01-16 19:03:17,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:17,114 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:17,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, 1, 1, 1] [2020-01-16 19:03:17,114 INFO L426 AbstractCegarLoop]: === Iteration 636 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:17,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:17,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1561697218, now seen corresponding path program 630 times [2020-01-16 19:03:17,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:17,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836746751] [2020-01-16 19:03:17,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:17,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-01-16 19:03:17,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836746751] [2020-01-16 19:03:17,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:17,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:17,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94435153] [2020-01-16 19:03:17,398 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:17,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:17,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:17,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:17,399 INFO L87 Difference]: Start difference. First operand 387 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:03:17,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:17,510 INFO L93 Difference]: Finished difference Result 540 states and 1625 transitions. [2020-01-16 19:03:17,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:17,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:17,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:17,512 INFO L225 Difference]: With dead ends: 540 [2020-01-16 19:03:17,512 INFO L226 Difference]: Without dead ends: 528 [2020-01-16 19:03:17,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:17,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-01-16 19:03:17,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 385. [2020-01-16 19:03:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:03:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1335 transitions. [2020-01-16 19:03:17,522 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1335 transitions. Word has length 22 [2020-01-16 19:03:17,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:17,522 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1335 transitions. [2020-01-16 19:03:17,522 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:17,522 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1335 transitions. [2020-01-16 19:03:17,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:17,522 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:17,522 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:17,523 INFO L426 AbstractCegarLoop]: === Iteration 637 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:17,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:17,523 INFO L82 PathProgramCache]: Analyzing trace with hash -738054116, now seen corresponding path program 631 times [2020-01-16 19:03:17,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:17,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976973107] [2020-01-16 19:03:17,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:17,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-01-16 19:03:17,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976973107] [2020-01-16 19:03:17,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:17,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:17,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409113219] [2020-01-16 19:03:17,810 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:17,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:17,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:17,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:17,811 INFO L87 Difference]: Start difference. First operand 385 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:03:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:17,922 INFO L93 Difference]: Finished difference Result 546 states and 1640 transitions. [2020-01-16 19:03:17,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:17,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:17,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:17,923 INFO L225 Difference]: With dead ends: 546 [2020-01-16 19:03:17,923 INFO L226 Difference]: Without dead ends: 535 [2020-01-16 19:03:17,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-01-16 19:03:17,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 387. [2020-01-16 19:03:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1339 transitions. [2020-01-16 19:03:17,933 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1339 transitions. Word has length 22 [2020-01-16 19:03:17,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:17,933 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1339 transitions. [2020-01-16 19:03:17,933 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:17,933 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1339 transitions. [2020-01-16 19:03:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:17,934 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:17,934 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:17,934 INFO L426 AbstractCegarLoop]: === Iteration 638 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:17,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:17,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2111396170, now seen corresponding path program 632 times [2020-01-16 19:03:17,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:17,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638033233] [2020-01-16 19:03:17,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:18,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-01-16 19:03:18,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638033233] [2020-01-16 19:03:18,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:18,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:18,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765362641] [2020-01-16 19:03:18,205 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:18,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:18,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:18,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:18,206 INFO L87 Difference]: Start difference. First operand 387 states and 1339 transitions. Second operand 9 states. [2020-01-16 19:03:18,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:18,294 INFO L93 Difference]: Finished difference Result 544 states and 1635 transitions. [2020-01-16 19:03:18,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:18,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:18,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:18,296 INFO L225 Difference]: With dead ends: 544 [2020-01-16 19:03:18,296 INFO L226 Difference]: Without dead ends: 534 [2020-01-16 19:03:18,296 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:18,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-01-16 19:03:18,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 386. [2020-01-16 19:03:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1337 transitions. [2020-01-16 19:03:18,305 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1337 transitions. Word has length 22 [2020-01-16 19:03:18,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:18,305 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1337 transitions. [2020-01-16 19:03:18,305 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1337 transitions. [2020-01-16 19:03:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:18,306 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:18,306 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:18,306 INFO L426 AbstractCegarLoop]: === Iteration 639 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:18,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:18,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1368730004, now seen corresponding path program 633 times [2020-01-16 19:03:18,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:18,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416662418] [2020-01-16 19:03:18,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:18,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-01-16 19:03:18,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416662418] [2020-01-16 19:03:18,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:18,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:18,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000014314] [2020-01-16 19:03:18,581 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:18,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:18,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:18,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:18,581 INFO L87 Difference]: Start difference. First operand 386 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:03:18,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:18,709 INFO L93 Difference]: Finished difference Result 552 states and 1653 transitions. [2020-01-16 19:03:18,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:18,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:18,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:18,711 INFO L225 Difference]: With dead ends: 552 [2020-01-16 19:03:18,711 INFO L226 Difference]: Without dead ends: 541 [2020-01-16 19:03:18,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:18,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-01-16 19:03:18,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 389. [2020-01-16 19:03:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:03:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1342 transitions. [2020-01-16 19:03:18,721 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1342 transitions. Word has length 22 [2020-01-16 19:03:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:18,721 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1342 transitions. [2020-01-16 19:03:18,721 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1342 transitions. [2020-01-16 19:03:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:18,722 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:18,722 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:18,722 INFO L426 AbstractCegarLoop]: === Iteration 640 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:18,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:18,722 INFO L82 PathProgramCache]: Analyzing trace with hash 586730762, now seen corresponding path program 634 times [2020-01-16 19:03:18,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:18,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702705748] [2020-01-16 19:03:18,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:18,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-01-16 19:03:18,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702705748] [2020-01-16 19:03:18,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:18,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:18,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951930805] [2020-01-16 19:03:18,987 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:18,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:18,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:18,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:18,988 INFO L87 Difference]: Start difference. First operand 389 states and 1342 transitions. Second operand 9 states. [2020-01-16 19:03:19,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:19,099 INFO L93 Difference]: Finished difference Result 554 states and 1654 transitions. [2020-01-16 19:03:19,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:19,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:19,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:19,100 INFO L225 Difference]: With dead ends: 554 [2020-01-16 19:03:19,101 INFO L226 Difference]: Without dead ends: 538 [2020-01-16 19:03:19,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:19,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-01-16 19:03:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 386. [2020-01-16 19:03:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1336 transitions. [2020-01-16 19:03:19,111 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1336 transitions. Word has length 22 [2020-01-16 19:03:19,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:19,111 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1336 transitions. [2020-01-16 19:03:19,111 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1336 transitions. [2020-01-16 19:03:19,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:19,112 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:19,112 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:19,112 INFO L426 AbstractCegarLoop]: === Iteration 641 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:19,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:19,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1677224860, now seen corresponding path program 635 times [2020-01-16 19:03:19,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:19,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407676903] [2020-01-16 19:03:19,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:19,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407676903] [2020-01-16 19:03:19,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:19,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:19,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720084579] [2020-01-16 19:03:19,379 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:19,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:19,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:19,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:19,379 INFO L87 Difference]: Start difference. First operand 386 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:03:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:19,476 INFO L93 Difference]: Finished difference Result 546 states and 1638 transitions. [2020-01-16 19:03:19,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:19,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:19,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:19,477 INFO L225 Difference]: With dead ends: 546 [2020-01-16 19:03:19,477 INFO L226 Difference]: Without dead ends: 537 [2020-01-16 19:03:19,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:19,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-01-16 19:03:19,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 387. [2020-01-16 19:03:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-01-16 19:03:19,487 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-01-16 19:03:19,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:19,487 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-01-16 19:03:19,487 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:19,487 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-01-16 19:03:19,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:19,488 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:19,488 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:19,488 INFO L426 AbstractCegarLoop]: === Iteration 642 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:19,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:19,488 INFO L82 PathProgramCache]: Analyzing trace with hash 468945900, now seen corresponding path program 636 times [2020-01-16 19:03:19,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:19,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724699946] [2020-01-16 19:03:19,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:19,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724699946] [2020-01-16 19:03:19,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:19,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:19,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371915730] [2020-01-16 19:03:19,757 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:19,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:19,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:19,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:19,758 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:03:19,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:19,867 INFO L93 Difference]: Finished difference Result 550 states and 1645 transitions. [2020-01-16 19:03:19,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:19,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:19,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:19,869 INFO L225 Difference]: With dead ends: 550 [2020-01-16 19:03:19,869 INFO L226 Difference]: Without dead ends: 535 [2020-01-16 19:03:19,869 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:19,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-01-16 19:03:19,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 385. [2020-01-16 19:03:19,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:03:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1334 transitions. [2020-01-16 19:03:19,878 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1334 transitions. Word has length 22 [2020-01-16 19:03:19,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:19,879 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1334 transitions. [2020-01-16 19:03:19,879 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1334 transitions. [2020-01-16 19:03:19,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:19,879 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:19,879 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:19,879 INFO L426 AbstractCegarLoop]: === Iteration 643 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:19,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:19,880 INFO L82 PathProgramCache]: Analyzing trace with hash -412457892, now seen corresponding path program 637 times [2020-01-16 19:03:19,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:19,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376330161] [2020-01-16 19:03:19,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:20,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376330161] [2020-01-16 19:03:20,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:20,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:20,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761737032] [2020-01-16 19:03:20,147 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:20,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:20,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:20,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:20,147 INFO L87 Difference]: Start difference. First operand 385 states and 1334 transitions. Second operand 9 states. [2020-01-16 19:03:20,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:20,250 INFO L93 Difference]: Finished difference Result 552 states and 1656 transitions. [2020-01-16 19:03:20,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:20,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:20,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:20,252 INFO L225 Difference]: With dead ends: 552 [2020-01-16 19:03:20,252 INFO L226 Difference]: Without dead ends: 541 [2020-01-16 19:03:20,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:20,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-01-16 19:03:20,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 389. [2020-01-16 19:03:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:03:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1344 transitions. [2020-01-16 19:03:20,262 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1344 transitions. Word has length 22 [2020-01-16 19:03:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:20,262 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1344 transitions. [2020-01-16 19:03:20,262 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:20,262 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1344 transitions. [2020-01-16 19:03:20,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:20,263 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:20,263 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:20,263 INFO L426 AbstractCegarLoop]: === Iteration 644 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:20,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:20,263 INFO L82 PathProgramCache]: Analyzing trace with hash -159365140, now seen corresponding path program 638 times [2020-01-16 19:03:20,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:20,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204721487] [2020-01-16 19:03:20,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:20,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-01-16 19:03:20,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204721487] [2020-01-16 19:03:20,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:20,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:20,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937746653] [2020-01-16 19:03:20,533 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:20,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:20,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:20,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:20,534 INFO L87 Difference]: Start difference. First operand 389 states and 1344 transitions. Second operand 9 states. [2020-01-16 19:03:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:20,645 INFO L93 Difference]: Finished difference Result 551 states and 1652 transitions. [2020-01-16 19:03:20,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:20,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:20,646 INFO L225 Difference]: With dead ends: 551 [2020-01-16 19:03:20,647 INFO L226 Difference]: Without dead ends: 539 [2020-01-16 19:03:20,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:20,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-01-16 19:03:20,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 387. [2020-01-16 19:03:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1339 transitions. [2020-01-16 19:03:20,657 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1339 transitions. Word has length 22 [2020-01-16 19:03:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:20,657 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1339 transitions. [2020-01-16 19:03:20,657 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1339 transitions. [2020-01-16 19:03:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:20,658 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:20,658 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:20,658 INFO L426 AbstractCegarLoop]: === Iteration 645 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:20,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:20,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1000203214, now seen corresponding path program 639 times [2020-01-16 19:03:20,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:20,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024755031] [2020-01-16 19:03:20,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:20,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-01-16 19:03:20,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024755031] [2020-01-16 19:03:20,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:20,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:20,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447489032] [2020-01-16 19:03:20,935 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:20,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:20,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:20,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:20,935 INFO L87 Difference]: Start difference. First operand 387 states and 1339 transitions. Second operand 9 states. [2020-01-16 19:03:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:21,046 INFO L93 Difference]: Finished difference Result 556 states and 1663 transitions. [2020-01-16 19:03:21,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:21,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:21,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:21,048 INFO L225 Difference]: With dead ends: 556 [2020-01-16 19:03:21,048 INFO L226 Difference]: Without dead ends: 545 [2020-01-16 19:03:21,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-01-16 19:03:21,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 390. [2020-01-16 19:03:21,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:03:21,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1344 transitions. [2020-01-16 19:03:21,056 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1344 transitions. Word has length 22 [2020-01-16 19:03:21,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:21,057 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1344 transitions. [2020-01-16 19:03:21,057 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1344 transitions. [2020-01-16 19:03:21,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:21,057 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:21,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, 1, 1, 1] [2020-01-16 19:03:21,058 INFO L426 AbstractCegarLoop]: === Iteration 646 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:21,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:21,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1782202456, now seen corresponding path program 640 times [2020-01-16 19:03:21,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:21,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620608458] [2020-01-16 19:03:21,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:21,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-01-16 19:03:21,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620608458] [2020-01-16 19:03:21,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:21,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:21,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016648805] [2020-01-16 19:03:21,324 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:21,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:21,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:21,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:21,325 INFO L87 Difference]: Start difference. First operand 390 states and 1344 transitions. Second operand 9 states. [2020-01-16 19:03:21,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:21,446 INFO L93 Difference]: Finished difference Result 558 states and 1664 transitions. [2020-01-16 19:03:21,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:21,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:21,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:21,448 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:03:21,448 INFO L226 Difference]: Without dead ends: 542 [2020-01-16 19:03:21,448 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:21,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-01-16 19:03:21,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 387. [2020-01-16 19:03:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-01-16 19:03:21,458 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-01-16 19:03:21,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:21,458 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-01-16 19:03:21,458 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:21,458 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-01-16 19:03:21,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:21,458 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:21,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, 1, 1, 1] [2020-01-16 19:03:21,459 INFO L426 AbstractCegarLoop]: === Iteration 647 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:21,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:21,459 INFO L82 PathProgramCache]: Analyzing trace with hash -679268788, now seen corresponding path program 641 times [2020-01-16 19:03:21,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:21,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964991449] [2020-01-16 19:03:21,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:21,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:21,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964991449] [2020-01-16 19:03:21,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:21,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:21,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332161402] [2020-01-16 19:03:21,729 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:21,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:21,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:21,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:21,729 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:03:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:21,841 INFO L93 Difference]: Finished difference Result 553 states and 1654 transitions. [2020-01-16 19:03:21,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:21,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:21,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:21,843 INFO L225 Difference]: With dead ends: 553 [2020-01-16 19:03:21,843 INFO L226 Difference]: Without dead ends: 543 [2020-01-16 19:03:21,843 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:21,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-01-16 19:03:21,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 389. [2020-01-16 19:03:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:03:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1340 transitions. [2020-01-16 19:03:21,852 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1340 transitions. Word has length 22 [2020-01-16 19:03:21,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:21,852 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1340 transitions. [2020-01-16 19:03:21,852 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:21,852 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1340 transitions. [2020-01-16 19:03:21,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:21,853 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:21,853 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:21,853 INFO L426 AbstractCegarLoop]: === Iteration 648 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:21,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:21,853 INFO L82 PathProgramCache]: Analyzing trace with hash -107813982, now seen corresponding path program 642 times [2020-01-16 19:03:21,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:21,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740207249] [2020-01-16 19:03:21,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:22,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-01-16 19:03:22,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740207249] [2020-01-16 19:03:22,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:22,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:22,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611007892] [2020-01-16 19:03:22,120 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:22,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:22,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:22,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:22,120 INFO L87 Difference]: Start difference. First operand 389 states and 1340 transitions. Second operand 9 states. [2020-01-16 19:03:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:22,234 INFO L93 Difference]: Finished difference Result 556 states and 1658 transitions. [2020-01-16 19:03:22,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:22,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:22,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:22,235 INFO L225 Difference]: With dead ends: 556 [2020-01-16 19:03:22,236 INFO L226 Difference]: Without dead ends: 539 [2020-01-16 19:03:22,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:22,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-01-16 19:03:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 385. [2020-01-16 19:03:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:03:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1333 transitions. [2020-01-16 19:03:22,245 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1333 transitions. Word has length 22 [2020-01-16 19:03:22,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:22,245 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1333 transitions. [2020-01-16 19:03:22,245 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1333 transitions. [2020-01-16 19:03:22,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:22,246 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:22,246 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:22,246 INFO L426 AbstractCegarLoop]: === Iteration 649 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:22,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:22,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1532378678, now seen corresponding path program 643 times [2020-01-16 19:03:22,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:22,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803978665] [2020-01-16 19:03:22,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:22,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-01-16 19:03:22,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803978665] [2020-01-16 19:03:22,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:22,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:22,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846222648] [2020-01-16 19:03:22,537 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:22,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:22,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:22,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:22,537 INFO L87 Difference]: Start difference. First operand 385 states and 1333 transitions. Second operand 9 states. [2020-01-16 19:03:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:22,622 INFO L93 Difference]: Finished difference Result 541 states and 1627 transitions. [2020-01-16 19:03:22,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:22,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:22,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:22,624 INFO L225 Difference]: With dead ends: 541 [2020-01-16 19:03:22,624 INFO L226 Difference]: Without dead ends: 532 [2020-01-16 19:03:22,624 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:22,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-01-16 19:03:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 387. [2020-01-16 19:03:22,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-01-16 19:03:22,634 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-01-16 19:03:22,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:22,634 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-01-16 19:03:22,634 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:22,634 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-01-16 19:03:22,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:22,634 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:22,635 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:22,635 INFO L426 AbstractCegarLoop]: === Iteration 650 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:22,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:22,635 INFO L82 PathProgramCache]: Analyzing trace with hash 78562280, now seen corresponding path program 644 times [2020-01-16 19:03:22,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:22,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960628218] [2020-01-16 19:03:22,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:22,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-01-16 19:03:22,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960628218] [2020-01-16 19:03:22,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:22,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:22,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771070384] [2020-01-16 19:03:22,911 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:22,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:22,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:22,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:22,912 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:03:23,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:23,027 INFO L93 Difference]: Finished difference Result 542 states and 1628 transitions. [2020-01-16 19:03:23,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:23,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:23,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:23,029 INFO L225 Difference]: With dead ends: 542 [2020-01-16 19:03:23,029 INFO L226 Difference]: Without dead ends: 531 [2020-01-16 19:03:23,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:23,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-01-16 19:03:23,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 386. [2020-01-16 19:03:23,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:23,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-01-16 19:03:23,038 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-01-16 19:03:23,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:23,038 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-01-16 19:03:23,038 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:23,038 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-01-16 19:03:23,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:23,039 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:23,039 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:23,039 INFO L426 AbstractCegarLoop]: === Iteration 651 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:23,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:23,039 INFO L82 PathProgramCache]: Analyzing trace with hash -2120124000, now seen corresponding path program 645 times [2020-01-16 19:03:23,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:23,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993423106] [2020-01-16 19:03:23,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:23,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-01-16 19:03:23,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993423106] [2020-01-16 19:03:23,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:23,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:23,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650278273] [2020-01-16 19:03:23,316 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:23,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:23,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:23,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:23,317 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:03:23,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:23,402 INFO L93 Difference]: Finished difference Result 544 states and 1632 transitions. [2020-01-16 19:03:23,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:23,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:23,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:23,404 INFO L225 Difference]: With dead ends: 544 [2020-01-16 19:03:23,404 INFO L226 Difference]: Without dead ends: 535 [2020-01-16 19:03:23,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-01-16 19:03:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 387. [2020-01-16 19:03:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:23,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-01-16 19:03:23,414 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-01-16 19:03:23,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:23,414 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-01-16 19:03:23,415 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:23,415 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-01-16 19:03:23,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:23,415 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:23,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, 1, 1, 1] [2020-01-16 19:03:23,415 INFO L426 AbstractCegarLoop]: === Iteration 652 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:23,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:23,415 INFO L82 PathProgramCache]: Analyzing trace with hash 26046760, now seen corresponding path program 646 times [2020-01-16 19:03:23,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:23,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470140659] [2020-01-16 19:03:23,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:23,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470140659] [2020-01-16 19:03:23,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:23,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:23,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124190449] [2020-01-16 19:03:23,686 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:23,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:23,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:23,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:23,687 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:03:23,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:23,805 INFO L93 Difference]: Finished difference Result 548 states and 1639 transitions. [2020-01-16 19:03:23,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:23,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:23,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:23,806 INFO L225 Difference]: With dead ends: 548 [2020-01-16 19:03:23,807 INFO L226 Difference]: Without dead ends: 534 [2020-01-16 19:03:23,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:23,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-01-16 19:03:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 386. [2020-01-16 19:03:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1334 transitions. [2020-01-16 19:03:23,816 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1334 transitions. Word has length 22 [2020-01-16 19:03:23,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:23,816 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1334 transitions. [2020-01-16 19:03:23,816 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:23,816 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1334 transitions. [2020-01-16 19:03:23,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:23,816 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:23,817 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:23,817 INFO L426 AbstractCegarLoop]: === Iteration 653 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:23,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:23,817 INFO L82 PathProgramCache]: Analyzing trace with hash -2109620896, now seen corresponding path program 647 times [2020-01-16 19:03:23,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:23,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506539698] [2020-01-16 19:03:23,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:24,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-01-16 19:03:24,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506539698] [2020-01-16 19:03:24,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:24,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:24,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659374769] [2020-01-16 19:03:24,085 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:24,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:24,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:24,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:24,085 INFO L87 Difference]: Start difference. First operand 386 states and 1334 transitions. Second operand 9 states. [2020-01-16 19:03:24,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:24,194 INFO L93 Difference]: Finished difference Result 547 states and 1638 transitions. [2020-01-16 19:03:24,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:24,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:24,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:24,196 INFO L225 Difference]: With dead ends: 547 [2020-01-16 19:03:24,196 INFO L226 Difference]: Without dead ends: 537 [2020-01-16 19:03:24,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:24,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-01-16 19:03:24,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 388. [2020-01-16 19:03:24,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:03:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1337 transitions. [2020-01-16 19:03:24,205 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1337 transitions. Word has length 22 [2020-01-16 19:03:24,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:24,206 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1337 transitions. [2020-01-16 19:03:24,206 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1337 transitions. [2020-01-16 19:03:24,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:24,206 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:24,206 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:24,206 INFO L426 AbstractCegarLoop]: === Iteration 654 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:24,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:24,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1574391094, now seen corresponding path program 648 times [2020-01-16 19:03:24,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:24,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959881086] [2020-01-16 19:03:24,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:24,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-01-16 19:03:24,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959881086] [2020-01-16 19:03:24,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:24,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:24,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948767338] [2020-01-16 19:03:24,482 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:24,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:24,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:24,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:24,483 INFO L87 Difference]: Start difference. First operand 388 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:03:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:24,596 INFO L93 Difference]: Finished difference Result 550 states and 1642 transitions. [2020-01-16 19:03:24,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:24,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:24,598 INFO L225 Difference]: With dead ends: 550 [2020-01-16 19:03:24,598 INFO L226 Difference]: Without dead ends: 533 [2020-01-16 19:03:24,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:24,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-01-16 19:03:24,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 384. [2020-01-16 19:03:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:03:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1331 transitions. [2020-01-16 19:03:24,607 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1331 transitions. Word has length 22 [2020-01-16 19:03:24,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:24,607 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1331 transitions. [2020-01-16 19:03:24,607 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:24,607 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1331 transitions. [2020-01-16 19:03:24,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:24,608 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:24,608 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:24,608 INFO L426 AbstractCegarLoop]: === Iteration 655 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:24,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:24,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1632722190, now seen corresponding path program 649 times [2020-01-16 19:03:24,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:24,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18381507] [2020-01-16 19:03:24,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:24,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18381507] [2020-01-16 19:03:24,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:24,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:24,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622611776] [2020-01-16 19:03:24,865 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:24,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:24,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:24,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:24,866 INFO L87 Difference]: Start difference. First operand 384 states and 1331 transitions. Second operand 9 states. [2020-01-16 19:03:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:24,984 INFO L93 Difference]: Finished difference Result 556 states and 1666 transitions. [2020-01-16 19:03:24,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:24,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:24,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:24,985 INFO L225 Difference]: With dead ends: 556 [2020-01-16 19:03:24,986 INFO L226 Difference]: Without dead ends: 545 [2020-01-16 19:03:24,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:24,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-01-16 19:03:24,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 387. [2020-01-16 19:03:24,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:24,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1339 transitions. [2020-01-16 19:03:24,994 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1339 transitions. Word has length 22 [2020-01-16 19:03:24,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:24,995 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1339 transitions. [2020-01-16 19:03:24,995 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:24,995 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1339 transitions. [2020-01-16 19:03:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:24,995 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:24,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, 1, 1, 1] [2020-01-16 19:03:24,995 INFO L426 AbstractCegarLoop]: === Iteration 656 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:24,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:24,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1216728096, now seen corresponding path program 650 times [2020-01-16 19:03:24,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:24,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478563689] [2020-01-16 19:03:24,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:25,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478563689] [2020-01-16 19:03:25,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:25,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:25,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285288852] [2020-01-16 19:03:25,261 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:25,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:25,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:25,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:25,261 INFO L87 Difference]: Start difference. First operand 387 states and 1339 transitions. Second operand 9 states. [2020-01-16 19:03:25,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:25,340 INFO L93 Difference]: Finished difference Result 554 states and 1661 transitions. [2020-01-16 19:03:25,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:25,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:25,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:25,342 INFO L225 Difference]: With dead ends: 554 [2020-01-16 19:03:25,342 INFO L226 Difference]: Without dead ends: 544 [2020-01-16 19:03:25,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:25,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-01-16 19:03:25,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 386. [2020-01-16 19:03:25,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:25,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1337 transitions. [2020-01-16 19:03:25,351 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1337 transitions. Word has length 22 [2020-01-16 19:03:25,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:25,351 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1337 transitions. [2020-01-16 19:03:25,351 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:25,351 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1337 transitions. [2020-01-16 19:03:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:25,351 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:25,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, 1, 1, 1] [2020-01-16 19:03:25,352 INFO L426 AbstractCegarLoop]: === Iteration 657 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:25,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:25,352 INFO L82 PathProgramCache]: Analyzing trace with hash -620029658, now seen corresponding path program 651 times [2020-01-16 19:03:25,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:25,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992926396] [2020-01-16 19:03:25,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:25,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-01-16 19:03:25,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992926396] [2020-01-16 19:03:25,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:25,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:25,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000702350] [2020-01-16 19:03:25,608 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:25,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:25,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:25,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:25,608 INFO L87 Difference]: Start difference. First operand 386 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:03:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:25,723 INFO L93 Difference]: Finished difference Result 563 states and 1681 transitions. [2020-01-16 19:03:25,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:25,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:25,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:25,725 INFO L225 Difference]: With dead ends: 563 [2020-01-16 19:03:25,725 INFO L226 Difference]: Without dead ends: 552 [2020-01-16 19:03:25,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:25,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-01-16 19:03:25,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 389. [2020-01-16 19:03:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:03:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1342 transitions. [2020-01-16 19:03:25,734 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1342 transitions. Word has length 22 [2020-01-16 19:03:25,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:25,734 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1342 transitions. [2020-01-16 19:03:25,735 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1342 transitions. [2020-01-16 19:03:25,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:25,735 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:25,735 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:25,735 INFO L426 AbstractCegarLoop]: === Iteration 658 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:25,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:25,735 INFO L82 PathProgramCache]: Analyzing trace with hash 766005472, now seen corresponding path program 652 times [2020-01-16 19:03:25,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:25,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749813801] [2020-01-16 19:03:25,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:25,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-01-16 19:03:25,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749813801] [2020-01-16 19:03:25,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:25,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:25,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800425152] [2020-01-16 19:03:25,990 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:25,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:25,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:25,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:25,990 INFO L87 Difference]: Start difference. First operand 389 states and 1342 transitions. Second operand 9 states. [2020-01-16 19:03:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:26,105 INFO L93 Difference]: Finished difference Result 566 states and 1684 transitions. [2020-01-16 19:03:26,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:26,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:26,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:26,107 INFO L225 Difference]: With dead ends: 566 [2020-01-16 19:03:26,107 INFO L226 Difference]: Without dead ends: 549 [2020-01-16 19:03:26,107 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-01-16 19:03:26,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 386. [2020-01-16 19:03:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1336 transitions. [2020-01-16 19:03:26,116 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1336 transitions. Word has length 22 [2020-01-16 19:03:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:26,116 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1336 transitions. [2020-01-16 19:03:26,116 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1336 transitions. [2020-01-16 19:03:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:26,117 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:26,117 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:26,117 INFO L426 AbstractCegarLoop]: === Iteration 659 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:26,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:26,117 INFO L82 PathProgramCache]: Analyzing trace with hash 628982774, now seen corresponding path program 653 times [2020-01-16 19:03:26,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:26,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7387543] [2020-01-16 19:03:26,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:26,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-01-16 19:03:26,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7387543] [2020-01-16 19:03:26,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:26,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:26,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326945368] [2020-01-16 19:03:26,369 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:26,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:26,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:26,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:26,370 INFO L87 Difference]: Start difference. First operand 386 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:03:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:26,453 INFO L93 Difference]: Finished difference Result 557 states and 1666 transitions. [2020-01-16 19:03:26,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:26,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:26,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:26,454 INFO L225 Difference]: With dead ends: 557 [2020-01-16 19:03:26,454 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:03:26,455 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:03:26,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 387. [2020-01-16 19:03:26,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-01-16 19:03:26,463 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-01-16 19:03:26,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:26,463 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-01-16 19:03:26,463 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:26,463 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-01-16 19:03:26,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:26,464 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:26,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, 1, 1, 1] [2020-01-16 19:03:26,464 INFO L426 AbstractCegarLoop]: === Iteration 660 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:26,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:26,464 INFO L82 PathProgramCache]: Analyzing trace with hash -446728382, now seen corresponding path program 654 times [2020-01-16 19:03:26,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:26,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118568071] [2020-01-16 19:03:26,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:26,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-01-16 19:03:26,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118568071] [2020-01-16 19:03:26,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:26,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:26,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476745654] [2020-01-16 19:03:26,704 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:26,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:26,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:26,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:26,705 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:03:26,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:26,810 INFO L93 Difference]: Finished difference Result 562 states and 1675 transitions. [2020-01-16 19:03:26,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:26,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:26,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:26,812 INFO L225 Difference]: With dead ends: 562 [2020-01-16 19:03:26,812 INFO L226 Difference]: Without dead ends: 546 [2020-01-16 19:03:26,812 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-01-16 19:03:26,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 385. [2020-01-16 19:03:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:03:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1334 transitions. [2020-01-16 19:03:26,820 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1334 transitions. Word has length 22 [2020-01-16 19:03:26,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:26,820 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1334 transitions. [2020-01-16 19:03:26,820 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:26,820 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1334 transitions. [2020-01-16 19:03:26,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:26,821 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:26,821 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:26,821 INFO L426 AbstractCegarLoop]: === Iteration 661 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:26,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:26,821 INFO L82 PathProgramCache]: Analyzing trace with hash -2075621330, now seen corresponding path program 655 times [2020-01-16 19:03:26,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:26,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779418503] [2020-01-16 19:03:26,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:27,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779418503] [2020-01-16 19:03:27,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:27,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:27,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826300574] [2020-01-16 19:03:27,084 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:27,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:27,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:27,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:27,084 INFO L87 Difference]: Start difference. First operand 385 states and 1334 transitions. Second operand 9 states. [2020-01-16 19:03:27,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:27,201 INFO L93 Difference]: Finished difference Result 555 states and 1663 transitions. [2020-01-16 19:03:27,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:27,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:27,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:27,203 INFO L225 Difference]: With dead ends: 555 [2020-01-16 19:03:27,203 INFO L226 Difference]: Without dead ends: 544 [2020-01-16 19:03:27,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:27,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-01-16 19:03:27,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 387. [2020-01-16 19:03:27,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:27,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1338 transitions. [2020-01-16 19:03:27,213 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1338 transitions. Word has length 22 [2020-01-16 19:03:27,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:27,213 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1338 transitions. [2020-01-16 19:03:27,213 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:27,213 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1338 transitions. [2020-01-16 19:03:27,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:27,214 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:27,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, 1, 1, 1] [2020-01-16 19:03:27,214 INFO L426 AbstractCegarLoop]: === Iteration 662 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:27,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:27,214 INFO L82 PathProgramCache]: Analyzing trace with hash 773828956, now seen corresponding path program 656 times [2020-01-16 19:03:27,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:27,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191245625] [2020-01-16 19:03:27,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:27,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-01-16 19:03:27,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191245625] [2020-01-16 19:03:27,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:27,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:27,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212945617] [2020-01-16 19:03:27,473 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:27,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:27,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:27,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:27,474 INFO L87 Difference]: Start difference. First operand 387 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:03:27,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:27,552 INFO L93 Difference]: Finished difference Result 553 states and 1658 transitions. [2020-01-16 19:03:27,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:27,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:27,553 INFO L225 Difference]: With dead ends: 553 [2020-01-16 19:03:27,553 INFO L226 Difference]: Without dead ends: 543 [2020-01-16 19:03:27,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:27,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-01-16 19:03:27,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 386. [2020-01-16 19:03:27,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:27,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1336 transitions. [2020-01-16 19:03:27,562 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1336 transitions. Word has length 22 [2020-01-16 19:03:27,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:27,562 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1336 transitions. [2020-01-16 19:03:27,562 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:27,563 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1336 transitions. [2020-01-16 19:03:27,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:27,563 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:27,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, 1, 1, 1] [2020-01-16 19:03:27,563 INFO L426 AbstractCegarLoop]: === Iteration 663 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:27,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:27,563 INFO L82 PathProgramCache]: Analyzing trace with hash 31162790, now seen corresponding path program 657 times [2020-01-16 19:03:27,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:27,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286278580] [2020-01-16 19:03:27,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:27,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:27,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286278580] [2020-01-16 19:03:27,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:27,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:27,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592410295] [2020-01-16 19:03:27,817 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:27,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:27,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:27,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:27,817 INFO L87 Difference]: Start difference. First operand 386 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:03:27,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:27,936 INFO L93 Difference]: Finished difference Result 561 states and 1676 transitions. [2020-01-16 19:03:27,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:27,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:27,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:27,938 INFO L225 Difference]: With dead ends: 561 [2020-01-16 19:03:27,938 INFO L226 Difference]: Without dead ends: 550 [2020-01-16 19:03:27,938 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:27,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-01-16 19:03:27,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 389. [2020-01-16 19:03:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:03:27,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1341 transitions. [2020-01-16 19:03:27,946 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1341 transitions. Word has length 22 [2020-01-16 19:03:27,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:27,946 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1341 transitions. [2020-01-16 19:03:27,946 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:27,946 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1341 transitions. [2020-01-16 19:03:27,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:27,947 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:27,947 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:27,947 INFO L426 AbstractCegarLoop]: === Iteration 664 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:27,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:27,947 INFO L82 PathProgramCache]: Analyzing trace with hash -750836452, now seen corresponding path program 658 times [2020-01-16 19:03:27,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:27,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466847683] [2020-01-16 19:03:27,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:28,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466847683] [2020-01-16 19:03:28,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:28,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:28,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037699992] [2020-01-16 19:03:28,202 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:28,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:28,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:28,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:28,202 INFO L87 Difference]: Start difference. First operand 389 states and 1341 transitions. Second operand 9 states. [2020-01-16 19:03:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:28,309 INFO L93 Difference]: Finished difference Result 563 states and 1677 transitions. [2020-01-16 19:03:28,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:28,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:28,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:28,311 INFO L225 Difference]: With dead ends: 563 [2020-01-16 19:03:28,311 INFO L226 Difference]: Without dead ends: 547 [2020-01-16 19:03:28,311 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:28,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-01-16 19:03:28,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 386. [2020-01-16 19:03:28,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-01-16 19:03:28,320 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-01-16 19:03:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:28,320 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-01-16 19:03:28,320 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-01-16 19:03:28,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:28,320 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:28,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, 1, 1, 1] [2020-01-16 19:03:28,321 INFO L426 AbstractCegarLoop]: === Iteration 665 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:28,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:28,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1280175222, now seen corresponding path program 659 times [2020-01-16 19:03:28,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:28,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204179243] [2020-01-16 19:03:28,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:28,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-01-16 19:03:28,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204179243] [2020-01-16 19:03:28,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:28,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:28,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220356434] [2020-01-16 19:03:28,576 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:28,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:28,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:28,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:28,577 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:03:28,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:28,656 INFO L93 Difference]: Finished difference Result 555 states and 1661 transitions. [2020-01-16 19:03:28,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:28,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:28,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:28,658 INFO L225 Difference]: With dead ends: 555 [2020-01-16 19:03:28,658 INFO L226 Difference]: Without dead ends: 546 [2020-01-16 19:03:28,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:28,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-01-16 19:03:28,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 387. [2020-01-16 19:03:28,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-01-16 19:03:28,667 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-01-16 19:03:28,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:28,667 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-01-16 19:03:28,667 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-01-16 19:03:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:28,668 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:28,668 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:28,668 INFO L426 AbstractCegarLoop]: === Iteration 666 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:28,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:28,668 INFO L82 PathProgramCache]: Analyzing trace with hash -868621314, now seen corresponding path program 660 times [2020-01-16 19:03:28,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:28,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590164024] [2020-01-16 19:03:28,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:28,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-01-16 19:03:28,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590164024] [2020-01-16 19:03:28,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:28,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:28,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286075013] [2020-01-16 19:03:28,917 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:28,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:28,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:28,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:28,917 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:03:29,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:29,037 INFO L93 Difference]: Finished difference Result 559 states and 1668 transitions. [2020-01-16 19:03:29,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:29,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:29,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:29,038 INFO L225 Difference]: With dead ends: 559 [2020-01-16 19:03:29,038 INFO L226 Difference]: Without dead ends: 544 [2020-01-16 19:03:29,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:29,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-01-16 19:03:29,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 385. [2020-01-16 19:03:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:03:29,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1333 transitions. [2020-01-16 19:03:29,047 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1333 transitions. Word has length 22 [2020-01-16 19:03:29,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:29,048 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1333 transitions. [2020-01-16 19:03:29,048 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:29,048 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1333 transitions. [2020-01-16 19:03:29,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:29,048 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:29,048 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:29,048 INFO L426 AbstractCegarLoop]: === Iteration 667 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:29,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:29,049 INFO L82 PathProgramCache]: Analyzing trace with hash 265768622, now seen corresponding path program 661 times [2020-01-16 19:03:29,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:29,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612576935] [2020-01-16 19:03:29,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:29,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612576935] [2020-01-16 19:03:29,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:29,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:29,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177221099] [2020-01-16 19:03:29,304 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:29,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:29,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:29,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:29,305 INFO L87 Difference]: Start difference. First operand 385 states and 1333 transitions. Second operand 9 states. [2020-01-16 19:03:29,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:29,421 INFO L93 Difference]: Finished difference Result 575 states and 1714 transitions. [2020-01-16 19:03:29,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:29,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:29,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:29,423 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:03:29,423 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 19:03:29,423 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 19:03:29,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 391. [2020-01-16 19:03:29,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:03:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1349 transitions. [2020-01-16 19:03:29,432 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1349 transitions. Word has length 22 [2020-01-16 19:03:29,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:29,432 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1349 transitions. [2020-01-16 19:03:29,432 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:29,432 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1349 transitions. [2020-01-16 19:03:29,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:29,433 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:29,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, 1, 1, 1] [2020-01-16 19:03:29,433 INFO L426 AbstractCegarLoop]: === Iteration 668 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:29,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:29,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1651803752, now seen corresponding path program 662 times [2020-01-16 19:03:29,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:29,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637670866] [2020-01-16 19:03:29,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:29,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637670866] [2020-01-16 19:03:29,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:29,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:29,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010292192] [2020-01-16 19:03:29,683 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:29,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:29,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:29,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:29,683 INFO L87 Difference]: Start difference. First operand 391 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:03:29,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:29,785 INFO L93 Difference]: Finished difference Result 578 states and 1717 transitions. [2020-01-16 19:03:29,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:29,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:29,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:29,787 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:03:29,787 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:03:29,787 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:29,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:03:29,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 388. [2020-01-16 19:03:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:03:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1341 transitions. [2020-01-16 19:03:29,797 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1341 transitions. Word has length 22 [2020-01-16 19:03:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:29,797 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1341 transitions. [2020-01-16 19:03:29,797 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1341 transitions. [2020-01-16 19:03:29,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:29,798 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:29,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, 1, 1, 1] [2020-01-16 19:03:29,798 INFO L426 AbstractCegarLoop]: === Iteration 669 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:29,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:29,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1359860210, now seen corresponding path program 663 times [2020-01-16 19:03:29,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:29,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054181902] [2020-01-16 19:03:29,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:30,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-01-16 19:03:30,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054181902] [2020-01-16 19:03:30,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:30,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:30,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569990969] [2020-01-16 19:03:30,053 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:30,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:30,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:30,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:30,054 INFO L87 Difference]: Start difference. First operand 388 states and 1341 transitions. Second operand 9 states. [2020-01-16 19:03:30,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:30,162 INFO L93 Difference]: Finished difference Result 574 states and 1709 transitions. [2020-01-16 19:03:30,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:30,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:30,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:30,164 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:03:30,164 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:03:30,164 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:30,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:03:30,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 391. [2020-01-16 19:03:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:03:30,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1346 transitions. [2020-01-16 19:03:30,173 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1346 transitions. Word has length 22 [2020-01-16 19:03:30,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:30,173 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1346 transitions. [2020-01-16 19:03:30,173 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:30,173 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1346 transitions. [2020-01-16 19:03:30,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:30,174 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:30,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, 1, 1, 1] [2020-01-16 19:03:30,174 INFO L426 AbstractCegarLoop]: === Iteration 670 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:30,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:30,174 INFO L82 PathProgramCache]: Analyzing trace with hash 577860968, now seen corresponding path program 664 times [2020-01-16 19:03:30,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:30,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26437081] [2020-01-16 19:03:30,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:30,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26437081] [2020-01-16 19:03:30,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:30,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:30,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710735857] [2020-01-16 19:03:30,423 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:30,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:30,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:30,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:30,423 INFO L87 Difference]: Start difference. First operand 391 states and 1346 transitions. Second operand 9 states. [2020-01-16 19:03:30,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:30,542 INFO L93 Difference]: Finished difference Result 576 states and 1710 transitions. [2020-01-16 19:03:30,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:30,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:30,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:30,544 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:03:30,544 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:03:30,544 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:03:30,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 388. [2020-01-16 19:03:30,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:03:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-01-16 19:03:30,553 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-01-16 19:03:30,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:30,553 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-01-16 19:03:30,553 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:30,553 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-01-16 19:03:30,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:30,554 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:30,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, 1, 1, 1] [2020-01-16 19:03:30,554 INFO L426 AbstractCegarLoop]: === Iteration 671 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:30,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:30,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1115336270, now seen corresponding path program 665 times [2020-01-16 19:03:30,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:30,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629875068] [2020-01-16 19:03:30,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:30,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629875068] [2020-01-16 19:03:30,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:30,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:30,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884964910] [2020-01-16 19:03:30,809 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:30,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:30,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:30,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:30,809 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:03:30,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:30,915 INFO L93 Difference]: Finished difference Result 582 states and 1724 transitions. [2020-01-16 19:03:30,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:30,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:30,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:30,917 INFO L225 Difference]: With dead ends: 582 [2020-01-16 19:03:30,917 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:03:30,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:30,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:03:30,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 393. [2020-01-16 19:03:30,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:03:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1347 transitions. [2020-01-16 19:03:30,926 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1347 transitions. Word has length 22 [2020-01-16 19:03:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:30,927 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1347 transitions. [2020-01-16 19:03:30,927 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:30,927 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1347 transitions. [2020-01-16 19:03:30,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:30,927 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:30,927 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:30,927 INFO L426 AbstractCegarLoop]: === Iteration 672 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:30,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:30,928 INFO L82 PathProgramCache]: Analyzing trace with hash 595277038, now seen corresponding path program 666 times [2020-01-16 19:03:30,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:30,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148263596] [2020-01-16 19:03:30,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:31,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-01-16 19:03:31,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148263596] [2020-01-16 19:03:31,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:31,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:31,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645056878] [2020-01-16 19:03:31,191 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:31,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:31,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:31,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:31,191 INFO L87 Difference]: Start difference. First operand 393 states and 1347 transitions. Second operand 9 states. [2020-01-16 19:03:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:31,308 INFO L93 Difference]: Finished difference Result 581 states and 1717 transitions. [2020-01-16 19:03:31,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:31,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:31,309 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:03:31,310 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:03:31,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:31,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:03:31,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 385. [2020-01-16 19:03:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:03:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1332 transitions. [2020-01-16 19:03:31,319 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1332 transitions. Word has length 22 [2020-01-16 19:03:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:31,320 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1332 transitions. [2020-01-16 19:03:31,320 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1332 transitions. [2020-01-16 19:03:31,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:31,321 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:31,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, 1, 1, 1] [2020-01-16 19:03:31,321 INFO L426 AbstractCegarLoop]: === Iteration 673 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:31,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:31,321 INFO L82 PathProgramCache]: Analyzing trace with hash -854152164, now seen corresponding path program 667 times [2020-01-16 19:03:31,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:31,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823107620] [2020-01-16 19:03:31,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:31,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-01-16 19:03:31,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823107620] [2020-01-16 19:03:31,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:31,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:31,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995845687] [2020-01-16 19:03:31,582 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:31,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:31,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:31,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:31,582 INFO L87 Difference]: Start difference. First operand 385 states and 1332 transitions. Second operand 9 states. [2020-01-16 19:03:31,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:31,674 INFO L93 Difference]: Finished difference Result 561 states and 1675 transitions. [2020-01-16 19:03:31,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:31,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:31,676 INFO L225 Difference]: With dead ends: 561 [2020-01-16 19:03:31,676 INFO L226 Difference]: Without dead ends: 552 [2020-01-16 19:03:31,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:31,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-01-16 19:03:31,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 387. [2020-01-16 19:03:31,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-01-16 19:03:31,685 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-01-16 19:03:31,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:31,685 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-01-16 19:03:31,685 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-01-16 19:03:31,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:31,686 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:31,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, 1, 1, 1] [2020-01-16 19:03:31,686 INFO L426 AbstractCegarLoop]: === Iteration 674 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:31,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:31,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1929863320, now seen corresponding path program 668 times [2020-01-16 19:03:31,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:31,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383256276] [2020-01-16 19:03:31,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:31,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383256276] [2020-01-16 19:03:31,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:31,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:31,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427364790] [2020-01-16 19:03:31,933 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:31,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:31,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:31,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:31,934 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:03:32,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:32,049 INFO L93 Difference]: Finished difference Result 566 states and 1684 transitions. [2020-01-16 19:03:32,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:32,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:32,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:32,051 INFO L225 Difference]: With dead ends: 566 [2020-01-16 19:03:32,051 INFO L226 Difference]: Without dead ends: 551 [2020-01-16 19:03:32,051 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-01-16 19:03:32,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 386. [2020-01-16 19:03:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1334 transitions. [2020-01-16 19:03:32,059 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1334 transitions. Word has length 22 [2020-01-16 19:03:32,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:32,059 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1334 transitions. [2020-01-16 19:03:32,059 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:32,059 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1334 transitions. [2020-01-16 19:03:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:32,060 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:32,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, 1, 1, 1] [2020-01-16 19:03:32,060 INFO L426 AbstractCegarLoop]: === Iteration 675 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:32,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:32,060 INFO L82 PathProgramCache]: Analyzing trace with hash 239939424, now seen corresponding path program 669 times [2020-01-16 19:03:32,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:32,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052357297] [2020-01-16 19:03:32,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:32,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-01-16 19:03:32,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052357297] [2020-01-16 19:03:32,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:32,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:32,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455150691] [2020-01-16 19:03:32,346 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:32,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:32,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:32,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:32,346 INFO L87 Difference]: Start difference. First operand 386 states and 1334 transitions. Second operand 9 states. [2020-01-16 19:03:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:32,430 INFO L93 Difference]: Finished difference Result 560 states and 1672 transitions. [2020-01-16 19:03:32,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:32,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:32,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:32,432 INFO L225 Difference]: With dead ends: 560 [2020-01-16 19:03:32,432 INFO L226 Difference]: Without dead ends: 551 [2020-01-16 19:03:32,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:32,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-01-16 19:03:32,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 387. [2020-01-16 19:03:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1335 transitions. [2020-01-16 19:03:32,442 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1335 transitions. Word has length 22 [2020-01-16 19:03:32,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:32,442 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1335 transitions. [2020-01-16 19:03:32,442 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:32,442 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1335 transitions. [2020-01-16 19:03:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:32,443 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:32,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:32,443 INFO L426 AbstractCegarLoop]: === Iteration 676 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:32,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:32,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1908857112, now seen corresponding path program 670 times [2020-01-16 19:03:32,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:32,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654034608] [2020-01-16 19:03:32,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:32,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654034608] [2020-01-16 19:03:32,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:32,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:32,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205414110] [2020-01-16 19:03:32,708 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:32,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:32,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:32,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:32,708 INFO L87 Difference]: Start difference. First operand 387 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:03:32,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:32,829 INFO L93 Difference]: Finished difference Result 564 states and 1679 transitions. [2020-01-16 19:03:32,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:32,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:32,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:32,831 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:03:32,831 INFO L226 Difference]: Without dead ends: 550 [2020-01-16 19:03:32,831 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:32,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-01-16 19:03:32,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 386. [2020-01-16 19:03:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1333 transitions. [2020-01-16 19:03:32,841 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1333 transitions. Word has length 22 [2020-01-16 19:03:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:32,841 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1333 transitions. [2020-01-16 19:03:32,841 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1333 transitions. [2020-01-16 19:03:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:32,842 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03: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, 1, 1, 1] [2020-01-16 19:03:32,842 INFO L426 AbstractCegarLoop]: === Iteration 677 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:32,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:32,842 INFO L82 PathProgramCache]: Analyzing trace with hash 176920800, now seen corresponding path program 671 times [2020-01-16 19:03:32,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:32,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853156021] [2020-01-16 19:03:32,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:33,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:33,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853156021] [2020-01-16 19:03:33,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:33,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:33,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240236009] [2020-01-16 19:03:33,095 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:33,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:33,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:33,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:33,095 INFO L87 Difference]: Start difference. First operand 386 states and 1333 transitions. Second operand 9 states. [2020-01-16 19:03:33,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:33,193 INFO L93 Difference]: Finished difference Result 574 states and 1703 transitions. [2020-01-16 19:03:33,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:33,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:33,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:33,195 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:03:33,195 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:03:33,195 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:33,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:03:33,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 391. [2020-01-16 19:03:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:03:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1342 transitions. [2020-01-16 19:03:33,204 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1342 transitions. Word has length 22 [2020-01-16 19:03:33,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:33,204 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1342 transitions. [2020-01-16 19:03:33,204 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1342 transitions. [2020-01-16 19:03:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:33,205 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:33,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, 1, 1, 1] [2020-01-16 19:03:33,205 INFO L426 AbstractCegarLoop]: === Iteration 678 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:33,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:33,205 INFO L82 PathProgramCache]: Analyzing trace with hash -896164580, now seen corresponding path program 672 times [2020-01-16 19:03:33,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:33,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481828738] [2020-01-16 19:03:33,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:33,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-01-16 19:03:33,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481828738] [2020-01-16 19:03:33,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:33,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:33,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222788930] [2020-01-16 19:03:33,457 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:33,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:33,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:33,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:33,458 INFO L87 Difference]: Start difference. First operand 391 states and 1342 transitions. Second operand 9 states. [2020-01-16 19:03:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:33,578 INFO L93 Difference]: Finished difference Result 573 states and 1696 transitions. [2020-01-16 19:03:33,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:33,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:33,580 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:03:33,580 INFO L226 Difference]: Without dead ends: 553 [2020-01-16 19:03:33,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:33,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-01-16 19:03:33,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 384. [2020-01-16 19:03:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:03:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1330 transitions. [2020-01-16 19:03:33,589 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1330 transitions. Word has length 22 [2020-01-16 19:03:33,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:33,590 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1330 transitions. [2020-01-16 19:03:33,590 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1330 transitions. [2020-01-16 19:03:33,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:33,590 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:33,590 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:33,590 INFO L426 AbstractCegarLoop]: === Iteration 679 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:33,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:33,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1729611692, now seen corresponding path program 673 times [2020-01-16 19:03:33,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:33,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708840181] [2020-01-16 19:03:33,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:33,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708840181] [2020-01-16 19:03:33,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:33,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:33,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245573625] [2020-01-16 19:03:33,853 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:33,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:33,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:33,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:33,854 INFO L87 Difference]: Start difference. First operand 384 states and 1330 transitions. Second operand 9 states. [2020-01-16 19:03:33,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:33,957 INFO L93 Difference]: Finished difference Result 570 states and 1710 transitions. [2020-01-16 19:03:33,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:33,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:33,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:33,959 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:03:33,959 INFO L226 Difference]: Without dead ends: 559 [2020-01-16 19:03:33,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:33,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-01-16 19:03:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 390. [2020-01-16 19:03:33,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:03:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1349 transitions. [2020-01-16 19:03:33,968 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1349 transitions. Word has length 22 [2020-01-16 19:03:33,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:33,968 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1349 transitions. [2020-01-16 19:03:33,968 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1349 transitions. [2020-01-16 19:03:33,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:33,969 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03: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, 1, 1, 1] [2020-01-16 19:03:33,969 INFO L426 AbstractCegarLoop]: === Iteration 680 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:33,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:33,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1476518940, now seen corresponding path program 674 times [2020-01-16 19:03:33,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:33,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376464574] [2020-01-16 19:03:33,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:34,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:34,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376464574] [2020-01-16 19:03:34,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:34,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:34,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872482314] [2020-01-16 19:03:34,225 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:34,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:34,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:34,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:34,225 INFO L87 Difference]: Start difference. First operand 390 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:03:34,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:34,327 INFO L93 Difference]: Finished difference Result 569 states and 1706 transitions. [2020-01-16 19:03:34,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:34,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:34,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:34,328 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:03:34,329 INFO L226 Difference]: Without dead ends: 557 [2020-01-16 19:03:34,329 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:34,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-01-16 19:03:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 388. [2020-01-16 19:03:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:03:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1344 transitions. [2020-01-16 19:03:34,338 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1344 transitions. Word has length 22 [2020-01-16 19:03:34,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:34,338 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1344 transitions. [2020-01-16 19:03:34,338 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1344 transitions. [2020-01-16 19:03:34,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:34,338 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:34,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:34,339 INFO L426 AbstractCegarLoop]: === Iteration 681 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:34,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:34,339 INFO L82 PathProgramCache]: Analyzing trace with hash 883518694, now seen corresponding path program 675 times [2020-01-16 19:03:34,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:34,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715923272] [2020-01-16 19:03:34,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:34,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-01-16 19:03:34,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715923272] [2020-01-16 19:03:34,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:34,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:34,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305866372] [2020-01-16 19:03:34,591 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:34,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:34,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:34,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:34,591 INFO L87 Difference]: Start difference. First operand 388 states and 1344 transitions. Second operand 9 states. [2020-01-16 19:03:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:34,696 INFO L93 Difference]: Finished difference Result 575 states and 1719 transitions. [2020-01-16 19:03:34,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:34,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:34,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:34,697 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:03:34,698 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 19:03:34,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 19:03:34,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 391. [2020-01-16 19:03:34,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:03:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1349 transitions. [2020-01-16 19:03:34,707 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1349 transitions. Word has length 22 [2020-01-16 19:03:34,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:34,707 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1349 transitions. [2020-01-16 19:03:34,707 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:34,707 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1349 transitions. [2020-01-16 19:03:34,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:34,707 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:34,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, 1, 1, 1] [2020-01-16 19:03:34,708 INFO L426 AbstractCegarLoop]: === Iteration 682 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:34,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:34,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2025413472, now seen corresponding path program 676 times [2020-01-16 19:03:34,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:34,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716820004] [2020-01-16 19:03:34,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:34,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716820004] [2020-01-16 19:03:34,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:34,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:34,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537921854] [2020-01-16 19:03:34,965 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:34,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:34,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:34,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:34,965 INFO L87 Difference]: Start difference. First operand 391 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:03:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:35,076 INFO L93 Difference]: Finished difference Result 578 states and 1722 transitions. [2020-01-16 19:03:35,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:35,076 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:35,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:35,078 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:03:35,078 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:03:35,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:35,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:03:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 388. [2020-01-16 19:03:35,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:03:35,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1342 transitions. [2020-01-16 19:03:35,087 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1342 transitions. Word has length 22 [2020-01-16 19:03:35,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:35,088 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1342 transitions. [2020-01-16 19:03:35,088 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:35,088 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1342 transitions. [2020-01-16 19:03:35,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:35,088 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:35,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, 1, 1, 1] [2020-01-16 19:03:35,088 INFO L426 AbstractCegarLoop]: === Iteration 683 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:35,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:35,089 INFO L82 PathProgramCache]: Analyzing trace with hash -2017428796, now seen corresponding path program 677 times [2020-01-16 19:03:35,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:35,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566468485] [2020-01-16 19:03:35,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:35,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-01-16 19:03:35,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566468485] [2020-01-16 19:03:35,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:35,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:35,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447537042] [2020-01-16 19:03:35,339 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:35,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:35,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:35,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:35,340 INFO L87 Difference]: Start difference. First operand 388 states and 1342 transitions. Second operand 9 states. [2020-01-16 19:03:35,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:35,455 INFO L93 Difference]: Finished difference Result 572 states and 1710 transitions. [2020-01-16 19:03:35,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:35,455 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:35,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:35,456 INFO L225 Difference]: With dead ends: 572 [2020-01-16 19:03:35,456 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:03:35,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:35,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:03:35,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 390. [2020-01-16 19:03:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:03:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1345 transitions. [2020-01-16 19:03:35,465 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1345 transitions. Word has length 22 [2020-01-16 19:03:35,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:35,466 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1345 transitions. [2020-01-16 19:03:35,466 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1345 transitions. [2020-01-16 19:03:35,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:35,466 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:35,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, 1, 1, 1] [2020-01-16 19:03:35,466 INFO L426 AbstractCegarLoop]: === Iteration 684 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:35,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:35,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1359588310, now seen corresponding path program 678 times [2020-01-16 19:03:35,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:35,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299520767] [2020-01-16 19:03:35,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:35,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299520767] [2020-01-16 19:03:35,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:35,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:35,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133440998] [2020-01-16 19:03:35,727 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:35,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:35,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:35,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:35,728 INFO L87 Difference]: Start difference. First operand 390 states and 1345 transitions. Second operand 9 states. [2020-01-16 19:03:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:35,840 INFO L93 Difference]: Finished difference Result 576 states and 1716 transitions. [2020-01-16 19:03:35,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:35,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:35,842 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:03:35,842 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:03:35,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:03:35,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 386. [2020-01-16 19:03:35,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:35,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1337 transitions. [2020-01-16 19:03:35,851 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1337 transitions. Word has length 22 [2020-01-16 19:03:35,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:35,852 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1337 transitions. [2020-01-16 19:03:35,852 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:35,852 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1337 transitions. [2020-01-16 19:03:35,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:35,852 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:35,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, 1, 1, 1] [2020-01-16 19:03:35,852 INFO L426 AbstractCegarLoop]: === Iteration 685 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:35,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:35,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2122456464, now seen corresponding path program 679 times [2020-01-16 19:03:35,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:35,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667481395] [2020-01-16 19:03:35,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:36,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:36,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667481395] [2020-01-16 19:03:36,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:36,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:36,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055490183] [2020-01-16 19:03:36,112 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:36,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:36,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:36,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:36,113 INFO L87 Difference]: Start difference. First operand 386 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:03:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:36,231 INFO L93 Difference]: Finished difference Result 569 states and 1706 transitions. [2020-01-16 19:03:36,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:36,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:36,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:36,233 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:03:36,233 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:03:36,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:36,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:03:36,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 390. [2020-01-16 19:03:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:03:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1347 transitions. [2020-01-16 19:03:36,243 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1347 transitions. Word has length 22 [2020-01-16 19:03:36,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:36,243 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1347 transitions. [2020-01-16 19:03:36,243 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1347 transitions. [2020-01-16 19:03:36,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:36,243 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:36,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, 1, 1, 1] [2020-01-16 19:03:36,244 INFO L426 AbstractCegarLoop]: === Iteration 686 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:36,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:36,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1919418080, now seen corresponding path program 680 times [2020-01-16 19:03:36,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:36,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49759874] [2020-01-16 19:03:36,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:36,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49759874] [2020-01-16 19:03:36,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:36,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:36,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668544358] [2020-01-16 19:03:36,501 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:36,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:36,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:36,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:36,502 INFO L87 Difference]: Start difference. First operand 390 states and 1347 transitions. Second operand 9 states. [2020-01-16 19:03:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:36,618 INFO L93 Difference]: Finished difference Result 568 states and 1702 transitions. [2020-01-16 19:03:36,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:36,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:36,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:36,620 INFO L225 Difference]: With dead ends: 568 [2020-01-16 19:03:36,620 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:03:36,620 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:36,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:03:36,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 388. [2020-01-16 19:03:36,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:03:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1342 transitions. [2020-01-16 19:03:36,630 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1342 transitions. Word has length 22 [2020-01-16 19:03:36,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:36,630 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1342 transitions. [2020-01-16 19:03:36,630 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:36,630 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1342 transitions. [2020-01-16 19:03:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:36,630 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:36,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, 1, 1, 1] [2020-01-16 19:03:36,630 INFO L426 AbstractCegarLoop]: === Iteration 687 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:36,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:36,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1534711142, now seen corresponding path program 681 times [2020-01-16 19:03:36,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:36,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828902224] [2020-01-16 19:03:36,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:36,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-01-16 19:03:36,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828902224] [2020-01-16 19:03:36,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:36,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:36,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695501239] [2020-01-16 19:03:36,883 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:36,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:36,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:36,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:36,883 INFO L87 Difference]: Start difference. First operand 388 states and 1342 transitions. Second operand 9 states. [2020-01-16 19:03:37,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:37,012 INFO L93 Difference]: Finished difference Result 573 states and 1713 transitions. [2020-01-16 19:03:37,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:37,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:37,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:37,013 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:03:37,014 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:03:37,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:37,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:03:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 391. [2020-01-16 19:03:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:03:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1347 transitions. [2020-01-16 19:03:37,022 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1347 transitions. Word has length 22 [2020-01-16 19:03:37,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:37,023 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1347 transitions. [2020-01-16 19:03:37,023 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1347 transitions. [2020-01-16 19:03:37,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:37,023 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:37,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, 1, 1, 1] [2020-01-16 19:03:37,023 INFO L426 AbstractCegarLoop]: === Iteration 688 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:37,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:37,024 INFO L82 PathProgramCache]: Analyzing trace with hash 752711900, now seen corresponding path program 682 times [2020-01-16 19:03:37,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:37,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378148884] [2020-01-16 19:03:37,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:37,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378148884] [2020-01-16 19:03:37,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:37,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:37,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335203050] [2020-01-16 19:03:37,275 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:37,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:37,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:37,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:37,275 INFO L87 Difference]: Start difference. First operand 391 states and 1347 transitions. Second operand 9 states. [2020-01-16 19:03:37,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:37,407 INFO L93 Difference]: Finished difference Result 575 states and 1714 transitions. [2020-01-16 19:03:37,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:37,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:37,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:37,409 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:03:37,409 INFO L226 Difference]: Without dead ends: 559 [2020-01-16 19:03:37,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:37,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-01-16 19:03:37,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 388. [2020-01-16 19:03:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:03:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1340 transitions. [2020-01-16 19:03:37,419 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1340 transitions. Word has length 22 [2020-01-16 19:03:37,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:37,419 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1340 transitions. [2020-01-16 19:03:37,419 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:37,419 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1340 transitions. [2020-01-16 19:03:37,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:37,420 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:37,420 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:37,420 INFO L426 AbstractCegarLoop]: === Iteration 689 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:37,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:37,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1855645568, now seen corresponding path program 683 times [2020-01-16 19:03:37,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:37,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066889729] [2020-01-16 19:03:37,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:37,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-01-16 19:03:37,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066889729] [2020-01-16 19:03:37,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:37,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:37,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285333430] [2020-01-16 19:03:37,669 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:37,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:37,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:37,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:37,670 INFO L87 Difference]: Start difference. First operand 388 states and 1340 transitions. Second operand 9 states. [2020-01-16 19:03:37,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:37,797 INFO L93 Difference]: Finished difference Result 570 states and 1704 transitions. [2020-01-16 19:03:37,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:37,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:37,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:37,799 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:03:37,799 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:03:37,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:37,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:03:37,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 390. [2020-01-16 19:03:37,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:03:37,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1343 transitions. [2020-01-16 19:03:37,812 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1343 transitions. Word has length 22 [2020-01-16 19:03:37,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:37,813 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1343 transitions. [2020-01-16 19:03:37,813 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:37,813 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1343 transitions. [2020-01-16 19:03:37,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:37,813 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:37,813 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:37,813 INFO L426 AbstractCegarLoop]: === Iteration 690 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:37,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:37,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1867866922, now seen corresponding path program 684 times [2020-01-16 19:03:37,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:37,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585199317] [2020-01-16 19:03:37,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:38,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-01-16 19:03:38,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585199317] [2020-01-16 19:03:38,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:38,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:38,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740377360] [2020-01-16 19:03:38,065 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:38,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:38,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:38,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:38,065 INFO L87 Difference]: Start difference. First operand 390 states and 1343 transitions. Second operand 9 states. [2020-01-16 19:03:38,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:38,179 INFO L93 Difference]: Finished difference Result 573 states and 1708 transitions. [2020-01-16 19:03:38,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:38,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:38,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:38,181 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:03:38,181 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:03:38,181 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:38,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:03:38,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 386. [2020-01-16 19:03:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:38,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-01-16 19:03:38,191 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-01-16 19:03:38,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:38,191 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-01-16 19:03:38,191 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:38,191 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-01-16 19:03:38,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:38,192 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:38,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, 1, 1, 1] [2020-01-16 19:03:38,192 INFO L426 AbstractCegarLoop]: === Iteration 691 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:38,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:38,192 INFO L82 PathProgramCache]: Analyzing trace with hash -156717104, now seen corresponding path program 685 times [2020-01-16 19:03:38,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:38,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967555614] [2020-01-16 19:03:38,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:38,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-01-16 19:03:38,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967555614] [2020-01-16 19:03:38,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:38,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:38,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629189397] [2020-01-16 19:03:38,445 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:38,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:38,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:38,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:38,445 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:03:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:38,573 INFO L93 Difference]: Finished difference Result 583 states and 1739 transitions. [2020-01-16 19:03:38,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:38,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:38,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:38,575 INFO L225 Difference]: With dead ends: 583 [2020-01-16 19:03:38,575 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:03:38,575 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:38,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:03:38,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 392. [2020-01-16 19:03:38,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:03:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1351 transitions. [2020-01-16 19:03:38,585 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1351 transitions. Word has length 22 [2020-01-16 19:03:38,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:38,585 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1351 transitions. [2020-01-16 19:03:38,585 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:38,585 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1351 transitions. [2020-01-16 19:03:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:38,586 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:38,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, 1, 1, 1] [2020-01-16 19:03:38,586 INFO L426 AbstractCegarLoop]: === Iteration 692 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:38,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:38,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1229318026, now seen corresponding path program 686 times [2020-01-16 19:03:38,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:38,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913108412] [2020-01-16 19:03:38,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:38,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913108412] [2020-01-16 19:03:38,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:38,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:38,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466592415] [2020-01-16 19:03:38,841 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:38,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:38,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:38,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:38,841 INFO L87 Difference]: Start difference. First operand 392 states and 1351 transitions. Second operand 9 states. [2020-01-16 19:03:38,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:38,968 INFO L93 Difference]: Finished difference Result 586 states and 1742 transitions. [2020-01-16 19:03:38,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:38,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:38,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:38,970 INFO L225 Difference]: With dead ends: 586 [2020-01-16 19:03:38,970 INFO L226 Difference]: Without dead ends: 569 [2020-01-16 19:03:38,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:38,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-01-16 19:03:38,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 389. [2020-01-16 19:03:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:03:38,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1343 transitions. [2020-01-16 19:03:38,979 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1343 transitions. Word has length 22 [2020-01-16 19:03:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:38,979 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1343 transitions. [2020-01-16 19:03:38,979 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1343 transitions. [2020-01-16 19:03:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:38,980 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:38,980 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:38,980 INFO L426 AbstractCegarLoop]: === Iteration 693 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:38,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:38,980 INFO L82 PathProgramCache]: Analyzing trace with hash 937374484, now seen corresponding path program 687 times [2020-01-16 19:03:38,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:38,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515676255] [2020-01-16 19:03:38,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:39,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-01-16 19:03:39,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515676255] [2020-01-16 19:03:39,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:39,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:39,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667091716] [2020-01-16 19:03:39,235 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:39,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:39,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:39,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:39,235 INFO L87 Difference]: Start difference. First operand 389 states and 1343 transitions. Second operand 9 states. [2020-01-16 19:03:39,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:39,362 INFO L93 Difference]: Finished difference Result 582 states and 1734 transitions. [2020-01-16 19:03:39,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:39,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:39,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:39,364 INFO L225 Difference]: With dead ends: 582 [2020-01-16 19:03:39,364 INFO L226 Difference]: Without dead ends: 571 [2020-01-16 19:03:39,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:39,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-01-16 19:03:39,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 392. [2020-01-16 19:03:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:03:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1348 transitions. [2020-01-16 19:03:39,374 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1348 transitions. Word has length 22 [2020-01-16 19:03:39,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:39,374 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1348 transitions. [2020-01-16 19:03:39,374 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:39,374 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1348 transitions. [2020-01-16 19:03:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:39,375 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:39,375 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:39,375 INFO L426 AbstractCegarLoop]: === Iteration 694 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:39,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:39,375 INFO L82 PathProgramCache]: Analyzing trace with hash 155375242, now seen corresponding path program 688 times [2020-01-16 19:03:39,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:39,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685605399] [2020-01-16 19:03:39,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:39,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-01-16 19:03:39,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685605399] [2020-01-16 19:03:39,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:39,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:39,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264581822] [2020-01-16 19:03:39,626 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:39,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:39,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:39,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:39,626 INFO L87 Difference]: Start difference. First operand 392 states and 1348 transitions. Second operand 9 states. [2020-01-16 19:03:39,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:39,762 INFO L93 Difference]: Finished difference Result 584 states and 1735 transitions. [2020-01-16 19:03:39,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:39,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:39,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:39,764 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:03:39,764 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:03:39,764 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:39,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:03:39,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 389. [2020-01-16 19:03:39,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:03:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1340 transitions. [2020-01-16 19:03:39,774 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1340 transitions. Word has length 22 [2020-01-16 19:03:39,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:39,774 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1340 transitions. [2020-01-16 19:03:39,774 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:39,774 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1340 transitions. [2020-01-16 19:03:39,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:39,775 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:39,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, 1, 1, 1] [2020-01-16 19:03:39,775 INFO L426 AbstractCegarLoop]: === Iteration 695 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:39,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:39,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1537821996, now seen corresponding path program 689 times [2020-01-16 19:03:39,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:39,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274899142] [2020-01-16 19:03:39,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:40,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274899142] [2020-01-16 19:03:40,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:40,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:40,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306175369] [2020-01-16 19:03:40,029 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:40,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:40,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:40,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:40,029 INFO L87 Difference]: Start difference. First operand 389 states and 1340 transitions. Second operand 9 states. [2020-01-16 19:03:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:40,161 INFO L93 Difference]: Finished difference Result 590 states and 1749 transitions. [2020-01-16 19:03:40,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:40,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:40,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:40,163 INFO L225 Difference]: With dead ends: 590 [2020-01-16 19:03:40,163 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:03:40,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:40,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:03:40,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 394. [2020-01-16 19:03:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:03:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1349 transitions. [2020-01-16 19:03:40,173 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1349 transitions. Word has length 22 [2020-01-16 19:03:40,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:40,173 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1349 transitions. [2020-01-16 19:03:40,173 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:40,173 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1349 transitions. [2020-01-16 19:03:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:40,174 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:40,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, 1, 1, 1] [2020-01-16 19:03:40,174 INFO L426 AbstractCegarLoop]: === Iteration 696 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:40,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:40,174 INFO L82 PathProgramCache]: Analyzing trace with hash 172791312, now seen corresponding path program 690 times [2020-01-16 19:03:40,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:40,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113897683] [2020-01-16 19:03:40,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:40,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-01-16 19:03:40,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113897683] [2020-01-16 19:03:40,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:40,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:40,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538834860] [2020-01-16 19:03:40,429 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:40,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:40,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:40,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:40,429 INFO L87 Difference]: Start difference. First operand 394 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:03:40,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:40,571 INFO L93 Difference]: Finished difference Result 589 states and 1742 transitions. [2020-01-16 19:03:40,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:40,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:40,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:40,573 INFO L225 Difference]: With dead ends: 589 [2020-01-16 19:03:40,573 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:03:40,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:03:40,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 386. [2020-01-16 19:03:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1333 transitions. [2020-01-16 19:03:40,583 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1333 transitions. Word has length 22 [2020-01-16 19:03:40,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:40,583 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1333 transitions. [2020-01-16 19:03:40,583 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1333 transitions. [2020-01-16 19:03:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:40,583 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:40,584 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:40,584 INFO L426 AbstractCegarLoop]: === Iteration 697 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:40,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:40,584 INFO L82 PathProgramCache]: Analyzing trace with hash -954572700, now seen corresponding path program 691 times [2020-01-16 19:03:40,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:40,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348097942] [2020-01-16 19:03:40,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:40,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348097942] [2020-01-16 19:03:40,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:40,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:40,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886227859] [2020-01-16 19:03:40,826 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:40,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:40,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:40,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:40,826 INFO L87 Difference]: Start difference. First operand 386 states and 1333 transitions. Second operand 9 states. [2020-01-16 19:03:40,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:40,943 INFO L93 Difference]: Finished difference Result 576 states and 1718 transitions. [2020-01-16 19:03:40,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:40,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:40,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:40,945 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:03:40,945 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:03:40,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:40,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:03:40,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 390. [2020-01-16 19:03:40,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:03:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1343 transitions. [2020-01-16 19:03:40,955 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1343 transitions. Word has length 22 [2020-01-16 19:03:40,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:40,955 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1343 transitions. [2020-01-16 19:03:40,955 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:40,955 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1343 transitions. [2020-01-16 19:03:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:40,956 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:40,956 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:40,956 INFO L426 AbstractCegarLoop]: === Iteration 698 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:40,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:40,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1872522890, now seen corresponding path program 692 times [2020-01-16 19:03:40,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:40,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450282460] [2020-01-16 19:03:40,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:41,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-01-16 19:03:41,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450282460] [2020-01-16 19:03:41,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:41,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:41,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887592973] [2020-01-16 19:03:41,204 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:41,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:41,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:41,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:41,205 INFO L87 Difference]: Start difference. First operand 390 states and 1343 transitions. Second operand 9 states. [2020-01-16 19:03:41,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:41,333 INFO L93 Difference]: Finished difference Result 580 states and 1724 transitions. [2020-01-16 19:03:41,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:41,333 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:41,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:41,335 INFO L225 Difference]: With dead ends: 580 [2020-01-16 19:03:41,335 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 19:03:41,335 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:41,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 19:03:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 388. [2020-01-16 19:03:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:03:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-01-16 19:03:41,345 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-01-16 19:03:41,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:41,345 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-01-16 19:03:41,345 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-01-16 19:03:41,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:41,346 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:41,346 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:41,346 INFO L426 AbstractCegarLoop]: === Iteration 699 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:41,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:41,346 INFO L82 PathProgramCache]: Analyzing trace with hash -2027658080, now seen corresponding path program 693 times [2020-01-16 19:03:41,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:41,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803331910] [2020-01-16 19:03:41,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:41,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-01-16 19:03:41,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803331910] [2020-01-16 19:03:41,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:41,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:41,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844302139] [2020-01-16 19:03:41,603 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:41,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:41,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:41,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:41,603 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:03:41,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:41,708 INFO L93 Difference]: Finished difference Result 575 states and 1714 transitions. [2020-01-16 19:03:41,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:41,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:41,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:41,710 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:03:41,710 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:03:41,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:41,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:03:41,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 390. [2020-01-16 19:03:41,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:03:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1341 transitions. [2020-01-16 19:03:41,719 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1341 transitions. Word has length 22 [2020-01-16 19:03:41,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:41,719 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1341 transitions. [2020-01-16 19:03:41,719 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1341 transitions. [2020-01-16 19:03:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:41,720 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:41,720 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:41,720 INFO L426 AbstractCegarLoop]: === Iteration 700 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:41,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:41,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1456203274, now seen corresponding path program 694 times [2020-01-16 19:03:41,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:41,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561355274] [2020-01-16 19:03:41,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:41,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561355274] [2020-01-16 19:03:41,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:41,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:41,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604882745] [2020-01-16 19:03:41,971 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:41,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:41,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:41,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:41,971 INFO L87 Difference]: Start difference. First operand 390 states and 1341 transitions. Second operand 9 states. [2020-01-16 19:03:42,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:42,101 INFO L93 Difference]: Finished difference Result 578 states and 1718 transitions. [2020-01-16 19:03:42,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:42,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:42,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:42,102 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:03:42,102 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:03:42,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:03:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 388. [2020-01-16 19:03:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:03:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1336 transitions. [2020-01-16 19:03:42,111 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1336 transitions. Word has length 22 [2020-01-16 19:03:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:42,111 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1336 transitions. [2020-01-16 19:03:42,111 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1336 transitions. [2020-01-16 19:03:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:42,112 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:42,112 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:42,112 INFO L426 AbstractCegarLoop]: === Iteration 701 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:42,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:42,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1337293088, now seen corresponding path program 695 times [2020-01-16 19:03:42,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:42,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086035100] [2020-01-16 19:03:42,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:42,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-01-16 19:03:42,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086035100] [2020-01-16 19:03:42,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:42,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:42,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058974560] [2020-01-16 19:03:42,368 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:42,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:42,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:42,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:42,368 INFO L87 Difference]: Start difference. First operand 388 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:03:42,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:42,500 INFO L93 Difference]: Finished difference Result 586 states and 1737 transitions. [2020-01-16 19:03:42,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:42,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:42,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:42,502 INFO L225 Difference]: With dead ends: 586 [2020-01-16 19:03:42,502 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:03:42,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:03:42,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 393. [2020-01-16 19:03:42,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:03:42,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1345 transitions. [2020-01-16 19:03:42,512 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1345 transitions. Word has length 22 [2020-01-16 19:03:42,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:42,512 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1345 transitions. [2020-01-16 19:03:42,512 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:42,512 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1345 transitions. [2020-01-16 19:03:42,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:42,513 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:42,513 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:42,513 INFO L426 AbstractCegarLoop]: === Iteration 702 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:42,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:42,513 INFO L82 PathProgramCache]: Analyzing trace with hash 152111908, now seen corresponding path program 696 times [2020-01-16 19:03:42,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:42,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328411379] [2020-01-16 19:03:42,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:42,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328411379] [2020-01-16 19:03:42,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:42,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:42,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220605511] [2020-01-16 19:03:42,770 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:42,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:42,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:42,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:42,770 INFO L87 Difference]: Start difference. First operand 393 states and 1345 transitions. Second operand 9 states. [2020-01-16 19:03:42,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:42,897 INFO L93 Difference]: Finished difference Result 585 states and 1730 transitions. [2020-01-16 19:03:42,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:42,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:42,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:42,899 INFO L225 Difference]: With dead ends: 585 [2020-01-16 19:03:42,899 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:03:42,899 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:42,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:03:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 384. [2020-01-16 19:03:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:03:42,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1329 transitions. [2020-01-16 19:03:42,908 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1329 transitions. Word has length 22 [2020-01-16 19:03:42,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:42,910 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1329 transitions. [2020-01-16 19:03:42,910 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:42,910 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1329 transitions. [2020-01-16 19:03:42,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:42,911 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:42,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:42,911 INFO L426 AbstractCegarLoop]: === Iteration 703 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:42,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:42,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1022949092, now seen corresponding path program 697 times [2020-01-16 19:03:42,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:42,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844554867] [2020-01-16 19:03:42,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:43,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-01-16 19:03:43,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844554867] [2020-01-16 19:03:43,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:43,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:43,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10333852] [2020-01-16 19:03:43,195 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:43,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:43,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:43,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:43,195 INFO L87 Difference]: Start difference. First operand 384 states and 1329 transitions. Second operand 9 states. [2020-01-16 19:03:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:43,306 INFO L93 Difference]: Finished difference Result 547 states and 1641 transitions. [2020-01-16 19:03:43,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:43,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:43,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:43,308 INFO L225 Difference]: With dead ends: 547 [2020-01-16 19:03:43,308 INFO L226 Difference]: Without dead ends: 538 [2020-01-16 19:03:43,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:43,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-01-16 19:03:43,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 387. [2020-01-16 19:03:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-01-16 19:03:43,318 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-01-16 19:03:43,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:43,318 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-01-16 19:03:43,318 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:43,318 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-01-16 19:03:43,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:43,319 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:43,319 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:43,319 INFO L426 AbstractCegarLoop]: === Iteration 704 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:43,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:43,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1661077246, now seen corresponding path program 698 times [2020-01-16 19:03:43,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:43,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023761464] [2020-01-16 19:03:43,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:43,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-01-16 19:03:43,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023761464] [2020-01-16 19:03:43,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:43,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:43,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075280451] [2020-01-16 19:03:43,598 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:43,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:43,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:43,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:43,598 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:03:43,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:43,723 INFO L93 Difference]: Finished difference Result 548 states and 1642 transitions. [2020-01-16 19:03:43,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:43,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:43,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:43,725 INFO L225 Difference]: With dead ends: 548 [2020-01-16 19:03:43,725 INFO L226 Difference]: Without dead ends: 537 [2020-01-16 19:03:43,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:43,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-01-16 19:03:43,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 386. [2020-01-16 19:03:43,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-01-16 19:03:43,734 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-01-16 19:03:43,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:43,735 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-01-16 19:03:43,735 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-01-16 19:03:43,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:43,735 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:43,735 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:43,735 INFO L426 AbstractCegarLoop]: === Iteration 705 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:43,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:43,736 INFO L82 PathProgramCache]: Analyzing trace with hash -658887818, now seen corresponding path program 699 times [2020-01-16 19:03:43,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:43,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656350539] [2020-01-16 19:03:43,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:44,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656350539] [2020-01-16 19:03:44,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:44,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:44,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146907026] [2020-01-16 19:03:44,001 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:44,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:44,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:44,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:44,002 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:03:44,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:44,103 INFO L93 Difference]: Finished difference Result 551 states and 1648 transitions. [2020-01-16 19:03:44,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:44,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:44,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:44,105 INFO L225 Difference]: With dead ends: 551 [2020-01-16 19:03:44,105 INFO L226 Difference]: Without dead ends: 542 [2020-01-16 19:03:44,105 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:44,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-01-16 19:03:44,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 387. [2020-01-16 19:03:44,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:44,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-01-16 19:03:44,114 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-01-16 19:03:44,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:44,114 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-01-16 19:03:44,114 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:44,114 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-01-16 19:03:44,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:44,115 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:44,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, 1, 1, 1] [2020-01-16 19:03:44,115 INFO L426 AbstractCegarLoop]: === Iteration 706 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:44,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:44,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1734598974, now seen corresponding path program 700 times [2020-01-16 19:03:44,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:44,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615883592] [2020-01-16 19:03:44,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:44,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615883592] [2020-01-16 19:03:44,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:44,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:44,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536315257] [2020-01-16 19:03:44,423 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:44,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:44,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:44,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:44,424 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:03:44,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:44,550 INFO L93 Difference]: Finished difference Result 556 states and 1657 transitions. [2020-01-16 19:03:44,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:44,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:44,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:44,552 INFO L225 Difference]: With dead ends: 556 [2020-01-16 19:03:44,552 INFO L226 Difference]: Without dead ends: 541 [2020-01-16 19:03:44,552 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:44,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-01-16 19:03:44,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 386. [2020-01-16 19:03:44,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:44,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1334 transitions. [2020-01-16 19:03:44,562 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1334 transitions. Word has length 22 [2020-01-16 19:03:44,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:44,562 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1334 transitions. [2020-01-16 19:03:44,562 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:44,562 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1334 transitions. [2020-01-16 19:03:44,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:44,563 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:44,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, 1, 1, 1] [2020-01-16 19:03:44,563 INFO L426 AbstractCegarLoop]: === Iteration 707 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:44,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:44,563 INFO L82 PathProgramCache]: Analyzing trace with hash -648384714, now seen corresponding path program 701 times [2020-01-16 19:03:44,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:44,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762443579] [2020-01-16 19:03:44,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:44,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762443579] [2020-01-16 19:03:44,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:44,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:44,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747639106] [2020-01-16 19:03:44,831 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:44,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:44,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:44,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:44,831 INFO L87 Difference]: Start difference. First operand 386 states and 1334 transitions. Second operand 9 states. [2020-01-16 19:03:44,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:44,933 INFO L93 Difference]: Finished difference Result 554 states and 1654 transitions. [2020-01-16 19:03:44,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:44,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:44,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:44,935 INFO L225 Difference]: With dead ends: 554 [2020-01-16 19:03:44,935 INFO L226 Difference]: Without dead ends: 544 [2020-01-16 19:03:44,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:44,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-01-16 19:03:44,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 388. [2020-01-16 19:03:44,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:03:44,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1337 transitions. [2020-01-16 19:03:44,944 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1337 transitions. Word has length 22 [2020-01-16 19:03:44,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:44,944 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1337 transitions. [2020-01-16 19:03:44,944 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1337 transitions. [2020-01-16 19:03:44,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:44,945 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:44,945 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:44,945 INFO L426 AbstractCegarLoop]: === Iteration 708 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:44,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:44,945 INFO L82 PathProgramCache]: Analyzing trace with hash 959930468, now seen corresponding path program 702 times [2020-01-16 19:03:44,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:44,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640850557] [2020-01-16 19:03:44,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:45,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640850557] [2020-01-16 19:03:45,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:45,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:45,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010689670] [2020-01-16 19:03:45,204 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:45,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:45,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:45,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:45,205 INFO L87 Difference]: Start difference. First operand 388 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:03:45,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:45,331 INFO L93 Difference]: Finished difference Result 558 states and 1660 transitions. [2020-01-16 19:03:45,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:45,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:45,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:45,333 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:03:45,333 INFO L226 Difference]: Without dead ends: 541 [2020-01-16 19:03:45,333 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:45,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-01-16 19:03:45,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 385. [2020-01-16 19:03:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:03:45,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1332 transitions. [2020-01-16 19:03:45,342 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1332 transitions. Word has length 22 [2020-01-16 19:03:45,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:45,342 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1332 transitions. [2020-01-16 19:03:45,343 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1332 transitions. [2020-01-16 19:03:45,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:45,343 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03: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, 1, 1, 1] [2020-01-16 19:03:45,343 INFO L426 AbstractCegarLoop]: === Iteration 709 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:45,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:45,343 INFO L82 PathProgramCache]: Analyzing trace with hash 580049952, now seen corresponding path program 703 times [2020-01-16 19:03:45,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:45,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059064513] [2020-01-16 19:03:45,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:45,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059064513] [2020-01-16 19:03:45,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:45,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:45,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097745965] [2020-01-16 19:03:45,636 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:45,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:45,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:45,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:45,636 INFO L87 Difference]: Start difference. First operand 385 states and 1332 transitions. Second operand 9 states. [2020-01-16 19:03:45,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:45,739 INFO L93 Difference]: Finished difference Result 546 states and 1638 transitions. [2020-01-16 19:03:45,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:45,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:45,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:45,741 INFO L225 Difference]: With dead ends: 546 [2020-01-16 19:03:45,741 INFO L226 Difference]: Without dead ends: 537 [2020-01-16 19:03:45,741 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:45,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-01-16 19:03:45,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 387. [2020-01-16 19:03:45,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-01-16 19:03:45,749 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-01-16 19:03:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:45,749 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-01-16 19:03:45,749 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-01-16 19:03:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:45,750 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:45,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, 1, 1, 1] [2020-01-16 19:03:45,750 INFO L426 AbstractCegarLoop]: === Iteration 710 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:45,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:45,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2103976386, now seen corresponding path program 704 times [2020-01-16 19:03:45,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:45,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987157913] [2020-01-16 19:03:45,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:46,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987157913] [2020-01-16 19:03:46,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:46,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:46,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170926652] [2020-01-16 19:03:46,033 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:46,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:46,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:46,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:46,034 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:03:46,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:46,161 INFO L93 Difference]: Finished difference Result 547 states and 1639 transitions. [2020-01-16 19:03:46,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:46,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:46,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:46,163 INFO L225 Difference]: With dead ends: 547 [2020-01-16 19:03:46,163 INFO L226 Difference]: Without dead ends: 536 [2020-01-16 19:03:46,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:46,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-01-16 19:03:46,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 386. [2020-01-16 19:03:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1334 transitions. [2020-01-16 19:03:46,172 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1334 transitions. Word has length 22 [2020-01-16 19:03:46,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:46,172 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1334 transitions. [2020-01-16 19:03:46,172 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1334 transitions. [2020-01-16 19:03:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:46,173 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:46,173 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:46,173 INFO L426 AbstractCegarLoop]: === Iteration 711 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:46,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:46,173 INFO L82 PathProgramCache]: Analyzing trace with hash -7695370, now seen corresponding path program 705 times [2020-01-16 19:03:46,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:46,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123358364] [2020-01-16 19:03:46,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:46,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123358364] [2020-01-16 19:03:46,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:46,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:46,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175576949] [2020-01-16 19:03:46,451 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:46,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:46,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:46,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:46,451 INFO L87 Difference]: Start difference. First operand 386 states and 1334 transitions. Second operand 9 states. [2020-01-16 19:03:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:46,560 INFO L93 Difference]: Finished difference Result 549 states and 1643 transitions. [2020-01-16 19:03:46,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:46,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:46,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:46,562 INFO L225 Difference]: With dead ends: 549 [2020-01-16 19:03:46,562 INFO L226 Difference]: Without dead ends: 540 [2020-01-16 19:03:46,562 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:46,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-01-16 19:03:46,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 387. [2020-01-16 19:03:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:46,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1335 transitions. [2020-01-16 19:03:46,570 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1335 transitions. Word has length 22 [2020-01-16 19:03:46,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:46,570 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1335 transitions. [2020-01-16 19:03:46,570 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:46,570 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1335 transitions. [2020-01-16 19:03:46,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:46,571 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:46,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, 1, 1, 1] [2020-01-16 19:03:46,571 INFO L426 AbstractCegarLoop]: === Iteration 712 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:46,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:46,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2138475390, now seen corresponding path program 706 times [2020-01-16 19:03:46,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:46,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5696363] [2020-01-16 19:03:46,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:46,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-01-16 19:03:46,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5696363] [2020-01-16 19:03:46,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:46,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:46,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781230201] [2020-01-16 19:03:46,843 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:46,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:46,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:46,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:46,844 INFO L87 Difference]: Start difference. First operand 387 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:03:46,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:46,972 INFO L93 Difference]: Finished difference Result 553 states and 1650 transitions. [2020-01-16 19:03:46,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:46,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:46,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:46,974 INFO L225 Difference]: With dead ends: 553 [2020-01-16 19:03:46,974 INFO L226 Difference]: Without dead ends: 539 [2020-01-16 19:03:46,974 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:46,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-01-16 19:03:46,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 386. [2020-01-16 19:03:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1333 transitions. [2020-01-16 19:03:46,983 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1333 transitions. Word has length 22 [2020-01-16 19:03:46,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:46,983 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1333 transitions. [2020-01-16 19:03:46,983 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1333 transitions. [2020-01-16 19:03:46,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:46,983 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:46,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, 1, 1, 1] [2020-01-16 19:03:46,984 INFO L426 AbstractCegarLoop]: === Iteration 713 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:46,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:46,984 INFO L82 PathProgramCache]: Analyzing trace with hash 2807734, now seen corresponding path program 707 times [2020-01-16 19:03:46,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:46,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362616103] [2020-01-16 19:03:46,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:47,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362616103] [2020-01-16 19:03:47,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:47,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:47,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531514130] [2020-01-16 19:03:47,254 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:47,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:47,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:47,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:47,255 INFO L87 Difference]: Start difference. First operand 386 states and 1333 transitions. Second operand 9 states. [2020-01-16 19:03:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:47,381 INFO L93 Difference]: Finished difference Result 552 states and 1649 transitions. [2020-01-16 19:03:47,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:47,381 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:47,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:47,382 INFO L225 Difference]: With dead ends: 552 [2020-01-16 19:03:47,383 INFO L226 Difference]: Without dead ends: 542 [2020-01-16 19:03:47,383 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-01-16 19:03:47,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 388. [2020-01-16 19:03:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:03:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1336 transitions. [2020-01-16 19:03:47,392 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1336 transitions. Word has length 22 [2020-01-16 19:03:47,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:47,393 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1336 transitions. [2020-01-16 19:03:47,393 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:47,393 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1336 transitions. [2020-01-16 19:03:47,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:47,393 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:47,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, 1, 1, 1] [2020-01-16 19:03:47,393 INFO L426 AbstractCegarLoop]: === Iteration 714 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:47,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:47,394 INFO L82 PathProgramCache]: Analyzing trace with hash 538037536, now seen corresponding path program 708 times [2020-01-16 19:03:47,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:47,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424170944] [2020-01-16 19:03:47,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:47,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-01-16 19:03:47,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424170944] [2020-01-16 19:03:47,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:47,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:47,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673015277] [2020-01-16 19:03:47,664 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:47,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:47,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:47,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:47,664 INFO L87 Difference]: Start difference. First operand 388 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:03:47,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:47,793 INFO L93 Difference]: Finished difference Result 555 states and 1653 transitions. [2020-01-16 19:03:47,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:47,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:47,795 INFO L225 Difference]: With dead ends: 555 [2020-01-16 19:03:47,795 INFO L226 Difference]: Without dead ends: 539 [2020-01-16 19:03:47,795 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:47,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-01-16 19:03:47,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 385. [2020-01-16 19:03:47,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:03:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1331 transitions. [2020-01-16 19:03:47,804 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1331 transitions. Word has length 22 [2020-01-16 19:03:47,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:47,804 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1331 transitions. [2020-01-16 19:03:47,804 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1331 transitions. [2020-01-16 19:03:47,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:47,805 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:47,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, 1, 1, 1] [2020-01-16 19:03:47,805 INFO L426 AbstractCegarLoop]: === Iteration 715 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:47,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:47,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1699123616, now seen corresponding path program 709 times [2020-01-16 19:03:47,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:47,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894376382] [2020-01-16 19:03:47,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:48,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-01-16 19:03:48,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894376382] [2020-01-16 19:03:48,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:48,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:48,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265451050] [2020-01-16 19:03:48,070 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:48,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:48,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:48,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:48,070 INFO L87 Difference]: Start difference. First operand 385 states and 1331 transitions. Second operand 9 states. [2020-01-16 19:03:48,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:48,158 INFO L93 Difference]: Finished difference Result 557 states and 1662 transitions. [2020-01-16 19:03:48,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:48,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:48,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:48,160 INFO L225 Difference]: With dead ends: 557 [2020-01-16 19:03:48,160 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:03:48,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:48,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:03:48,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 387. [2020-01-16 19:03:48,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:48,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1335 transitions. [2020-01-16 19:03:48,169 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1335 transitions. Word has length 22 [2020-01-16 19:03:48,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:48,169 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1335 transitions. [2020-01-16 19:03:48,169 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1335 transitions. [2020-01-16 19:03:48,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:48,170 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:48,170 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:48,170 INFO L426 AbstractCegarLoop]: === Iteration 716 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:48,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:48,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1520132524, now seen corresponding path program 710 times [2020-01-16 19:03:48,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:48,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674689526] [2020-01-16 19:03:48,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:48,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-01-16 19:03:48,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674689526] [2020-01-16 19:03:48,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:48,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:48,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101375786] [2020-01-16 19:03:48,429 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:48,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:48,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:48,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:48,430 INFO L87 Difference]: Start difference. First operand 387 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:03:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:48,562 INFO L93 Difference]: Finished difference Result 562 states and 1671 transitions. [2020-01-16 19:03:48,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:48,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:48,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:48,563 INFO L225 Difference]: With dead ends: 562 [2020-01-16 19:03:48,564 INFO L226 Difference]: Without dead ends: 547 [2020-01-16 19:03:48,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:48,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-01-16 19:03:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 386. [2020-01-16 19:03:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1333 transitions. [2020-01-16 19:03:48,572 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1333 transitions. Word has length 22 [2020-01-16 19:03:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:48,572 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1333 transitions. [2020-01-16 19:03:48,572 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1333 transitions. [2020-01-16 19:03:48,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:48,572 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:48,573 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:48,573 INFO L426 AbstractCegarLoop]: === Iteration 717 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:48,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:48,573 INFO L82 PathProgramCache]: Analyzing trace with hash -605032028, now seen corresponding path program 711 times [2020-01-16 19:03:48,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:48,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710124263] [2020-01-16 19:03:48,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:48,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710124263] [2020-01-16 19:03:48,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:48,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:48,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668871729] [2020-01-16 19:03:48,850 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:48,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:48,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:48,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:48,850 INFO L87 Difference]: Start difference. First operand 386 states and 1333 transitions. Second operand 9 states. [2020-01-16 19:03:48,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:48,955 INFO L93 Difference]: Finished difference Result 556 states and 1659 transitions. [2020-01-16 19:03:48,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:48,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:48,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:48,957 INFO L225 Difference]: With dead ends: 556 [2020-01-16 19:03:48,957 INFO L226 Difference]: Without dead ends: 547 [2020-01-16 19:03:48,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:48,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-01-16 19:03:48,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 387. [2020-01-16 19:03:48,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1334 transitions. [2020-01-16 19:03:48,967 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1334 transitions. Word has length 22 [2020-01-16 19:03:48,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:48,967 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1334 transitions. [2020-01-16 19:03:48,967 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:48,967 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1334 transitions. [2020-01-16 19:03:48,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:48,967 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:48,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:48,968 INFO L426 AbstractCegarLoop]: === Iteration 718 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:48,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:48,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1541138732, now seen corresponding path program 712 times [2020-01-16 19:03:48,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:48,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304254507] [2020-01-16 19:03:48,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:49,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-01-16 19:03:49,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304254507] [2020-01-16 19:03:49,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:49,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:49,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528719024] [2020-01-16 19:03:49,235 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:49,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:49,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:49,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:49,236 INFO L87 Difference]: Start difference. First operand 387 states and 1334 transitions. Second operand 9 states. [2020-01-16 19:03:49,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:49,364 INFO L93 Difference]: Finished difference Result 560 states and 1666 transitions. [2020-01-16 19:03:49,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:49,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:49,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:49,366 INFO L225 Difference]: With dead ends: 560 [2020-01-16 19:03:49,366 INFO L226 Difference]: Without dead ends: 546 [2020-01-16 19:03:49,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-01-16 19:03:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 386. [2020-01-16 19:03:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1332 transitions. [2020-01-16 19:03:49,375 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1332 transitions. Word has length 22 [2020-01-16 19:03:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:49,375 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1332 transitions. [2020-01-16 19:03:49,375 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:49,376 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1332 transitions. [2020-01-16 19:03:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:49,376 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:49,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, 1, 1, 1] [2020-01-16 19:03:49,376 INFO L426 AbstractCegarLoop]: === Iteration 719 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:49,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:49,376 INFO L82 PathProgramCache]: Analyzing trace with hash -668050652, now seen corresponding path program 713 times [2020-01-16 19:03:49,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:49,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722762591] [2020-01-16 19:03:49,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:49,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-01-16 19:03:49,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722762591] [2020-01-16 19:03:49,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:49,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:49,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595079170] [2020-01-16 19:03:49,654 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:49,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:49,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:49,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:49,655 INFO L87 Difference]: Start difference. First operand 386 states and 1332 transitions. Second operand 9 states. [2020-01-16 19:03:49,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:49,782 INFO L93 Difference]: Finished difference Result 570 states and 1690 transitions. [2020-01-16 19:03:49,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:49,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:49,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:49,784 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:03:49,784 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:03:49,784 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:49,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:03:49,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 391. [2020-01-16 19:03:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:03:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1341 transitions. [2020-01-16 19:03:49,793 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1341 transitions. Word has length 22 [2020-01-16 19:03:49,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:49,793 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1341 transitions. [2020-01-16 19:03:49,793 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1341 transitions. [2020-01-16 19:03:49,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:49,794 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:49,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, 1, 1, 1] [2020-01-16 19:03:49,794 INFO L426 AbstractCegarLoop]: === Iteration 720 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:49,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:49,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1741136032, now seen corresponding path program 714 times [2020-01-16 19:03:49,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:49,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700690766] [2020-01-16 19:03:49,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03: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-01-16 19:03:50,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700690766] [2020-01-16 19:03:50,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:50,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:50,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615734490] [2020-01-16 19:03:50,065 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:50,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:50,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:50,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:50,065 INFO L87 Difference]: Start difference. First operand 391 states and 1341 transitions. Second operand 9 states. [2020-01-16 19:03:50,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:50,196 INFO L93 Difference]: Finished difference Result 569 states and 1683 transitions. [2020-01-16 19:03:50,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:50,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:50,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:50,197 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:03:50,198 INFO L226 Difference]: Without dead ends: 550 [2020-01-16 19:03:50,198 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:50,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-01-16 19:03:50,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 385. [2020-01-16 19:03:50,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:03:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1330 transitions. [2020-01-16 19:03:50,206 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1330 transitions. Word has length 22 [2020-01-16 19:03:50,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:50,206 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1330 transitions. [2020-01-16 19:03:50,206 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:50,206 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1330 transitions. [2020-01-16 19:03:50,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:50,207 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:50,207 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:50,207 INFO L426 AbstractCegarLoop]: === Iteration 721 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:50,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:50,207 INFO L82 PathProgramCache]: Analyzing trace with hash 237413566, now seen corresponding path program 715 times [2020-01-16 19:03:50,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:50,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113346326] [2020-01-16 19:03:50,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:50,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:50,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113346326] [2020-01-16 19:03:50,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:50,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:50,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176168450] [2020-01-16 19:03:50,462 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:50,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:50,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:50,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:50,462 INFO L87 Difference]: Start difference. First operand 385 states and 1330 transitions. Second operand 9 states. [2020-01-16 19:03:50,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:50,577 INFO L93 Difference]: Finished difference Result 564 states and 1680 transitions. [2020-01-16 19:03:50,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:50,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:50,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:50,578 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:03:50,579 INFO L226 Difference]: Without dead ends: 554 [2020-01-16 19:03:50,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:50,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-01-16 19:03:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 389. [2020-01-16 19:03:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:03:50,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1340 transitions. [2020-01-16 19:03:50,587 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1340 transitions. Word has length 22 [2020-01-16 19:03:50,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:50,587 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1340 transitions. [2020-01-16 19:03:50,587 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1340 transitions. [2020-01-16 19:03:50,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:50,588 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:50,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, 1, 1, 1] [2020-01-16 19:03:50,588 INFO L426 AbstractCegarLoop]: === Iteration 722 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:50,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:50,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1845728748, now seen corresponding path program 716 times [2020-01-16 19:03:50,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:50,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947737919] [2020-01-16 19:03:50,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:50,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-01-16 19:03:50,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947737919] [2020-01-16 19:03:50,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:50,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:50,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026200790] [2020-01-16 19:03:50,855 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:50,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:50,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:50,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:50,856 INFO L87 Difference]: Start difference. First operand 389 states and 1340 transitions. Second operand 9 states. [2020-01-16 19:03:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:50,984 INFO L93 Difference]: Finished difference Result 568 states and 1686 transitions. [2020-01-16 19:03:50,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:50,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:50,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:50,986 INFO L225 Difference]: With dead ends: 568 [2020-01-16 19:03:50,986 INFO L226 Difference]: Without dead ends: 552 [2020-01-16 19:03:50,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-01-16 19:03:50,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 387. [2020-01-16 19:03:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:50,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1335 transitions. [2020-01-16 19:03:50,996 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1335 transitions. Word has length 22 [2020-01-16 19:03:50,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:50,996 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1335 transitions. [2020-01-16 19:03:50,996 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:50,996 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1335 transitions. [2020-01-16 19:03:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:50,996 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:50,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, 1, 1, 1] [2020-01-16 19:03:50,997 INFO L426 AbstractCegarLoop]: === Iteration 723 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:50,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:50,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1331505154, now seen corresponding path program 717 times [2020-01-16 19:03:50,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:50,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778727933] [2020-01-16 19:03:50,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:51,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778727933] [2020-01-16 19:03:51,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:51,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:51,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416645656] [2020-01-16 19:03:51,261 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:51,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:51,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:51,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:51,262 INFO L87 Difference]: Start difference. First operand 387 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:03:51,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:51,391 INFO L93 Difference]: Finished difference Result 563 states and 1676 transitions. [2020-01-16 19:03:51,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:51,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:51,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:51,393 INFO L225 Difference]: With dead ends: 563 [2020-01-16 19:03:51,393 INFO L226 Difference]: Without dead ends: 553 [2020-01-16 19:03:51,393 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:51,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-01-16 19:03:51,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 389. [2020-01-16 19:03:51,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:03:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1338 transitions. [2020-01-16 19:03:51,402 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1338 transitions. Word has length 22 [2020-01-16 19:03:51,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:51,402 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1338 transitions. [2020-01-16 19:03:51,403 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1338 transitions. [2020-01-16 19:03:51,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:51,403 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:51,403 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:51,403 INFO L426 AbstractCegarLoop]: === Iteration 724 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:51,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:51,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1866734956, now seen corresponding path program 718 times [2020-01-16 19:03:51,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:51,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103443419] [2020-01-16 19:03:51,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:51,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-01-16 19:03:51,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103443419] [2020-01-16 19:03:51,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:51,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:51,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755337128] [2020-01-16 19:03:51,669 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:51,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:51,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:51,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:51,670 INFO L87 Difference]: Start difference. First operand 389 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:03:51,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:51,810 INFO L93 Difference]: Finished difference Result 566 states and 1680 transitions. [2020-01-16 19:03:51,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:51,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:51,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:51,812 INFO L225 Difference]: With dead ends: 566 [2020-01-16 19:03:51,812 INFO L226 Difference]: Without dead ends: 551 [2020-01-16 19:03:51,812 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:51,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-01-16 19:03:51,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 387. [2020-01-16 19:03:51,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:51,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1333 transitions. [2020-01-16 19:03:51,821 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1333 transitions. Word has length 22 [2020-01-16 19:03:51,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:51,821 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1333 transitions. [2020-01-16 19:03:51,821 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:51,821 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1333 transitions. [2020-01-16 19:03:51,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:51,821 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:51,821 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:51,822 INFO L426 AbstractCegarLoop]: === Iteration 725 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:51,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:51,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1257983426, now seen corresponding path program 719 times [2020-01-16 19:03:51,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:51,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763396406] [2020-01-16 19:03:51,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:52,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:52,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763396406] [2020-01-16 19:03:52,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:52,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:52,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381110894] [2020-01-16 19:03:52,098 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:52,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:52,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:52,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:52,098 INFO L87 Difference]: Start difference. First operand 387 states and 1333 transitions. Second operand 9 states. [2020-01-16 19:03:52,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:52,231 INFO L93 Difference]: Finished difference Result 574 states and 1699 transitions. [2020-01-16 19:03:52,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:52,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:52,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:52,232 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:03:52,232 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:03:52,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:03:52,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 392. [2020-01-16 19:03:52,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:03:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1342 transitions. [2020-01-16 19:03:52,242 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1342 transitions. Word has length 22 [2020-01-16 19:03:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:52,242 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1342 transitions. [2020-01-16 19:03:52,242 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1342 transitions. [2020-01-16 19:03:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:52,242 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:52,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, 1, 1, 1] [2020-01-16 19:03:52,243 INFO L426 AbstractCegarLoop]: === Iteration 726 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:52,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:52,243 INFO L82 PathProgramCache]: Analyzing trace with hash 184898046, now seen corresponding path program 720 times [2020-01-16 19:03:52,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:52,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185867642] [2020-01-16 19:03:52,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:52,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-01-16 19:03:52,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185867642] [2020-01-16 19:03:52,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:52,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:52,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961066044] [2020-01-16 19:03:52,511 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:52,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:52,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:52,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:52,511 INFO L87 Difference]: Start difference. First operand 392 states and 1342 transitions. Second operand 9 states. [2020-01-16 19:03:52,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:52,651 INFO L93 Difference]: Finished difference Result 573 states and 1692 transitions. [2020-01-16 19:03:52,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:52,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:52,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:52,652 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:03:52,653 INFO L226 Difference]: Without dead ends: 547 [2020-01-16 19:03:52,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:52,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-01-16 19:03:52,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 379. [2020-01-16 19:03:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:03:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1320 transitions. [2020-01-16 19:03:52,661 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1320 transitions. Word has length 22 [2020-01-16 19:03:52,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:52,662 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1320 transitions. [2020-01-16 19:03:52,662 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:52,662 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1320 transitions. [2020-01-16 19:03:52,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:52,662 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:52,662 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:52,662 INFO L426 AbstractCegarLoop]: === Iteration 727 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:52,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:52,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1940093732, now seen corresponding path program 721 times [2020-01-16 19:03:52,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:52,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705902985] [2020-01-16 19:03:52,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:52,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-01-16 19:03:52,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705902985] [2020-01-16 19:03:52,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:52,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:52,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084541272] [2020-01-16 19:03:52,942 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:52,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:52,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:52,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:52,942 INFO L87 Difference]: Start difference. First operand 379 states and 1320 transitions. Second operand 9 states. [2020-01-16 19:03:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:53,063 INFO L93 Difference]: Finished difference Result 597 states and 1761 transitions. [2020-01-16 19:03:53,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:53,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:53,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:53,065 INFO L225 Difference]: With dead ends: 597 [2020-01-16 19:03:53,065 INFO L226 Difference]: Without dead ends: 581 [2020-01-16 19:03:53,065 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:53,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-01-16 19:03:53,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 387. [2020-01-16 19:03:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1340 transitions. [2020-01-16 19:03:53,074 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1340 transitions. Word has length 22 [2020-01-16 19:03:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:53,074 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1340 transitions. [2020-01-16 19:03:53,074 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1340 transitions. [2020-01-16 19:03:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:53,075 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:53,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, 1, 1, 1] [2020-01-16 19:03:53,075 INFO L426 AbstractCegarLoop]: === Iteration 728 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:53,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:53,075 INFO L82 PathProgramCache]: Analyzing trace with hash -764607678, now seen corresponding path program 722 times [2020-01-16 19:03:53,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:53,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794879159] [2020-01-16 19:03:53,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:53,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794879159] [2020-01-16 19:03:53,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:53,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:53,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688808073] [2020-01-16 19:03:53,357 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:53,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:53,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:53,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:53,357 INFO L87 Difference]: Start difference. First operand 387 states and 1340 transitions. Second operand 9 states. [2020-01-16 19:03:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:53,489 INFO L93 Difference]: Finished difference Result 592 states and 1748 transitions. [2020-01-16 19:03:53,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:53,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:53,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:53,490 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:03:53,490 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:03:53,491 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:53,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:03:53,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 383. [2020-01-16 19:03:53,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:03:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1332 transitions. [2020-01-16 19:03:53,499 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1332 transitions. Word has length 22 [2020-01-16 19:03:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:53,499 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1332 transitions. [2020-01-16 19:03:53,499 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1332 transitions. [2020-01-16 19:03:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:53,500 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:53,500 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:53,500 INFO L426 AbstractCegarLoop]: === Iteration 729 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:53,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:53,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1002323244, now seen corresponding path program 723 times [2020-01-16 19:03:53,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:53,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730800355] [2020-01-16 19:03:53,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:53,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730800355] [2020-01-16 19:03:53,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:53,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:53,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110659463] [2020-01-16 19:03:53,780 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:53,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:53,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:53,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:53,781 INFO L87 Difference]: Start difference. First operand 383 states and 1332 transitions. Second operand 9 states. [2020-01-16 19:03:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:53,891 INFO L93 Difference]: Finished difference Result 593 states and 1749 transitions. [2020-01-16 19:03:53,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:53,891 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:53,893 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:03:53,893 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:03:53,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:53,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:03:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 385. [2020-01-16 19:03:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:03:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1334 transitions. [2020-01-16 19:03:53,902 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1334 transitions. Word has length 22 [2020-01-16 19:03:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:53,902 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1334 transitions. [2020-01-16 19:03:53,902 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1334 transitions. [2020-01-16 19:03:53,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:53,903 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:53,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, 1, 1, 1] [2020-01-16 19:03:53,903 INFO L426 AbstractCegarLoop]: === Iteration 730 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:53,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:53,903 INFO L82 PathProgramCache]: Analyzing trace with hash -441254752, now seen corresponding path program 724 times [2020-01-16 19:03:53,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:53,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119435405] [2020-01-16 19:03:53,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:54,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119435405] [2020-01-16 19:03:54,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:54,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:54,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032107276] [2020-01-16 19:03:54,181 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:54,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:54,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:54,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:54,182 INFO L87 Difference]: Start difference. First operand 385 states and 1334 transitions. Second operand 9 states. [2020-01-16 19:03:54,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:54,305 INFO L93 Difference]: Finished difference Result 586 states and 1734 transitions. [2020-01-16 19:03:54,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:54,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:54,307 INFO L225 Difference]: With dead ends: 586 [2020-01-16 19:03:54,307 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:03:54,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:54,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:03:54,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 383. [2020-01-16 19:03:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:03:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1330 transitions. [2020-01-16 19:03:54,315 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1330 transitions. Word has length 22 [2020-01-16 19:03:54,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:54,315 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1330 transitions. [2020-01-16 19:03:54,315 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:54,316 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1330 transitions. [2020-01-16 19:03:54,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:54,316 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:54,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, 1, 1, 1] [2020-01-16 19:03:54,316 INFO L426 AbstractCegarLoop]: === Iteration 731 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:54,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:54,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2098353846, now seen corresponding path program 725 times [2020-01-16 19:03:54,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:54,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646558706] [2020-01-16 19:03:54,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:54,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-01-16 19:03:54,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646558706] [2020-01-16 19:03:54,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:54,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:54,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661292878] [2020-01-16 19:03:54,603 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:54,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:54,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:54,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:54,603 INFO L87 Difference]: Start difference. First operand 383 states and 1330 transitions. Second operand 9 states. [2020-01-16 19:03:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:54,739 INFO L93 Difference]: Finished difference Result 582 states and 1727 transitions. [2020-01-16 19:03:54,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:54,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:54,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:54,740 INFO L225 Difference]: With dead ends: 582 [2020-01-16 19:03:54,741 INFO L226 Difference]: Without dead ends: 571 [2020-01-16 19:03:54,741 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:54,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-01-16 19:03:54,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 384. [2020-01-16 19:03:54,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:03:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1331 transitions. [2020-01-16 19:03:54,750 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1331 transitions. Word has length 22 [2020-01-16 19:03:54,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:54,750 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1331 transitions. [2020-01-16 19:03:54,750 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1331 transitions. [2020-01-16 19:03:54,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:54,751 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:54,751 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:54,751 INFO L426 AbstractCegarLoop]: === Iteration 732 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:54,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:54,751 INFO L82 PathProgramCache]: Analyzing trace with hash 652836836, now seen corresponding path program 726 times [2020-01-16 19:03:54,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:54,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147784430] [2020-01-16 19:03:54,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:55,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-01-16 19:03:55,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147784430] [2020-01-16 19:03:55,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:55,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:55,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527856625] [2020-01-16 19:03:55,039 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:55,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:55,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:55,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:55,039 INFO L87 Difference]: Start difference. First operand 384 states and 1331 transitions. Second operand 9 states. [2020-01-16 19:03:55,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:55,155 INFO L93 Difference]: Finished difference Result 580 states and 1722 transitions. [2020-01-16 19:03:55,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:55,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:55,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:55,157 INFO L225 Difference]: With dead ends: 580 [2020-01-16 19:03:55,157 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:03:55,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:03:55,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 381. [2020-01-16 19:03:55,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:03:55,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1326 transitions. [2020-01-16 19:03:55,166 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1326 transitions. Word has length 22 [2020-01-16 19:03:55,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:55,166 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1326 transitions. [2020-01-16 19:03:55,166 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:55,166 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1326 transitions. [2020-01-16 19:03:55,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:55,167 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:55,167 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:55,167 INFO L426 AbstractCegarLoop]: === Iteration 733 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:55,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:55,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1517608006, now seen corresponding path program 727 times [2020-01-16 19:03:55,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:55,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911812381] [2020-01-16 19:03:55,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:55,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911812381] [2020-01-16 19:03:55,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:55,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:55,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807171965] [2020-01-16 19:03:55,446 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:55,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:55,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:55,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:55,446 INFO L87 Difference]: Start difference. First operand 381 states and 1326 transitions. Second operand 9 states. [2020-01-16 19:03:55,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:55,560 INFO L93 Difference]: Finished difference Result 601 states and 1771 transitions. [2020-01-16 19:03:55,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:55,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:55,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:55,569 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:03:55,569 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 19:03:55,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:55,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 19:03:55,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 388. [2020-01-16 19:03:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:03:55,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1342 transitions. [2020-01-16 19:03:55,578 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1342 transitions. Word has length 22 [2020-01-16 19:03:55,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:55,578 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1342 transitions. [2020-01-16 19:03:55,578 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1342 transitions. [2020-01-16 19:03:55,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:55,578 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:55,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, 1, 1, 1] [2020-01-16 19:03:55,579 INFO L426 AbstractCegarLoop]: === Iteration 734 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:55,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:55,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1187093404, now seen corresponding path program 728 times [2020-01-16 19:03:55,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:55,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124019771] [2020-01-16 19:03:55,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:55,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-01-16 19:03:55,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124019771] [2020-01-16 19:03:55,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:55,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:55,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782552262] [2020-01-16 19:03:55,855 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:55,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:55,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:55,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:55,856 INFO L87 Difference]: Start difference. First operand 388 states and 1342 transitions. Second operand 9 states. [2020-01-16 19:03:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:55,968 INFO L93 Difference]: Finished difference Result 596 states and 1758 transitions. [2020-01-16 19:03:55,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:55,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:55,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:55,970 INFO L225 Difference]: With dead ends: 596 [2020-01-16 19:03:55,970 INFO L226 Difference]: Without dead ends: 581 [2020-01-16 19:03:55,971 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:55,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-01-16 19:03:55,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 384. [2020-01-16 19:03:55,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:03:55,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1333 transitions. [2020-01-16 19:03:55,980 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1333 transitions. Word has length 22 [2020-01-16 19:03:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:55,980 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1333 transitions. [2020-01-16 19:03:55,980 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1333 transitions. [2020-01-16 19:03:55,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:55,981 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:55,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, 1, 1, 1] [2020-01-16 19:03:55,981 INFO L426 AbstractCegarLoop]: === Iteration 735 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:55,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:55,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1618520178, now seen corresponding path program 729 times [2020-01-16 19:03:55,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:55,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687273724] [2020-01-16 19:03:55,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:56,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-01-16 19:03:56,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687273724] [2020-01-16 19:03:56,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:56,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:56,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971066355] [2020-01-16 19:03:56,274 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:56,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:56,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:56,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:56,274 INFO L87 Difference]: Start difference. First operand 384 states and 1333 transitions. Second operand 9 states. [2020-01-16 19:03:56,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:56,363 INFO L93 Difference]: Finished difference Result 599 states and 1763 transitions. [2020-01-16 19:03:56,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:56,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:56,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:56,365 INFO L225 Difference]: With dead ends: 599 [2020-01-16 19:03:56,365 INFO L226 Difference]: Without dead ends: 583 [2020-01-16 19:03:56,366 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:56,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-01-16 19:03:56,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 387. [2020-01-16 19:03:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:03:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1337 transitions. [2020-01-16 19:03:56,375 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1337 transitions. Word has length 22 [2020-01-16 19:03:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:56,375 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1337 transitions. [2020-01-16 19:03:56,375 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1337 transitions. [2020-01-16 19:03:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:56,376 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:56,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, 1, 1, 1] [2020-01-16 19:03:56,376 INFO L426 AbstractCegarLoop]: === Iteration 736 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:56,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:56,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1745156552, now seen corresponding path program 730 times [2020-01-16 19:03:56,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:56,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448772375] [2020-01-16 19:03:56,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:56,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-01-16 19:03:56,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448772375] [2020-01-16 19:03:56,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:56,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:56,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886652258] [2020-01-16 19:03:56,664 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:56,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:56,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:56,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:56,665 INFO L87 Difference]: Start difference. First operand 387 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:03:56,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:56,770 INFO L93 Difference]: Finished difference Result 593 states and 1749 transitions. [2020-01-16 19:03:56,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:56,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:56,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:56,772 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:03:56,772 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:03:56,772 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:56,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:03:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 384. [2020-01-16 19:03:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:03:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1330 transitions. [2020-01-16 19:03:56,788 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1330 transitions. Word has length 22 [2020-01-16 19:03:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:56,788 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1330 transitions. [2020-01-16 19:03:56,788 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:56,788 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1330 transitions. [2020-01-16 19:03:56,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:56,788 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:56,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, 1, 1, 1] [2020-01-16 19:03:56,789 INFO L426 AbstractCegarLoop]: === Iteration 737 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:56,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:56,789 INFO L82 PathProgramCache]: Analyzing trace with hash -669861616, now seen corresponding path program 731 times [2020-01-16 19:03:56,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:56,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779269501] [2020-01-16 19:03:56,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:57,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:57,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779269501] [2020-01-16 19:03:57,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:57,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:57,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591855594] [2020-01-16 19:03:57,066 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:57,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:57,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:57,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:57,066 INFO L87 Difference]: Start difference. First operand 384 states and 1330 transitions. Second operand 9 states. [2020-01-16 19:03:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:57,169 INFO L93 Difference]: Finished difference Result 588 states and 1740 transitions. [2020-01-16 19:03:57,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:57,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:57,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:57,171 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:03:57,171 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:03:57,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:03:57,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 386. [2020-01-16 19:03:57,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1333 transitions. [2020-01-16 19:03:57,180 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1333 transitions. Word has length 22 [2020-01-16 19:03:57,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:57,180 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1333 transitions. [2020-01-16 19:03:57,180 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:57,180 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1333 transitions. [2020-01-16 19:03:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:57,181 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:57,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, 1, 1, 1] [2020-01-16 19:03:57,181 INFO L426 AbstractCegarLoop]: === Iteration 738 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:57,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:57,181 INFO L82 PathProgramCache]: Analyzing trace with hash 672071172, now seen corresponding path program 732 times [2020-01-16 19:03:57,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:57,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528273400] [2020-01-16 19:03:57,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:57,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-01-16 19:03:57,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528273400] [2020-01-16 19:03:57,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:57,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:57,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860373816] [2020-01-16 19:03:57,465 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:57,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:57,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:57,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:57,466 INFO L87 Difference]: Start difference. First operand 386 states and 1333 transitions. Second operand 9 states. [2020-01-16 19:03:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:57,586 INFO L93 Difference]: Finished difference Result 587 states and 1736 transitions. [2020-01-16 19:03:57,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:57,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:57,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:57,588 INFO L225 Difference]: With dead ends: 587 [2020-01-16 19:03:57,588 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:03:57,588 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:57,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:03:57,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 381. [2020-01-16 19:03:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:03:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1324 transitions. [2020-01-16 19:03:57,598 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1324 transitions. Word has length 22 [2020-01-16 19:03:57,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:57,598 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1324 transitions. [2020-01-16 19:03:57,598 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:57,598 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1324 transitions. [2020-01-16 19:03:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:57,598 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:57,599 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:57,599 INFO L426 AbstractCegarLoop]: === Iteration 739 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:57,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:57,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1020911148, now seen corresponding path program 733 times [2020-01-16 19:03:57,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:57,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910122418] [2020-01-16 19:03:57,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:57,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-01-16 19:03:57,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910122418] [2020-01-16 19:03:57,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:57,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:57,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734336279] [2020-01-16 19:03:57,881 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:57,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:57,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:57,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:57,882 INFO L87 Difference]: Start difference. First operand 381 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:03:57,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:57,979 INFO L93 Difference]: Finished difference Result 591 states and 1742 transitions. [2020-01-16 19:03:57,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:57,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:57,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:57,980 INFO L225 Difference]: With dead ends: 591 [2020-01-16 19:03:57,981 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:03:57,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:57,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:03:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 385. [2020-01-16 19:03:57,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:03:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1332 transitions. [2020-01-16 19:03:57,990 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1332 transitions. Word has length 22 [2020-01-16 19:03:57,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:57,990 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1332 transitions. [2020-01-16 19:03:57,990 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1332 transitions. [2020-01-16 19:03:57,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:57,990 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:57,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, 1, 1, 1] [2020-01-16 19:03:57,991 INFO L426 AbstractCegarLoop]: === Iteration 740 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:57,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:57,991 INFO L82 PathProgramCache]: Analyzing trace with hash -459842656, now seen corresponding path program 734 times [2020-01-16 19:03:57,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:57,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742071937] [2020-01-16 19:03:57,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:58,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-01-16 19:03:58,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742071937] [2020-01-16 19:03:58,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:58,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:58,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894286285] [2020-01-16 19:03:58,303 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:58,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:58,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:58,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:58,303 INFO L87 Difference]: Start difference. First operand 385 states and 1332 transitions. Second operand 9 states. [2020-01-16 19:03:58,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:58,380 INFO L93 Difference]: Finished difference Result 584 states and 1727 transitions. [2020-01-16 19:03:58,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:58,381 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:58,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:58,382 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:03:58,382 INFO L226 Difference]: Without dead ends: 573 [2020-01-16 19:03:58,383 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:58,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-01-16 19:03:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 383. [2020-01-16 19:03:58,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:03:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1328 transitions. [2020-01-16 19:03:58,391 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1328 transitions. Word has length 22 [2020-01-16 19:03:58,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:58,392 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1328 transitions. [2020-01-16 19:03:58,392 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:58,392 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1328 transitions. [2020-01-16 19:03:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:58,392 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:58,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, 1, 1, 1] [2020-01-16 19:03:58,392 INFO L426 AbstractCegarLoop]: === Iteration 741 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:58,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:58,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1673618294, now seen corresponding path program 735 times [2020-01-16 19:03:58,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:58,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759923346] [2020-01-16 19:03:58,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:58,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:58,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759923346] [2020-01-16 19:03:58,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:58,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:58,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128097034] [2020-01-16 19:03:58,694 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:58,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:58,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:58,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:58,694 INFO L87 Difference]: Start difference. First operand 383 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:03:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:58,771 INFO L93 Difference]: Finished difference Result 593 states and 1745 transitions. [2020-01-16 19:03:58,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:58,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:58,773 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:03:58,773 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:03:58,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:58,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:03:58,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 386. [2020-01-16 19:03:58,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:03:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1332 transitions. [2020-01-16 19:03:58,782 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1332 transitions. Word has length 22 [2020-01-16 19:03:58,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:58,782 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1332 transitions. [2020-01-16 19:03:58,783 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:58,783 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1332 transitions. [2020-01-16 19:03:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:58,783 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:58,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, 1, 1, 1] [2020-01-16 19:03:58,783 INFO L426 AbstractCegarLoop]: === Iteration 742 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:58,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:58,784 INFO L82 PathProgramCache]: Analyzing trace with hash 711414632, now seen corresponding path program 736 times [2020-01-16 19:03:58,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:58,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418760943] [2020-01-16 19:03:58,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:59,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418760943] [2020-01-16 19:03:59,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:59,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:59,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921449821] [2020-01-16 19:03:59,090 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:59,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:59,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:59,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:59,091 INFO L87 Difference]: Start difference. First operand 386 states and 1332 transitions. Second operand 9 states. [2020-01-16 19:03:59,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:59,196 INFO L93 Difference]: Finished difference Result 587 states and 1731 transitions. [2020-01-16 19:03:59,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:59,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:59,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:59,198 INFO L225 Difference]: With dead ends: 587 [2020-01-16 19:03:59,198 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:03:59,198 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:59,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:03:59,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 383. [2020-01-16 19:03:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:03:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1326 transitions. [2020-01-16 19:03:59,207 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1326 transitions. Word has length 22 [2020-01-16 19:03:59,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:59,207 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1326 transitions. [2020-01-16 19:03:59,207 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:59,207 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1326 transitions. [2020-01-16 19:03:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:59,208 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:59,208 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:59,208 INFO L426 AbstractCegarLoop]: === Iteration 743 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:59,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:59,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1728340520, now seen corresponding path program 737 times [2020-01-16 19:03:59,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:59,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24143251] [2020-01-16 19:03:59,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:59,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24143251] [2020-01-16 19:03:59,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:59,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:59,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653013901] [2020-01-16 19:03:59,514 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:59,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:59,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:59,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:59,514 INFO L87 Difference]: Start difference. First operand 383 states and 1326 transitions. Second operand 9 states. [2020-01-16 19:03:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:03:59,603 INFO L93 Difference]: Finished difference Result 577 states and 1712 transitions. [2020-01-16 19:03:59,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:03:59,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:03:59,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:03:59,605 INFO L225 Difference]: With dead ends: 577 [2020-01-16 19:03:59,605 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:03:59,605 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:03:59,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:03:59,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 384. [2020-01-16 19:03:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:03:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1327 transitions. [2020-01-16 19:03:59,615 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1327 transitions. Word has length 22 [2020-01-16 19:03:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:03:59,615 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1327 transitions. [2020-01-16 19:03:59,615 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:03:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1327 transitions. [2020-01-16 19:03:59,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:03:59,616 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:03:59,616 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:03:59,616 INFO L426 AbstractCegarLoop]: === Iteration 744 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:03:59,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:03:59,616 INFO L82 PathProgramCache]: Analyzing trace with hash -955685818, now seen corresponding path program 738 times [2020-01-16 19:03:59,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:03:59,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550857287] [2020-01-16 19:03:59,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:03:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:03:59,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:03:59,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550857287] [2020-01-16 19:03:59,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:03:59,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:03:59,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168062875] [2020-01-16 19:03:59,913 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:03:59,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:03:59,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:03:59,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:03:59,914 INFO L87 Difference]: Start difference. First operand 384 states and 1327 transitions. Second operand 9 states. [2020-01-16 19:04:00,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:00,018 INFO L93 Difference]: Finished difference Result 578 states and 1713 transitions. [2020-01-16 19:04:00,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:00,019 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:00,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:00,020 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:04:00,020 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:04:00,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:00,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:04:00,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 381. [2020-01-16 19:04:00,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:04:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1322 transitions. [2020-01-16 19:04:00,029 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1322 transitions. Word has length 22 [2020-01-16 19:04:00,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:00,029 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1322 transitions. [2020-01-16 19:04:00,029 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:00,029 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1322 transitions. [2020-01-16 19:04:00,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:00,030 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:00,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, 1, 1, 1] [2020-01-16 19:04:00,030 INFO L426 AbstractCegarLoop]: === Iteration 745 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:00,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:00,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1636866802, now seen corresponding path program 739 times [2020-01-16 19:04:00,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:00,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765385185] [2020-01-16 19:04:00,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:00,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-01-16 19:04:00,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765385185] [2020-01-16 19:04:00,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:00,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:00,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362125396] [2020-01-16 19:04:00,332 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:00,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:00,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:00,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:00,333 INFO L87 Difference]: Start difference. First operand 381 states and 1322 transitions. Second operand 9 states. [2020-01-16 19:04:00,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:00,435 INFO L93 Difference]: Finished difference Result 572 states and 1704 transitions. [2020-01-16 19:04:00,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:00,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:00,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:00,437 INFO L225 Difference]: With dead ends: 572 [2020-01-16 19:04:00,437 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:04:00,437 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:00,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:04:00,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 383. [2020-01-16 19:04:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:04:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1326 transitions. [2020-01-16 19:04:00,447 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1326 transitions. Word has length 22 [2020-01-16 19:04:00,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:00,447 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1326 transitions. [2020-01-16 19:04:00,447 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1326 transitions. [2020-01-16 19:04:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:00,448 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:00,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, 1, 1, 1] [2020-01-16 19:04:00,448 INFO L426 AbstractCegarLoop]: === Iteration 746 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:00,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:00,448 INFO L82 PathProgramCache]: Analyzing trace with hash 191349792, now seen corresponding path program 740 times [2020-01-16 19:04:00,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:00,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404392283] [2020-01-16 19:04:00,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:00,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404392283] [2020-01-16 19:04:00,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:00,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:00,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003403470] [2020-01-16 19:04:00,742 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:00,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:00,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:00,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:00,743 INFO L87 Difference]: Start difference. First operand 383 states and 1326 transitions. Second operand 9 states. [2020-01-16 19:04:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:00,822 INFO L93 Difference]: Finished difference Result 570 states and 1699 transitions. [2020-01-16 19:04:00,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:00,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:00,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:00,824 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:04:00,824 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:04:00,824 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:00,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:04:00,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-01-16 19:04:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1324 transitions. [2020-01-16 19:04:00,834 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1324 transitions. Word has length 22 [2020-01-16 19:04:00,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:00,834 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1324 transitions. [2020-01-16 19:04:00,834 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:00,834 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1324 transitions. [2020-01-16 19:04:00,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:00,834 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:00,834 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:00,835 INFO L426 AbstractCegarLoop]: === Iteration 747 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:00,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:00,835 INFO L82 PathProgramCache]: Analyzing trace with hash 36428948, now seen corresponding path program 741 times [2020-01-16 19:04:00,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:00,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179344518] [2020-01-16 19:04:00,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:01,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-01-16 19:04:01,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179344518] [2020-01-16 19:04:01,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:01,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:01,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657622356] [2020-01-16 19:04:01,153 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:01,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:01,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:01,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:01,153 INFO L87 Difference]: Start difference. First operand 382 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:04:01,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:01,254 INFO L93 Difference]: Finished difference Result 574 states and 1708 transitions. [2020-01-16 19:04:01,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:01,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:01,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:01,256 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:04:01,256 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:04:01,256 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:01,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:04:01,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 384. [2020-01-16 19:04:01,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:04:01,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1327 transitions. [2020-01-16 19:04:01,265 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1327 transitions. Word has length 22 [2020-01-16 19:04:01,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:01,265 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1327 transitions. [2020-01-16 19:04:01,265 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:01,265 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1327 transitions. [2020-01-16 19:04:01,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:01,265 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:01,266 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:01,266 INFO L426 AbstractCegarLoop]: === Iteration 748 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:01,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:01,266 INFO L82 PathProgramCache]: Analyzing trace with hash 289521700, now seen corresponding path program 742 times [2020-01-16 19:04:01,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:01,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096889938] [2020-01-16 19:04:01,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:01,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-01-16 19:04:01,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096889938] [2020-01-16 19:04:01,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:01,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:01,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897472625] [2020-01-16 19:04:01,564 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:01,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:01,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:01,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:01,565 INFO L87 Difference]: Start difference. First operand 384 states and 1327 transitions. Second operand 9 states. [2020-01-16 19:04:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:01,682 INFO L93 Difference]: Finished difference Result 573 states and 1704 transitions. [2020-01-16 19:04:01,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:01,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:01,684 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:04:01,684 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:04:01,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:01,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:04:01,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 382. [2020-01-16 19:04:01,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1323 transitions. [2020-01-16 19:04:01,693 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1323 transitions. Word has length 22 [2020-01-16 19:04:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:01,693 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1323 transitions. [2020-01-16 19:04:01,693 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1323 transitions. [2020-01-16 19:04:01,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:01,693 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:01,694 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:01,694 INFO L426 AbstractCegarLoop]: === Iteration 749 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:01,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:01,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1285441380, now seen corresponding path program 743 times [2020-01-16 19:04:01,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:01,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698433558] [2020-01-16 19:04:01,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:01,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-01-16 19:04:01,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698433558] [2020-01-16 19:04:01,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:01,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:01,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180441529] [2020-01-16 19:04:01,997 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:01,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:01,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:01,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:01,997 INFO L87 Difference]: Start difference. First operand 382 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:04:02,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:02,073 INFO L93 Difference]: Finished difference Result 569 states and 1696 transitions. [2020-01-16 19:04:02,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:02,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:02,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:02,075 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:04:02,075 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:04:02,075 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:02,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:04:02,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 383. [2020-01-16 19:04:02,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:04:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1324 transitions. [2020-01-16 19:04:02,084 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1324 transitions. Word has length 22 [2020-01-16 19:04:02,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:02,084 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1324 transitions. [2020-01-16 19:04:02,084 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:02,085 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1324 transitions. [2020-01-16 19:04:02,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:02,085 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:02,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, 1, 1, 1] [2020-01-16 19:04:02,085 INFO L426 AbstractCegarLoop]: === Iteration 750 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:02,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:02,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1398584958, now seen corresponding path program 744 times [2020-01-16 19:04:02,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:02,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303531257] [2020-01-16 19:04:02,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:02,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-01-16 19:04:02,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303531257] [2020-01-16 19:04:02,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:02,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:02,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764648916] [2020-01-16 19:04:02,380 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:02,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:02,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:02,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:02,381 INFO L87 Difference]: Start difference. First operand 383 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:04:02,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:02,483 INFO L93 Difference]: Finished difference Result 570 states and 1697 transitions. [2020-01-16 19:04:02,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:02,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:02,485 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:04:02,485 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:04:02,485 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:02,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:04:02,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 379. [2020-01-16 19:04:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:04:02,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1318 transitions. [2020-01-16 19:04:02,493 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1318 transitions. Word has length 22 [2020-01-16 19:04:02,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:02,494 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1318 transitions. [2020-01-16 19:04:02,494 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:02,494 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1318 transitions. [2020-01-16 19:04:02,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:02,494 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:02,494 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:02,494 INFO L426 AbstractCegarLoop]: === Iteration 751 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:02,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:02,495 INFO L82 PathProgramCache]: Analyzing trace with hash -869784238, now seen corresponding path program 745 times [2020-01-16 19:04:02,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:02,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467446612] [2020-01-16 19:04:02,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:02,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-01-16 19:04:02,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467446612] [2020-01-16 19:04:02,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:02,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:02,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699522379] [2020-01-16 19:04:02,785 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:02,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:02,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:02,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:02,786 INFO L87 Difference]: Start difference. First operand 379 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:04:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:02,864 INFO L93 Difference]: Finished difference Result 611 states and 1794 transitions. [2020-01-16 19:04:02,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:02,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:02,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:02,866 INFO L225 Difference]: With dead ends: 611 [2020-01-16 19:04:02,866 INFO L226 Difference]: Without dead ends: 595 [2020-01-16 19:04:02,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-01-16 19:04:02,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 388. [2020-01-16 19:04:02,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:04:02,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1341 transitions. [2020-01-16 19:04:02,875 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1341 transitions. Word has length 22 [2020-01-16 19:04:02,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:02,876 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1341 transitions. [2020-01-16 19:04:02,876 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:02,876 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1341 transitions. [2020-01-16 19:04:02,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:02,876 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:02,876 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:02,876 INFO L426 AbstractCegarLoop]: === Iteration 752 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:02,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:02,877 INFO L82 PathProgramCache]: Analyzing trace with hash 720481648, now seen corresponding path program 746 times [2020-01-16 19:04:02,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:02,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770197472] [2020-01-16 19:04:02,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:03,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770197472] [2020-01-16 19:04:03,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:03,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:03,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918748024] [2020-01-16 19:04:03,160 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:03,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:03,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:03,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:03,160 INFO L87 Difference]: Start difference. First operand 388 states and 1341 transitions. Second operand 9 states. [2020-01-16 19:04:03,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:03,261 INFO L93 Difference]: Finished difference Result 606 states and 1781 transitions. [2020-01-16 19:04:03,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:03,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:03,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:03,262 INFO L225 Difference]: With dead ends: 606 [2020-01-16 19:04:03,263 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 19:04:03,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:03,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 19:04:03,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 384. [2020-01-16 19:04:03,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:04:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1333 transitions. [2020-01-16 19:04:03,271 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1333 transitions. Word has length 22 [2020-01-16 19:04:03,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:03,271 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1333 transitions. [2020-01-16 19:04:03,272 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:03,272 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1333 transitions. [2020-01-16 19:04:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:03,272 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:03,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, 1, 1, 1] [2020-01-16 19:04:03,272 INFO L426 AbstractCegarLoop]: === Iteration 753 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:03,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:03,272 INFO L82 PathProgramCache]: Analyzing trace with hash 482766082, now seen corresponding path program 747 times [2020-01-16 19:04:03,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:03,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506411445] [2020-01-16 19:04:03,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:03,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506411445] [2020-01-16 19:04:03,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:03,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:03,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429876959] [2020-01-16 19:04:03,556 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:03,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:03,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:03,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:03,556 INFO L87 Difference]: Start difference. First operand 384 states and 1333 transitions. Second operand 9 states. [2020-01-16 19:04:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:03,635 INFO L93 Difference]: Finished difference Result 607 states and 1782 transitions. [2020-01-16 19:04:03,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:03,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:03,637 INFO L225 Difference]: With dead ends: 607 [2020-01-16 19:04:03,637 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 19:04:03,637 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 19:04:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 386. [2020-01-16 19:04:03,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:04:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-01-16 19:04:03,646 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-01-16 19:04:03,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:03,646 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-01-16 19:04:03,646 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-01-16 19:04:03,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:03,647 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:03,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, 1, 1, 1] [2020-01-16 19:04:03,647 INFO L426 AbstractCegarLoop]: === Iteration 754 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:03,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:03,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1043834574, now seen corresponding path program 748 times [2020-01-16 19:04:03,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:03,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314450030] [2020-01-16 19:04:03,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:03,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314450030] [2020-01-16 19:04:03,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:03,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:03,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040747000] [2020-01-16 19:04:03,933 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:03,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:03,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:03,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:03,934 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:04:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:04,023 INFO L93 Difference]: Finished difference Result 600 states and 1767 transitions. [2020-01-16 19:04:04,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:04,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:04,025 INFO L225 Difference]: With dead ends: 600 [2020-01-16 19:04:04,025 INFO L226 Difference]: Without dead ends: 589 [2020-01-16 19:04:04,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-01-16 19:04:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 384. [2020-01-16 19:04:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:04:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1331 transitions. [2020-01-16 19:04:04,034 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1331 transitions. Word has length 22 [2020-01-16 19:04:04,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:04,034 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1331 transitions. [2020-01-16 19:04:04,034 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:04,034 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1331 transitions. [2020-01-16 19:04:04,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:04,035 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:04,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, 1, 1, 1] [2020-01-16 19:04:04,035 INFO L426 AbstractCegarLoop]: === Iteration 755 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:04,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:04,035 INFO L82 PathProgramCache]: Analyzing trace with hash -711524124, now seen corresponding path program 749 times [2020-01-16 19:04:04,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:04,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106228981] [2020-01-16 19:04:04,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:04,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-01-16 19:04:04,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106228981] [2020-01-16 19:04:04,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:04,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:04,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977314470] [2020-01-16 19:04:04,318 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:04,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:04,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:04,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:04,319 INFO L87 Difference]: Start difference. First operand 384 states and 1331 transitions. Second operand 9 states. [2020-01-16 19:04:04,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:04,418 INFO L93 Difference]: Finished difference Result 596 states and 1760 transitions. [2020-01-16 19:04:04,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:04,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:04,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:04,420 INFO L225 Difference]: With dead ends: 596 [2020-01-16 19:04:04,420 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 19:04:04,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:04,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 19:04:04,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 385. [2020-01-16 19:04:04,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:04:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1332 transitions. [2020-01-16 19:04:04,430 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1332 transitions. Word has length 22 [2020-01-16 19:04:04,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:04,430 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1332 transitions. [2020-01-16 19:04:04,430 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1332 transitions. [2020-01-16 19:04:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:04,431 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:04,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, 1, 1, 1] [2020-01-16 19:04:04,431 INFO L426 AbstractCegarLoop]: === Iteration 756 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:04,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:04,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2137926162, now seen corresponding path program 750 times [2020-01-16 19:04:04,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:04,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493064211] [2020-01-16 19:04:04,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:04,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-01-16 19:04:04,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493064211] [2020-01-16 19:04:04,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:04,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:04,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087468602] [2020-01-16 19:04:04,724 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:04,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:04,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:04,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:04,725 INFO L87 Difference]: Start difference. First operand 385 states and 1332 transitions. Second operand 9 states. [2020-01-16 19:04:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:04,803 INFO L93 Difference]: Finished difference Result 594 states and 1755 transitions. [2020-01-16 19:04:04,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:04,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:04,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:04,805 INFO L225 Difference]: With dead ends: 594 [2020-01-16 19:04:04,805 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 19:04:04,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:04,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 19:04:04,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 382. [2020-01-16 19:04:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1327 transitions. [2020-01-16 19:04:04,814 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1327 transitions. Word has length 22 [2020-01-16 19:04:04,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:04,814 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1327 transitions. [2020-01-16 19:04:04,814 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:04,814 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1327 transitions. [2020-01-16 19:04:04,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:04,815 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:04,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, 1, 1, 1] [2020-01-16 19:04:04,815 INFO L426 AbstractCegarLoop]: === Iteration 757 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:04,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:04,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1665130118, now seen corresponding path program 751 times [2020-01-16 19:04:04,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:04,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783283037] [2020-01-16 19:04:04,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:05,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-01-16 19:04:05,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783283037] [2020-01-16 19:04:05,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:05,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:05,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179371654] [2020-01-16 19:04:05,109 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:05,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:05,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:05,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:05,110 INFO L87 Difference]: Start difference. First operand 382 states and 1327 transitions. Second operand 9 states. [2020-01-16 19:04:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:05,186 INFO L93 Difference]: Finished difference Result 627 states and 1834 transitions. [2020-01-16 19:04:05,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:05,187 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:05,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:05,188 INFO L225 Difference]: With dead ends: 627 [2020-01-16 19:04:05,188 INFO L226 Difference]: Without dead ends: 611 [2020-01-16 19:04:05,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:05,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-01-16 19:04:05,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 391. [2020-01-16 19:04:05,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:04:05,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1349 transitions. [2020-01-16 19:04:05,198 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1349 transitions. Word has length 22 [2020-01-16 19:04:05,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:05,198 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1349 transitions. [2020-01-16 19:04:05,198 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:05,198 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1349 transitions. [2020-01-16 19:04:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:05,199 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:05,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, 1, 1, 1] [2020-01-16 19:04:05,199 INFO L426 AbstractCegarLoop]: === Iteration 758 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:05,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:05,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1039571292, now seen corresponding path program 752 times [2020-01-16 19:04:05,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:05,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178820915] [2020-01-16 19:04:05,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:05,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-01-16 19:04:05,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178820915] [2020-01-16 19:04:05,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:05,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:05,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087514969] [2020-01-16 19:04:05,486 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:05,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:05,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:05,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:05,486 INFO L87 Difference]: Start difference. First operand 391 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:04:05,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:05,587 INFO L93 Difference]: Finished difference Result 622 states and 1821 transitions. [2020-01-16 19:04:05,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:05,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:05,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:05,589 INFO L225 Difference]: With dead ends: 622 [2020-01-16 19:04:05,589 INFO L226 Difference]: Without dead ends: 607 [2020-01-16 19:04:05,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:05,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-01-16 19:04:05,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 387. [2020-01-16 19:04:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:04:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1339 transitions. [2020-01-16 19:04:05,598 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1339 transitions. Word has length 22 [2020-01-16 19:04:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:05,598 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1339 transitions. [2020-01-16 19:04:05,598 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:05,598 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1339 transitions. [2020-01-16 19:04:05,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:05,599 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:05,599 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:05,599 INFO L426 AbstractCegarLoop]: === Iteration 759 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:05,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:05,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1930180982, now seen corresponding path program 753 times [2020-01-16 19:04:05,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:05,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778469660] [2020-01-16 19:04:05,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:05,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778469660] [2020-01-16 19:04:05,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:05,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:05,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368845458] [2020-01-16 19:04:05,900 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:05,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:05,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:05,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:05,901 INFO L87 Difference]: Start difference. First operand 387 states and 1339 transitions. Second operand 9 states. [2020-01-16 19:04:05,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:05,978 INFO L93 Difference]: Finished difference Result 634 states and 1846 transitions. [2020-01-16 19:04:05,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:05,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:05,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:05,980 INFO L225 Difference]: With dead ends: 634 [2020-01-16 19:04:05,980 INFO L226 Difference]: Without dead ends: 618 [2020-01-16 19:04:05,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:05,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-01-16 19:04:05,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 395. [2020-01-16 19:04:05,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:04:05,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1352 transitions. [2020-01-16 19:04:05,990 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1352 transitions. Word has length 22 [2020-01-16 19:04:05,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:05,990 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1352 transitions. [2020-01-16 19:04:05,990 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:05,990 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1352 transitions. [2020-01-16 19:04:05,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:05,991 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:05,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, 1, 1, 1] [2020-01-16 19:04:05,991 INFO L426 AbstractCegarLoop]: === Iteration 760 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:05,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:05,991 INFO L82 PathProgramCache]: Analyzing trace with hash 432609432, now seen corresponding path program 754 times [2020-01-16 19:04:05,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:05,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703721947] [2020-01-16 19:04:05,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:06,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703721947] [2020-01-16 19:04:06,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:06,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:06,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569083565] [2020-01-16 19:04:06,295 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:06,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:06,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:06,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:06,296 INFO L87 Difference]: Start difference. First operand 395 states and 1352 transitions. Second operand 9 states. [2020-01-16 19:04:06,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:06,405 INFO L93 Difference]: Finished difference Result 632 states and 1836 transitions. [2020-01-16 19:04:06,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:06,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:06,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:06,407 INFO L225 Difference]: With dead ends: 632 [2020-01-16 19:04:06,407 INFO L226 Difference]: Without dead ends: 610 [2020-01-16 19:04:06,407 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:06,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-01-16 19:04:06,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 387. [2020-01-16 19:04:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:04:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1334 transitions. [2020-01-16 19:04:06,416 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1334 transitions. Word has length 22 [2020-01-16 19:04:06,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:06,416 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1334 transitions. [2020-01-16 19:04:06,416 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:06,416 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1334 transitions. [2020-01-16 19:04:06,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:06,417 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:06,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, 1, 1, 1] [2020-01-16 19:04:06,417 INFO L426 AbstractCegarLoop]: === Iteration 761 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:06,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:06,417 INFO L82 PathProgramCache]: Analyzing trace with hash 714884568, now seen corresponding path program 755 times [2020-01-16 19:04:06,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:06,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278313067] [2020-01-16 19:04:06,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:06,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-01-16 19:04:06,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278313067] [2020-01-16 19:04:06,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:06,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:06,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168313015] [2020-01-16 19:04:06,731 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:06,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:06,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:06,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:06,731 INFO L87 Difference]: Start difference. First operand 387 states and 1334 transitions. Second operand 9 states. [2020-01-16 19:04:06,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:06,833 INFO L93 Difference]: Finished difference Result 619 states and 1811 transitions. [2020-01-16 19:04:06,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:06,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:06,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:06,835 INFO L225 Difference]: With dead ends: 619 [2020-01-16 19:04:06,835 INFO L226 Difference]: Without dead ends: 608 [2020-01-16 19:04:06,835 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:06,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-01-16 19:04:06,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 390. [2020-01-16 19:04:06,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:04:06,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1339 transitions. [2020-01-16 19:04:06,845 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1339 transitions. Word has length 22 [2020-01-16 19:04:06,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:06,845 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1339 transitions. [2020-01-16 19:04:06,845 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1339 transitions. [2020-01-16 19:04:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:06,846 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:06,846 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:06,846 INFO L426 AbstractCegarLoop]: === Iteration 762 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:06,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:06,846 INFO L82 PathProgramCache]: Analyzing trace with hash 733318594, now seen corresponding path program 756 times [2020-01-16 19:04:06,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:06,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973847605] [2020-01-16 19:04:06,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:07,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:07,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973847605] [2020-01-16 19:04:07,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:07,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:07,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091025049] [2020-01-16 19:04:07,140 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:07,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:07,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:07,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:07,140 INFO L87 Difference]: Start difference. First operand 390 states and 1339 transitions. Second operand 9 states. [2020-01-16 19:04:07,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:07,243 INFO L93 Difference]: Finished difference Result 622 states and 1814 transitions. [2020-01-16 19:04:07,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:07,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:07,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:07,245 INFO L225 Difference]: With dead ends: 622 [2020-01-16 19:04:07,245 INFO L226 Difference]: Without dead ends: 600 [2020-01-16 19:04:07,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:07,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-01-16 19:04:07,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 382. [2020-01-16 19:04:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:07,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1324 transitions. [2020-01-16 19:04:07,255 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1324 transitions. Word has length 22 [2020-01-16 19:04:07,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:07,255 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1324 transitions. [2020-01-16 19:04:07,255 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1324 transitions. [2020-01-16 19:04:07,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:07,256 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:07,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, 1, 1, 1] [2020-01-16 19:04:07,256 INFO L426 AbstractCegarLoop]: === Iteration 763 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:07,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:07,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1470725694, now seen corresponding path program 757 times [2020-01-16 19:04:07,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:07,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761253767] [2020-01-16 19:04:07,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:07,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-01-16 19:04:07,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761253767] [2020-01-16 19:04:07,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:07,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:07,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221564052] [2020-01-16 19:04:07,537 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:07,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:07,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:07,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:07,537 INFO L87 Difference]: Start difference. First operand 382 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:04:07,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:07,613 INFO L93 Difference]: Finished difference Result 615 states and 1797 transitions. [2020-01-16 19:04:07,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:07,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:07,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:07,615 INFO L225 Difference]: With dead ends: 615 [2020-01-16 19:04:07,615 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 19:04:07,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:07,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 19:04:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 387. [2020-01-16 19:04:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:04:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1334 transitions. [2020-01-16 19:04:07,630 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1334 transitions. Word has length 22 [2020-01-16 19:04:07,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:07,630 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1334 transitions. [2020-01-16 19:04:07,630 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1334 transitions. [2020-01-16 19:04:07,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:07,631 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:07,631 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:07,631 INFO L426 AbstractCegarLoop]: === Iteration 764 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:07,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:07,631 INFO L82 PathProgramCache]: Analyzing trace with hash -909657202, now seen corresponding path program 758 times [2020-01-16 19:04:07,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:07,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707868909] [2020-01-16 19:04:07,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:07,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-01-16 19:04:07,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707868909] [2020-01-16 19:04:07,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:07,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:07,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392559795] [2020-01-16 19:04:07,910 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:07,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:07,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:07,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:07,911 INFO L87 Difference]: Start difference. First operand 387 states and 1334 transitions. Second operand 9 states. [2020-01-16 19:04:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:07,985 INFO L93 Difference]: Finished difference Result 608 states and 1782 transitions. [2020-01-16 19:04:07,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:07,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:07,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:07,987 INFO L225 Difference]: With dead ends: 608 [2020-01-16 19:04:07,987 INFO L226 Difference]: Without dead ends: 597 [2020-01-16 19:04:07,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:07,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-01-16 19:04:07,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 385. [2020-01-16 19:04:07,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:04:07,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1330 transitions. [2020-01-16 19:04:07,996 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1330 transitions. Word has length 22 [2020-01-16 19:04:07,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:07,996 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1330 transitions. [2020-01-16 19:04:07,996 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:07,996 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1330 transitions. [2020-01-16 19:04:07,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:07,997 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:07,997 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:07,997 INFO L426 AbstractCegarLoop]: === Iteration 765 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:07,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:07,997 INFO L82 PathProgramCache]: Analyzing trace with hash -458033162, now seen corresponding path program 759 times [2020-01-16 19:04:07,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:07,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224756377] [2020-01-16 19:04:07,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04: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-01-16 19:04:08,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224756377] [2020-01-16 19:04:08,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:08,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:08,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955692704] [2020-01-16 19:04:08,296 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:08,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:08,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:08,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:08,297 INFO L87 Difference]: Start difference. First operand 385 states and 1330 transitions. Second operand 9 states. [2020-01-16 19:04:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:08,374 INFO L93 Difference]: Finished difference Result 626 states and 1821 transitions. [2020-01-16 19:04:08,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:08,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:08,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:08,376 INFO L225 Difference]: With dead ends: 626 [2020-01-16 19:04:08,376 INFO L226 Difference]: Without dead ends: 610 [2020-01-16 19:04:08,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:08,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-01-16 19:04:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 393. [2020-01-16 19:04:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:04:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1343 transitions. [2020-01-16 19:04:08,386 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1343 transitions. Word has length 22 [2020-01-16 19:04:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:08,386 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1343 transitions. [2020-01-16 19:04:08,386 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1343 transitions. [2020-01-16 19:04:08,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:08,386 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:08,387 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:08,387 INFO L426 AbstractCegarLoop]: === Iteration 766 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:08,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:08,387 INFO L82 PathProgramCache]: Analyzing trace with hash -588003608, now seen corresponding path program 760 times [2020-01-16 19:04:08,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:08,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797006926] [2020-01-16 19:04:08,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:08,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-01-16 19:04:08,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797006926] [2020-01-16 19:04:08,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:08,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:08,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817437230] [2020-01-16 19:04:08,678 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:08,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:08,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:08,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:08,678 INFO L87 Difference]: Start difference. First operand 393 states and 1343 transitions. Second operand 9 states. [2020-01-16 19:04:08,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:08,781 INFO L93 Difference]: Finished difference Result 624 states and 1811 transitions. [2020-01-16 19:04:08,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:08,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:08,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:08,783 INFO L225 Difference]: With dead ends: 624 [2020-01-16 19:04:08,783 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:04:08,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:08,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:04:08,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 385. [2020-01-16 19:04:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:04:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1327 transitions. [2020-01-16 19:04:08,792 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1327 transitions. Word has length 22 [2020-01-16 19:04:08,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:08,792 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1327 transitions. [2020-01-16 19:04:08,792 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:08,792 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1327 transitions. [2020-01-16 19:04:08,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:08,792 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:08,792 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:08,792 INFO L426 AbstractCegarLoop]: === Iteration 767 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:08,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:08,793 INFO L82 PathProgramCache]: Analyzing trace with hash -403310936, now seen corresponding path program 761 times [2020-01-16 19:04:08,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:08,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301055511] [2020-01-16 19:04:08,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:09,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-01-16 19:04:09,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301055511] [2020-01-16 19:04:09,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:09,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:09,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511571251] [2020-01-16 19:04:09,083 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:09,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:09,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:09,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:09,083 INFO L87 Difference]: Start difference. First operand 385 states and 1327 transitions. Second operand 9 states. [2020-01-16 19:04:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:09,163 INFO L93 Difference]: Finished difference Result 605 states and 1774 transitions. [2020-01-16 19:04:09,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:09,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:09,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:09,165 INFO L225 Difference]: With dead ends: 605 [2020-01-16 19:04:09,165 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 19:04:09,166 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 19:04:09,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 386. [2020-01-16 19:04:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:04:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1328 transitions. [2020-01-16 19:04:09,175 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1328 transitions. Word has length 22 [2020-01-16 19:04:09,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:09,175 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1328 transitions. [2020-01-16 19:04:09,175 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:09,175 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1328 transitions. [2020-01-16 19:04:09,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:09,176 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:09,176 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:09,176 INFO L426 AbstractCegarLoop]: === Iteration 768 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:09,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:09,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1479022092, now seen corresponding path program 762 times [2020-01-16 19:04:09,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:09,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995179497] [2020-01-16 19:04:09,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:09,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995179497] [2020-01-16 19:04:09,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:09,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:09,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404747022] [2020-01-16 19:04:09,462 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:09,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:09,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:09,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:09,463 INFO L87 Difference]: Start difference. First operand 386 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:04:09,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:09,583 INFO L93 Difference]: Finished difference Result 610 states and 1783 transitions. [2020-01-16 19:04:09,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:09,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:09,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:09,585 INFO L225 Difference]: With dead ends: 610 [2020-01-16 19:04:09,585 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 19:04:09,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:09,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 19:04:09,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 382. [2020-01-16 19:04:09,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:09,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1321 transitions. [2020-01-16 19:04:09,595 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1321 transitions. Word has length 22 [2020-01-16 19:04:09,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:09,595 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1321 transitions. [2020-01-16 19:04:09,595 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:09,595 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1321 transitions. [2020-01-16 19:04:09,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:09,595 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:09,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, 1, 1, 1] [2020-01-16 19:04:09,595 INFO L426 AbstractCegarLoop]: === Iteration 769 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:09,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:09,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1187052256, now seen corresponding path program 763 times [2020-01-16 19:04:09,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:09,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789614247] [2020-01-16 19:04:09,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:09,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789614247] [2020-01-16 19:04:09,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:09,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:09,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839814927] [2020-01-16 19:04:09,880 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:09,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:09,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:09,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:09,881 INFO L87 Difference]: Start difference. First operand 382 states and 1321 transitions. Second operand 9 states. [2020-01-16 19:04:09,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:09,984 INFO L93 Difference]: Finished difference Result 591 states and 1746 transitions. [2020-01-16 19:04:09,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:09,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:09,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:09,986 INFO L225 Difference]: With dead ends: 591 [2020-01-16 19:04:09,986 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:04:09,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:10,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:04:10,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 384. [2020-01-16 19:04:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:04:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1325 transitions. [2020-01-16 19:04:10,005 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1325 transitions. Word has length 22 [2020-01-16 19:04:10,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:10,005 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1325 transitions. [2020-01-16 19:04:10,005 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1325 transitions. [2020-01-16 19:04:10,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:10,006 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:10,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, 1, 1, 1] [2020-01-16 19:04:10,006 INFO L426 AbstractCegarLoop]: === Iteration 770 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:10,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:10,006 INFO L82 PathProgramCache]: Analyzing trace with hash -258464754, now seen corresponding path program 764 times [2020-01-16 19:04:10,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:10,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489017942] [2020-01-16 19:04:10,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:10,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489017942] [2020-01-16 19:04:10,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:10,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:10,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888432094] [2020-01-16 19:04:10,297 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:10,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:10,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:10,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:10,297 INFO L87 Difference]: Start difference. First operand 384 states and 1325 transitions. Second operand 9 states. [2020-01-16 19:04:10,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:10,377 INFO L93 Difference]: Finished difference Result 589 states and 1741 transitions. [2020-01-16 19:04:10,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:10,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:10,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:10,379 INFO L225 Difference]: With dead ends: 589 [2020-01-16 19:04:10,379 INFO L226 Difference]: Without dead ends: 579 [2020-01-16 19:04:10,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:10,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-01-16 19:04:10,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 383. [2020-01-16 19:04:10,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:04:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1323 transitions. [2020-01-16 19:04:10,388 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1323 transitions. Word has length 22 [2020-01-16 19:04:10,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:10,388 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1323 transitions. [2020-01-16 19:04:10,388 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1323 transitions. [2020-01-16 19:04:10,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:10,389 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:10,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, 1, 1, 1] [2020-01-16 19:04:10,389 INFO L426 AbstractCegarLoop]: === Iteration 771 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:10,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:10,389 INFO L82 PathProgramCache]: Analyzing trace with hash -2095222508, now seen corresponding path program 765 times [2020-01-16 19:04:10,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:10,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527996481] [2020-01-16 19:04:10,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:10,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-01-16 19:04:10,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527996481] [2020-01-16 19:04:10,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:10,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:10,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686317043] [2020-01-16 19:04:10,673 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:10,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:10,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:10,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:10,673 INFO L87 Difference]: Start difference. First operand 383 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:04:10,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:10,774 INFO L93 Difference]: Finished difference Result 598 states and 1761 transitions. [2020-01-16 19:04:10,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:10,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:10,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:10,776 INFO L225 Difference]: With dead ends: 598 [2020-01-16 19:04:10,776 INFO L226 Difference]: Without dead ends: 587 [2020-01-16 19:04:10,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-01-16 19:04:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 386. [2020-01-16 19:04:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:04:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1328 transitions. [2020-01-16 19:04:10,786 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1328 transitions. Word has length 22 [2020-01-16 19:04:10,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:10,786 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1328 transitions. [2020-01-16 19:04:10,786 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1328 transitions. [2020-01-16 19:04:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:10,787 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:10,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, 1, 1, 1] [2020-01-16 19:04:10,787 INFO L426 AbstractCegarLoop]: === Iteration 772 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:10,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:10,787 INFO L82 PathProgramCache]: Analyzing trace with hash -709187378, now seen corresponding path program 766 times [2020-01-16 19:04:10,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:10,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855308771] [2020-01-16 19:04:10,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:11,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-01-16 19:04:11,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855308771] [2020-01-16 19:04:11,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:11,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:11,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917133350] [2020-01-16 19:04:11,065 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:11,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:11,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:11,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:11,065 INFO L87 Difference]: Start difference. First operand 386 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:04:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:11,178 INFO L93 Difference]: Finished difference Result 601 states and 1764 transitions. [2020-01-16 19:04:11,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:11,178 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:11,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:11,179 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:04:11,179 INFO L226 Difference]: Without dead ends: 584 [2020-01-16 19:04:11,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:11,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-01-16 19:04:11,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 383. [2020-01-16 19:04:11,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:04:11,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1322 transitions. [2020-01-16 19:04:11,188 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1322 transitions. Word has length 22 [2020-01-16 19:04:11,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:11,188 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1322 transitions. [2020-01-16 19:04:11,188 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:11,188 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1322 transitions. [2020-01-16 19:04:11,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:11,189 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:11,189 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:11,189 INFO L426 AbstractCegarLoop]: === Iteration 773 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:11,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:11,189 INFO L82 PathProgramCache]: Analyzing trace with hash -846210076, now seen corresponding path program 767 times [2020-01-16 19:04:11,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:11,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528306177] [2020-01-16 19:04:11,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:11,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:11,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528306177] [2020-01-16 19:04:11,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:11,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:11,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027990201] [2020-01-16 19:04:11,470 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:11,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:11,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:11,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:11,470 INFO L87 Difference]: Start difference. First operand 383 states and 1322 transitions. Second operand 9 states. [2020-01-16 19:04:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:11,555 INFO L93 Difference]: Finished difference Result 592 states and 1746 transitions. [2020-01-16 19:04:11,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:11,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:11,556 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:04:11,557 INFO L226 Difference]: Without dead ends: 583 [2020-01-16 19:04:11,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-01-16 19:04:11,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 384. [2020-01-16 19:04:11,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:04:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-01-16 19:04:11,566 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-01-16 19:04:11,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:11,566 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-01-16 19:04:11,566 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:11,566 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-01-16 19:04:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:11,567 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:11,567 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:11,567 INFO L426 AbstractCegarLoop]: === Iteration 774 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:11,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:11,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1921921232, now seen corresponding path program 768 times [2020-01-16 19:04:11,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:11,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638511417] [2020-01-16 19:04:11,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:11,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638511417] [2020-01-16 19:04:11,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:11,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:11,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530857342] [2020-01-16 19:04:11,853 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:11,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:11,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:11,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:11,854 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:04:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:11,958 INFO L93 Difference]: Finished difference Result 597 states and 1755 transitions. [2020-01-16 19:04:11,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:11,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:11,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:11,959 INFO L225 Difference]: With dead ends: 597 [2020-01-16 19:04:11,960 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:04:11,960 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:11,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:04:11,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 379. [2020-01-16 19:04:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:04:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1315 transitions. [2020-01-16 19:04:11,968 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1315 transitions. Word has length 22 [2020-01-16 19:04:11,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:11,968 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1315 transitions. [2020-01-16 19:04:11,969 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1315 transitions. [2020-01-16 19:04:11,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:11,969 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:11,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, 1, 1, 1] [2020-01-16 19:04:11,969 INFO L426 AbstractCegarLoop]: === Iteration 775 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:11,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:11,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1504425582, now seen corresponding path program 769 times [2020-01-16 19:04:11,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:11,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804871621] [2020-01-16 19:04:11,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:12,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804871621] [2020-01-16 19:04:12,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:12,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:12,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398110321] [2020-01-16 19:04:12,265 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:12,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:12,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:12,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:12,266 INFO L87 Difference]: Start difference. First operand 379 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:04:12,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:12,349 INFO L93 Difference]: Finished difference Result 623 states and 1831 transitions. [2020-01-16 19:04:12,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:12,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:12,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:12,351 INFO L225 Difference]: With dead ends: 623 [2020-01-16 19:04:12,351 INFO L226 Difference]: Without dead ends: 607 [2020-01-16 19:04:12,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:12,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-01-16 19:04:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 390. [2020-01-16 19:04:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:04:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1347 transitions. [2020-01-16 19:04:12,361 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1347 transitions. Word has length 22 [2020-01-16 19:04:12,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:12,361 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1347 transitions. [2020-01-16 19:04:12,361 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:12,361 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1347 transitions. [2020-01-16 19:04:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:12,361 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:12,361 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:12,362 INFO L426 AbstractCegarLoop]: === Iteration 776 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:12,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:12,362 INFO L82 PathProgramCache]: Analyzing trace with hash 85840304, now seen corresponding path program 770 times [2020-01-16 19:04:12,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:12,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643897181] [2020-01-16 19:04:12,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:12,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:12,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643897181] [2020-01-16 19:04:12,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:12,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:12,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464072374] [2020-01-16 19:04:12,643 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:12,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:12,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:12,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:12,644 INFO L87 Difference]: Start difference. First operand 390 states and 1347 transitions. Second operand 9 states. [2020-01-16 19:04:12,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:12,744 INFO L93 Difference]: Finished difference Result 618 states and 1818 transitions. [2020-01-16 19:04:12,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:12,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:12,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:12,745 INFO L225 Difference]: With dead ends: 618 [2020-01-16 19:04:12,746 INFO L226 Difference]: Without dead ends: 603 [2020-01-16 19:04:12,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:12,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-01-16 19:04:12,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 386. [2020-01-16 19:04:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:04:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1338 transitions. [2020-01-16 19:04:12,755 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1338 transitions. Word has length 22 [2020-01-16 19:04:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:12,755 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1338 transitions. [2020-01-16 19:04:12,755 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1338 transitions. [2020-01-16 19:04:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:12,756 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:12,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, 1, 1, 1] [2020-01-16 19:04:12,756 INFO L426 AbstractCegarLoop]: === Iteration 777 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:12,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:12,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1403513410, now seen corresponding path program 771 times [2020-01-16 19:04:12,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:12,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891721277] [2020-01-16 19:04:12,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:13,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-01-16 19:04:13,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891721277] [2020-01-16 19:04:13,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:13,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:13,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986077106] [2020-01-16 19:04:13,049 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:13,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:13,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:13,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:13,050 INFO L87 Difference]: Start difference. First operand 386 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:04:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:13,133 INFO L93 Difference]: Finished difference Result 621 states and 1823 transitions. [2020-01-16 19:04:13,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:13,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:13,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:13,135 INFO L225 Difference]: With dead ends: 621 [2020-01-16 19:04:13,135 INFO L226 Difference]: Without dead ends: 605 [2020-01-16 19:04:13,135 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-01-16 19:04:13,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 389. [2020-01-16 19:04:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:04:13,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1342 transitions. [2020-01-16 19:04:13,145 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1342 transitions. Word has length 22 [2020-01-16 19:04:13,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:13,145 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1342 transitions. [2020-01-16 19:04:13,145 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:13,145 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1342 transitions. [2020-01-16 19:04:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:13,146 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:13,146 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:13,146 INFO L426 AbstractCegarLoop]: === Iteration 778 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:13,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:13,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1276877036, now seen corresponding path program 772 times [2020-01-16 19:04:13,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:13,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869111019] [2020-01-16 19:04:13,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:13,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-01-16 19:04:13,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869111019] [2020-01-16 19:04:13,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:13,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:13,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179017927] [2020-01-16 19:04:13,449 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:13,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:13,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:13,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:13,450 INFO L87 Difference]: Start difference. First operand 389 states and 1342 transitions. Second operand 9 states. [2020-01-16 19:04:13,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:13,552 INFO L93 Difference]: Finished difference Result 615 states and 1809 transitions. [2020-01-16 19:04:13,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:13,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:13,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:13,554 INFO L225 Difference]: With dead ends: 615 [2020-01-16 19:04:13,554 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:04:13,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:13,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:04:13,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 386. [2020-01-16 19:04:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:04:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1335 transitions. [2020-01-16 19:04:13,564 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1335 transitions. Word has length 22 [2020-01-16 19:04:13,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:13,564 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1335 transitions. [2020-01-16 19:04:13,564 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:13,564 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1335 transitions. [2020-01-16 19:04:13,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:13,564 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:13,564 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:13,565 INFO L426 AbstractCegarLoop]: === Iteration 779 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:13,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:13,565 INFO L82 PathProgramCache]: Analyzing trace with hash 603072092, now seen corresponding path program 773 times [2020-01-16 19:04:13,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:13,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440567986] [2020-01-16 19:04:13,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:13,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440567986] [2020-01-16 19:04:13,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:13,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:13,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273651280] [2020-01-16 19:04:13,850 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:13,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:13,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:13,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:13,850 INFO L87 Difference]: Start difference. First operand 386 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:04:13,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:13,949 INFO L93 Difference]: Finished difference Result 610 states and 1800 transitions. [2020-01-16 19:04:13,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:13,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:13,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:13,951 INFO L225 Difference]: With dead ends: 610 [2020-01-16 19:04:13,951 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 19:04:13,951 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:13,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 19:04:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 388. [2020-01-16 19:04:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:04:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-01-16 19:04:13,959 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-01-16 19:04:13,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:13,959 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-01-16 19:04:13,959 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:13,959 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-01-16 19:04:13,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:13,960 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:13,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, 1, 1, 1] [2020-01-16 19:04:13,960 INFO L426 AbstractCegarLoop]: === Iteration 780 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:13,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:13,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1945004880, now seen corresponding path program 774 times [2020-01-16 19:04:13,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:13,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774166511] [2020-01-16 19:04:13,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:14,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-01-16 19:04:14,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774166511] [2020-01-16 19:04:14,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:14,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:14,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129663383] [2020-01-16 19:04:14,246 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:14,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:14,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:14,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:14,246 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:04:14,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:14,346 INFO L93 Difference]: Finished difference Result 609 states and 1796 transitions. [2020-01-16 19:04:14,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:14,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:14,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:14,348 INFO L225 Difference]: With dead ends: 609 [2020-01-16 19:04:14,348 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:04:14,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:04:14,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 383. [2020-01-16 19:04:14,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:04:14,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1328 transitions. [2020-01-16 19:04:14,356 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1328 transitions. Word has length 22 [2020-01-16 19:04:14,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:14,357 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1328 transitions. [2020-01-16 19:04:14,357 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:14,357 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1328 transitions. [2020-01-16 19:04:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:14,357 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:14,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, 1, 1, 1] [2020-01-16 19:04:14,357 INFO L426 AbstractCegarLoop]: === Iteration 781 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:14,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:14,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1452974500, now seen corresponding path program 775 times [2020-01-16 19:04:14,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:14,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321114589] [2020-01-16 19:04:14,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:14,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-01-16 19:04:14,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321114589] [2020-01-16 19:04:14,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:14,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:14,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160467728] [2020-01-16 19:04:14,661 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:14,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:14,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:14,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:14,662 INFO L87 Difference]: Start difference. First operand 383 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:04:14,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:14,737 INFO L93 Difference]: Finished difference Result 635 states and 1858 transitions. [2020-01-16 19:04:14,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:14,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:14,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:14,739 INFO L225 Difference]: With dead ends: 635 [2020-01-16 19:04:14,739 INFO L226 Difference]: Without dead ends: 619 [2020-01-16 19:04:14,739 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:14,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-01-16 19:04:14,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 392. [2020-01-16 19:04:14,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:04:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1350 transitions. [2020-01-16 19:04:14,749 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1350 transitions. Word has length 22 [2020-01-16 19:04:14,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:14,749 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1350 transitions. [2020-01-16 19:04:14,749 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1350 transitions. [2020-01-16 19:04:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:14,750 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:14,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, 1, 1, 1] [2020-01-16 19:04:14,750 INFO L426 AbstractCegarLoop]: === Iteration 782 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:14,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:14,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1251726910, now seen corresponding path program 776 times [2020-01-16 19:04:14,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:14,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694397827] [2020-01-16 19:04:14,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:15,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:15,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694397827] [2020-01-16 19:04:15,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:15,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:15,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632760656] [2020-01-16 19:04:15,037 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:15,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:15,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:15,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:15,038 INFO L87 Difference]: Start difference. First operand 392 states and 1350 transitions. Second operand 9 states. [2020-01-16 19:04:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:15,143 INFO L93 Difference]: Finished difference Result 630 states and 1845 transitions. [2020-01-16 19:04:15,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:15,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:15,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:15,145 INFO L225 Difference]: With dead ends: 630 [2020-01-16 19:04:15,145 INFO L226 Difference]: Without dead ends: 615 [2020-01-16 19:04:15,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:15,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-01-16 19:04:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 388. [2020-01-16 19:04:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:04:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1340 transitions. [2020-01-16 19:04:15,154 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1340 transitions. Word has length 22 [2020-01-16 19:04:15,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:15,154 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1340 transitions. [2020-01-16 19:04:15,154 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:15,154 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1340 transitions. [2020-01-16 19:04:15,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:15,155 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:15,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, 1, 1, 1] [2020-01-16 19:04:15,155 INFO L426 AbstractCegarLoop]: === Iteration 783 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:15,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:15,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1718025364, now seen corresponding path program 777 times [2020-01-16 19:04:15,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:15,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406286554] [2020-01-16 19:04:15,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:15,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-01-16 19:04:15,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406286554] [2020-01-16 19:04:15,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:15,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:15,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533724412] [2020-01-16 19:04:15,455 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:15,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:15,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:15,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:15,455 INFO L87 Difference]: Start difference. First operand 388 states and 1340 transitions. Second operand 9 states. [2020-01-16 19:04:15,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:15,538 INFO L93 Difference]: Finished difference Result 642 states and 1870 transitions. [2020-01-16 19:04:15,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:15,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:15,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:15,540 INFO L225 Difference]: With dead ends: 642 [2020-01-16 19:04:15,540 INFO L226 Difference]: Without dead ends: 626 [2020-01-16 19:04:15,540 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:15,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-01-16 19:04:15,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 396. [2020-01-16 19:04:15,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:04:15,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1353 transitions. [2020-01-16 19:04:15,550 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1353 transitions. Word has length 22 [2020-01-16 19:04:15,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:15,550 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1353 transitions. [2020-01-16 19:04:15,550 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:15,550 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1353 transitions. [2020-01-16 19:04:15,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:15,551 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:15,551 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:15,551 INFO L426 AbstractCegarLoop]: === Iteration 784 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:15,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:15,551 INFO L82 PathProgramCache]: Analyzing trace with hash 220453814, now seen corresponding path program 778 times [2020-01-16 19:04:15,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:15,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360648951] [2020-01-16 19:04:15,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:15,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-01-16 19:04:15,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360648951] [2020-01-16 19:04:15,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:15,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:15,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129715948] [2020-01-16 19:04:15,856 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:15,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:15,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:15,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:15,856 INFO L87 Difference]: Start difference. First operand 396 states and 1353 transitions. Second operand 9 states. [2020-01-16 19:04:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:15,959 INFO L93 Difference]: Finished difference Result 640 states and 1860 transitions. [2020-01-16 19:04:15,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:15,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:15,961 INFO L225 Difference]: With dead ends: 640 [2020-01-16 19:04:15,961 INFO L226 Difference]: Without dead ends: 618 [2020-01-16 19:04:15,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-01-16 19:04:15,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 388. [2020-01-16 19:04:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:04:15,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1335 transitions. [2020-01-16 19:04:15,970 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1335 transitions. Word has length 22 [2020-01-16 19:04:15,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:15,970 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1335 transitions. [2020-01-16 19:04:15,970 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:15,970 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1335 transitions. [2020-01-16 19:04:15,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:15,970 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:15,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, 1, 1, 1] [2020-01-16 19:04:15,971 INFO L426 AbstractCegarLoop]: === Iteration 785 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:15,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:15,971 INFO L82 PathProgramCache]: Analyzing trace with hash 502728950, now seen corresponding path program 779 times [2020-01-16 19:04:15,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:15,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190732935] [2020-01-16 19:04:15,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:16,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-01-16 19:04:16,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190732935] [2020-01-16 19:04:16,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:16,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:16,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085262023] [2020-01-16 19:04:16,260 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:16,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:16,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:16,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:16,260 INFO L87 Difference]: Start difference. First operand 388 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:04:16,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:16,365 INFO L93 Difference]: Finished difference Result 627 states and 1835 transitions. [2020-01-16 19:04:16,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:16,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:16,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:16,367 INFO L225 Difference]: With dead ends: 627 [2020-01-16 19:04:16,367 INFO L226 Difference]: Without dead ends: 616 [2020-01-16 19:04:16,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:16,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-01-16 19:04:16,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 391. [2020-01-16 19:04:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:04:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1340 transitions. [2020-01-16 19:04:16,377 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1340 transitions. Word has length 22 [2020-01-16 19:04:16,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:16,377 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1340 transitions. [2020-01-16 19:04:16,377 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1340 transitions. [2020-01-16 19:04:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:16,378 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:16,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, 1, 1, 1] [2020-01-16 19:04:16,379 INFO L426 AbstractCegarLoop]: === Iteration 786 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:16,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:16,379 INFO L82 PathProgramCache]: Analyzing trace with hash 521162976, now seen corresponding path program 780 times [2020-01-16 19:04:16,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:16,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263095687] [2020-01-16 19:04:16,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:16,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-01-16 19:04:16,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263095687] [2020-01-16 19:04:16,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:16,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:16,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613951329] [2020-01-16 19:04:16,672 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:16,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:16,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:16,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:16,672 INFO L87 Difference]: Start difference. First operand 391 states and 1340 transitions. Second operand 9 states. [2020-01-16 19:04:16,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:16,780 INFO L93 Difference]: Finished difference Result 630 states and 1838 transitions. [2020-01-16 19:04:16,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:16,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:16,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:16,782 INFO L225 Difference]: With dead ends: 630 [2020-01-16 19:04:16,782 INFO L226 Difference]: Without dead ends: 608 [2020-01-16 19:04:16,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:16,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-01-16 19:04:16,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 383. [2020-01-16 19:04:16,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:04:16,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1324 transitions. [2020-01-16 19:04:16,792 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1324 transitions. Word has length 22 [2020-01-16 19:04:16,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:16,792 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1324 transitions. [2020-01-16 19:04:16,792 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:16,792 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1324 transitions. [2020-01-16 19:04:16,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:16,793 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:16,793 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:16,793 INFO L426 AbstractCegarLoop]: === Iteration 787 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:16,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:16,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1905105740, now seen corresponding path program 781 times [2020-01-16 19:04:16,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:16,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315922976] [2020-01-16 19:04:16,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:17,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-01-16 19:04:17,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315922976] [2020-01-16 19:04:17,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:17,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:17,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845354534] [2020-01-16 19:04:17,105 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:17,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:17,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:17,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:17,106 INFO L87 Difference]: Start difference. First operand 383 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:04:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:17,187 INFO L93 Difference]: Finished difference Result 629 states and 1837 transitions. [2020-01-16 19:04:17,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:17,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:17,189 INFO L225 Difference]: With dead ends: 629 [2020-01-16 19:04:17,189 INFO L226 Difference]: Without dead ends: 613 [2020-01-16 19:04:17,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:17,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-01-16 19:04:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 390. [2020-01-16 19:04:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:04:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1340 transitions. [2020-01-16 19:04:17,199 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1340 transitions. Word has length 22 [2020-01-16 19:04:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:17,199 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1340 transitions. [2020-01-16 19:04:17,199 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:17,199 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1340 transitions. [2020-01-16 19:04:17,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:17,200 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:17,200 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:17,200 INFO L426 AbstractCegarLoop]: === Iteration 788 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:17,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:17,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1778469366, now seen corresponding path program 782 times [2020-01-16 19:04:17,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:17,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852313377] [2020-01-16 19:04:17,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:17,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-01-16 19:04:17,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852313377] [2020-01-16 19:04:17,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:17,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:17,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427333853] [2020-01-16 19:04:17,492 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:17,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:17,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:17,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:17,493 INFO L87 Difference]: Start difference. First operand 390 states and 1340 transitions. Second operand 9 states. [2020-01-16 19:04:17,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:17,598 INFO L93 Difference]: Finished difference Result 623 states and 1823 transitions. [2020-01-16 19:04:17,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:17,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:17,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:17,599 INFO L225 Difference]: With dead ends: 623 [2020-01-16 19:04:17,600 INFO L226 Difference]: Without dead ends: 610 [2020-01-16 19:04:17,600 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:17,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-01-16 19:04:17,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 387. [2020-01-16 19:04:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:04:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1333 transitions. [2020-01-16 19:04:17,609 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1333 transitions. Word has length 22 [2020-01-16 19:04:17,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:17,609 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1333 transitions. [2020-01-16 19:04:17,609 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:17,609 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1333 transitions. [2020-01-16 19:04:17,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:17,610 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:17,610 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:17,610 INFO L426 AbstractCegarLoop]: === Iteration 789 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:17,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:17,610 INFO L82 PathProgramCache]: Analyzing trace with hash -296790558, now seen corresponding path program 783 times [2020-01-16 19:04:17,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:17,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493307180] [2020-01-16 19:04:17,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:17,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493307180] [2020-01-16 19:04:17,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:17,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:17,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410482284] [2020-01-16 19:04:17,908 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:17,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:17,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:17,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:17,909 INFO L87 Difference]: Start difference. First operand 387 states and 1333 transitions. Second operand 9 states. [2020-01-16 19:04:17,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:17,988 INFO L93 Difference]: Finished difference Result 638 states and 1855 transitions. [2020-01-16 19:04:17,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:17,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:17,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:17,990 INFO L225 Difference]: With dead ends: 638 [2020-01-16 19:04:17,990 INFO L226 Difference]: Without dead ends: 622 [2020-01-16 19:04:17,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-01-16 19:04:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 395. [2020-01-16 19:04:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:04:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1346 transitions. [2020-01-16 19:04:17,999 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1346 transitions. Word has length 22 [2020-01-16 19:04:17,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:17,999 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1346 transitions. [2020-01-16 19:04:18,000 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1346 transitions. [2020-01-16 19:04:18,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:18,000 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:18,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, 1, 1, 1] [2020-01-16 19:04:18,000 INFO L426 AbstractCegarLoop]: === Iteration 790 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:18,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:18,001 INFO L82 PathProgramCache]: Analyzing trace with hash -946236150, now seen corresponding path program 784 times [2020-01-16 19:04:18,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:18,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956516600] [2020-01-16 19:04:18,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:18,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-01-16 19:04:18,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956516600] [2020-01-16 19:04:18,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:18,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:18,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61965785] [2020-01-16 19:04:18,290 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:18,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:18,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:18,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:18,290 INFO L87 Difference]: Start difference. First operand 395 states and 1346 transitions. Second operand 9 states. [2020-01-16 19:04:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:18,413 INFO L93 Difference]: Finished difference Result 636 states and 1845 transitions. [2020-01-16 19:04:18,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:18,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:18,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:18,415 INFO L225 Difference]: With dead ends: 636 [2020-01-16 19:04:18,415 INFO L226 Difference]: Without dead ends: 614 [2020-01-16 19:04:18,415 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:18,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-01-16 19:04:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 387. [2020-01-16 19:04:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:04:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1329 transitions. [2020-01-16 19:04:18,425 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1329 transitions. Word has length 22 [2020-01-16 19:04:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:18,425 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1329 transitions. [2020-01-16 19:04:18,425 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1329 transitions. [2020-01-16 19:04:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:18,426 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:18,426 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:18,426 INFO L426 AbstractCegarLoop]: === Iteration 791 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:18,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:18,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1978642352, now seen corresponding path program 785 times [2020-01-16 19:04:18,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:18,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221538767] [2020-01-16 19:04:18,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:18,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-01-16 19:04:18,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221538767] [2020-01-16 19:04:18,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:18,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:18,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269217155] [2020-01-16 19:04:18,710 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:18,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:18,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:18,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:18,710 INFO L87 Difference]: Start difference. First operand 387 states and 1329 transitions. Second operand 9 states. [2020-01-16 19:04:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:18,827 INFO L93 Difference]: Finished difference Result 620 states and 1814 transitions. [2020-01-16 19:04:18,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:18,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:18,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:18,829 INFO L225 Difference]: With dead ends: 620 [2020-01-16 19:04:18,829 INFO L226 Difference]: Without dead ends: 610 [2020-01-16 19:04:18,830 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:18,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-01-16 19:04:18,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 389. [2020-01-16 19:04:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:04:18,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1332 transitions. [2020-01-16 19:04:18,839 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1332 transitions. Word has length 22 [2020-01-16 19:04:18,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:18,839 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1332 transitions. [2020-01-16 19:04:18,839 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:18,839 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1332 transitions. [2020-01-16 19:04:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:18,839 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:18,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, 1, 1, 1] [2020-01-16 19:04:18,840 INFO L426 AbstractCegarLoop]: === Iteration 792 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:18,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:18,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1060692162, now seen corresponding path program 786 times [2020-01-16 19:04:18,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:18,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511662647] [2020-01-16 19:04:18,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:19,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511662647] [2020-01-16 19:04:19,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:19,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:19,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123742121] [2020-01-16 19:04:19,117 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:19,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:19,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:19,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:19,117 INFO L87 Difference]: Start difference. First operand 389 states and 1332 transitions. Second operand 9 states. [2020-01-16 19:04:19,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:19,235 INFO L93 Difference]: Finished difference Result 624 states and 1820 transitions. [2020-01-16 19:04:19,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:19,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:19,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:19,237 INFO L225 Difference]: With dead ends: 624 [2020-01-16 19:04:19,237 INFO L226 Difference]: Without dead ends: 604 [2020-01-16 19:04:19,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:19,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-01-16 19:04:19,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 383. [2020-01-16 19:04:19,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:04:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1320 transitions. [2020-01-16 19:04:19,247 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1320 transitions. Word has length 22 [2020-01-16 19:04:19,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:19,247 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1320 transitions. [2020-01-16 19:04:19,247 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:19,247 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1320 transitions. [2020-01-16 19:04:19,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:19,247 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:19,247 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:19,247 INFO L426 AbstractCegarLoop]: === Iteration 793 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:19,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:19,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1195571350, now seen corresponding path program 787 times [2020-01-16 19:04:19,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:19,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712538574] [2020-01-16 19:04:19,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:19,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-01-16 19:04:19,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712538574] [2020-01-16 19:04:19,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:19,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:19,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28844798] [2020-01-16 19:04:19,536 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:19,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:19,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:19,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:19,537 INFO L87 Difference]: Start difference. First operand 383 states and 1320 transitions. Second operand 9 states. [2020-01-16 19:04:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:19,644 INFO L93 Difference]: Finished difference Result 605 states and 1785 transitions. [2020-01-16 19:04:19,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:19,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:19,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:19,646 INFO L225 Difference]: With dead ends: 605 [2020-01-16 19:04:19,646 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:04:19,646 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:04:19,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 387. [2020-01-16 19:04:19,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:04:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1330 transitions. [2020-01-16 19:04:19,655 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1330 transitions. Word has length 22 [2020-01-16 19:04:19,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:19,655 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1330 transitions. [2020-01-16 19:04:19,655 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1330 transitions. [2020-01-16 19:04:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:19,656 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:19,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, 1, 1, 1] [2020-01-16 19:04:19,656 INFO L426 AbstractCegarLoop]: === Iteration 794 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:19,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:19,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1757463158, now seen corresponding path program 788 times [2020-01-16 19:04:19,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:19,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567973519] [2020-01-16 19:04:19,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:19,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-01-16 19:04:19,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567973519] [2020-01-16 19:04:19,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:19,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:19,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782103361] [2020-01-16 19:04:19,956 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:19,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:19,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:19,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:19,956 INFO L87 Difference]: Start difference. First operand 387 states and 1330 transitions. Second operand 9 states. [2020-01-16 19:04:20,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:20,063 INFO L93 Difference]: Finished difference Result 604 states and 1781 transitions. [2020-01-16 19:04:20,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:20,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:20,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:20,065 INFO L225 Difference]: With dead ends: 604 [2020-01-16 19:04:20,065 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 19:04:20,066 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:20,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 19:04:20,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 385. [2020-01-16 19:04:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:04:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1325 transitions. [2020-01-16 19:04:20,074 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1325 transitions. Word has length 22 [2020-01-16 19:04:20,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:20,074 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1325 transitions. [2020-01-16 19:04:20,074 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:20,074 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1325 transitions. [2020-01-16 19:04:20,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:20,075 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:20,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, 1, 1, 1] [2020-01-16 19:04:20,075 INFO L426 AbstractCegarLoop]: === Iteration 795 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:20,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:20,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1491080764, now seen corresponding path program 789 times [2020-01-16 19:04:20,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:20,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118166839] [2020-01-16 19:04:20,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:20,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-01-16 19:04:20,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118166839] [2020-01-16 19:04:20,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:20,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:20,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347938987] [2020-01-16 19:04:20,354 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:20,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:20,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:20,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:20,355 INFO L87 Difference]: Start difference. First operand 385 states and 1325 transitions. Second operand 9 states. [2020-01-16 19:04:20,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:20,469 INFO L93 Difference]: Finished difference Result 610 states and 1794 transitions. [2020-01-16 19:04:20,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:20,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:20,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:20,470 INFO L225 Difference]: With dead ends: 610 [2020-01-16 19:04:20,470 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 19:04:20,471 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:20,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 19:04:20,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 388. [2020-01-16 19:04:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:04:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1330 transitions. [2020-01-16 19:04:20,480 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1330 transitions. Word has length 22 [2020-01-16 19:04:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:20,480 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1330 transitions. [2020-01-16 19:04:20,480 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1330 transitions. [2020-01-16 19:04:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:20,481 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:20,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, 1, 1, 1] [2020-01-16 19:04:20,481 INFO L426 AbstractCegarLoop]: === Iteration 796 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:20,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:20,481 INFO L82 PathProgramCache]: Analyzing trace with hash -624520780, now seen corresponding path program 790 times [2020-01-16 19:04:20,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:20,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119066298] [2020-01-16 19:04:20,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:20,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-01-16 19:04:20,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119066298] [2020-01-16 19:04:20,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:20,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:20,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223154563] [2020-01-16 19:04:20,766 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:20,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:20,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:20,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:20,767 INFO L87 Difference]: Start difference. First operand 388 states and 1330 transitions. Second operand 9 states. [2020-01-16 19:04:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:20,875 INFO L93 Difference]: Finished difference Result 613 states and 1797 transitions. [2020-01-16 19:04:20,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:20,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:20,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:20,877 INFO L225 Difference]: With dead ends: 613 [2020-01-16 19:04:20,877 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 19:04:20,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:20,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 19:04:20,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 385. [2020-01-16 19:04:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:04:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1323 transitions. [2020-01-16 19:04:20,887 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1323 transitions. Word has length 22 [2020-01-16 19:04:20,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:20,887 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1323 transitions. [2020-01-16 19:04:20,887 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1323 transitions. [2020-01-16 19:04:20,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:20,887 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:20,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, 1, 1, 1] [2020-01-16 19:04:20,888 INFO L426 AbstractCegarLoop]: === Iteration 797 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:20,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:20,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1222233356, now seen corresponding path program 791 times [2020-01-16 19:04:20,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:20,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119372446] [2020-01-16 19:04:20,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:21,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-01-16 19:04:21,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119372446] [2020-01-16 19:04:21,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:21,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:21,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821740702] [2020-01-16 19:04:21,167 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:21,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:21,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:21,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:21,168 INFO L87 Difference]: Start difference. First operand 385 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:04:21,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:21,277 INFO L93 Difference]: Finished difference Result 607 states and 1785 transitions. [2020-01-16 19:04:21,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:21,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:21,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:21,279 INFO L225 Difference]: With dead ends: 607 [2020-01-16 19:04:21,279 INFO L226 Difference]: Without dead ends: 597 [2020-01-16 19:04:21,279 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:21,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-01-16 19:04:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 387. [2020-01-16 19:04:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:04:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1326 transitions. [2020-01-16 19:04:21,288 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1326 transitions. Word has length 22 [2020-01-16 19:04:21,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:21,288 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1326 transitions. [2020-01-16 19:04:21,288 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:21,288 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1326 transitions. [2020-01-16 19:04:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:21,289 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:21,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, 1, 1, 1] [2020-01-16 19:04:21,289 INFO L426 AbstractCegarLoop]: === Iteration 798 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:21,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:21,289 INFO L82 PathProgramCache]: Analyzing trace with hash -2140183546, now seen corresponding path program 792 times [2020-01-16 19:04:21,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:21,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322288664] [2020-01-16 19:04:21,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:21,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-01-16 19:04:21,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322288664] [2020-01-16 19:04:21,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:21,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:21,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117780106] [2020-01-16 19:04:21,571 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:21,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:21,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:21,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:21,571 INFO L87 Difference]: Start difference. First operand 387 states and 1326 transitions. Second operand 9 states. [2020-01-16 19:04:21,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:21,673 INFO L93 Difference]: Finished difference Result 611 states and 1791 transitions. [2020-01-16 19:04:21,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:21,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:21,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:21,675 INFO L225 Difference]: With dead ends: 611 [2020-01-16 19:04:21,675 INFO L226 Difference]: Without dead ends: 589 [2020-01-16 19:04:21,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:21,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-01-16 19:04:21,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 379. [2020-01-16 19:04:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:04:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1312 transitions. [2020-01-16 19:04:21,685 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1312 transitions. Word has length 22 [2020-01-16 19:04:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:21,685 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1312 transitions. [2020-01-16 19:04:21,685 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1312 transitions. [2020-01-16 19:04:21,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:21,685 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:21,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, 1, 1, 1] [2020-01-16 19:04:21,685 INFO L426 AbstractCegarLoop]: === Iteration 799 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:21,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:21,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1449614060, now seen corresponding path program 793 times [2020-01-16 19:04:21,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:21,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362844524] [2020-01-16 19:04:21,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:21,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-01-16 19:04:21,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362844524] [2020-01-16 19:04:21,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:21,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:21,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542489494] [2020-01-16 19:04:21,978 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:21,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:21,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:21,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:21,978 INFO L87 Difference]: Start difference. First operand 379 states and 1312 transitions. Second operand 9 states. [2020-01-16 19:04:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:22,054 INFO L93 Difference]: Finished difference Result 601 states and 1761 transitions. [2020-01-16 19:04:22,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:22,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:22,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:22,056 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:04:22,056 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 19:04:22,056 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:22,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 19:04:22,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 386. [2020-01-16 19:04:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:04:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1331 transitions. [2020-01-16 19:04:22,064 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1331 transitions. Word has length 22 [2020-01-16 19:04:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:22,065 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1331 transitions. [2020-01-16 19:04:22,065 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:22,065 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1331 transitions. [2020-01-16 19:04:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:22,065 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:22,065 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:22,065 INFO L426 AbstractCegarLoop]: === Iteration 800 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:22,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:22,066 INFO L82 PathProgramCache]: Analyzing trace with hash -888545568, now seen corresponding path program 794 times [2020-01-16 19:04:22,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:22,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855489038] [2020-01-16 19:04:22,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:22,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-01-16 19:04:22,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855489038] [2020-01-16 19:04:22,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:22,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:22,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599301136] [2020-01-16 19:04:22,362 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:22,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:22,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:22,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:22,363 INFO L87 Difference]: Start difference. First operand 386 states and 1331 transitions. Second operand 9 states. [2020-01-16 19:04:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:22,440 INFO L93 Difference]: Finished difference Result 594 states and 1746 transitions. [2020-01-16 19:04:22,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:22,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:22,442 INFO L225 Difference]: With dead ends: 594 [2020-01-16 19:04:22,442 INFO L226 Difference]: Without dead ends: 583 [2020-01-16 19:04:22,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-01-16 19:04:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 384. [2020-01-16 19:04:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:04:22,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1327 transitions. [2020-01-16 19:04:22,452 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1327 transitions. Word has length 22 [2020-01-16 19:04:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:22,452 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1327 transitions. [2020-01-16 19:04:22,452 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:22,452 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1327 transitions. [2020-01-16 19:04:22,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:22,453 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:22,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, 1, 1, 1] [2020-01-16 19:04:22,453 INFO L426 AbstractCegarLoop]: === Iteration 801 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:22,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:22,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1244915382, now seen corresponding path program 795 times [2020-01-16 19:04:22,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:22,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355266874] [2020-01-16 19:04:22,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:22,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355266874] [2020-01-16 19:04:22,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:22,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:22,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874537588] [2020-01-16 19:04:22,801 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:22,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:22,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:22,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:22,801 INFO L87 Difference]: Start difference. First operand 384 states and 1327 transitions. Second operand 9 states. [2020-01-16 19:04:22,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:22,888 INFO L93 Difference]: Finished difference Result 603 states and 1764 transitions. [2020-01-16 19:04:22,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:22,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:22,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:22,889 INFO L225 Difference]: With dead ends: 603 [2020-01-16 19:04:22,890 INFO L226 Difference]: Without dead ends: 587 [2020-01-16 19:04:22,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:22,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-01-16 19:04:22,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 387. [2020-01-16 19:04:22,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:04:22,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1331 transitions. [2020-01-16 19:04:22,899 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1331 transitions. Word has length 22 [2020-01-16 19:04:22,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:22,899 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1331 transitions. [2020-01-16 19:04:22,899 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:22,899 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1331 transitions. [2020-01-16 19:04:22,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:22,900 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:22,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:22,900 INFO L426 AbstractCegarLoop]: === Iteration 802 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:22,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:22,900 INFO L82 PathProgramCache]: Analyzing trace with hash 282711720, now seen corresponding path program 796 times [2020-01-16 19:04:22,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:22,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152173105] [2020-01-16 19:04:22,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:23,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152173105] [2020-01-16 19:04:23,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:23,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:23,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28832629] [2020-01-16 19:04:23,199 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:23,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:23,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:23,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:23,200 INFO L87 Difference]: Start difference. First operand 387 states and 1331 transitions. Second operand 9 states. [2020-01-16 19:04:23,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:23,303 INFO L93 Difference]: Finished difference Result 597 states and 1750 transitions. [2020-01-16 19:04:23,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:23,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:23,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:23,305 INFO L225 Difference]: With dead ends: 597 [2020-01-16 19:04:23,305 INFO L226 Difference]: Without dead ends: 584 [2020-01-16 19:04:23,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:23,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-01-16 19:04:23,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 384. [2020-01-16 19:04:23,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:04:23,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1325 transitions. [2020-01-16 19:04:23,314 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1325 transitions. Word has length 22 [2020-01-16 19:04:23,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:23,314 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1325 transitions. [2020-01-16 19:04:23,314 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:23,314 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1325 transitions. [2020-01-16 19:04:23,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:23,314 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:23,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, 1, 1, 1] [2020-01-16 19:04:23,314 INFO L426 AbstractCegarLoop]: === Iteration 803 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:23,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:23,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1299637608, now seen corresponding path program 797 times [2020-01-16 19:04:23,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:23,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835031598] [2020-01-16 19:04:23,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:23,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-01-16 19:04:23,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835031598] [2020-01-16 19:04:23,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:23,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:23,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956445792] [2020-01-16 19:04:23,622 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:23,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:23,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:23,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:23,622 INFO L87 Difference]: Start difference. First operand 384 states and 1325 transitions. Second operand 9 states. [2020-01-16 19:04:23,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:23,701 INFO L93 Difference]: Finished difference Result 587 states and 1731 transitions. [2020-01-16 19:04:23,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:23,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:23,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:23,703 INFO L225 Difference]: With dead ends: 587 [2020-01-16 19:04:23,703 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:04:23,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:23,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:04:23,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 385. [2020-01-16 19:04:23,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:04:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1326 transitions. [2020-01-16 19:04:23,711 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1326 transitions. Word has length 22 [2020-01-16 19:04:23,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:23,712 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1326 transitions. [2020-01-16 19:04:23,712 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:23,712 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1326 transitions. [2020-01-16 19:04:23,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:23,712 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:23,712 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:23,712 INFO L426 AbstractCegarLoop]: === Iteration 804 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:23,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:23,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1384388730, now seen corresponding path program 798 times [2020-01-16 19:04:23,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:23,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860619652] [2020-01-16 19:04:23,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:24,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-01-16 19:04:24,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860619652] [2020-01-16 19:04:24,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:24,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:24,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966329576] [2020-01-16 19:04:24,027 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:24,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:24,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:24,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:24,027 INFO L87 Difference]: Start difference. First operand 385 states and 1326 transitions. Second operand 9 states. [2020-01-16 19:04:24,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:24,142 INFO L93 Difference]: Finished difference Result 588 states and 1732 transitions. [2020-01-16 19:04:24,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:24,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:24,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:24,144 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:04:24,144 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:04:24,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:24,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:04:24,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 382. [2020-01-16 19:04:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1321 transitions. [2020-01-16 19:04:24,154 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1321 transitions. Word has length 22 [2020-01-16 19:04:24,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:24,154 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1321 transitions. [2020-01-16 19:04:24,154 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:24,154 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1321 transitions. [2020-01-16 19:04:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:24,154 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:24,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, 1, 1, 1] [2020-01-16 19:04:24,155 INFO L426 AbstractCegarLoop]: === Iteration 805 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:24,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:24,155 INFO L82 PathProgramCache]: Analyzing trace with hash -2046950718, now seen corresponding path program 799 times [2020-01-16 19:04:24,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:24,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763455257] [2020-01-16 19:04:24,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:24,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763455257] [2020-01-16 19:04:24,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:24,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:24,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171946943] [2020-01-16 19:04:24,443 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:24,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:24,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:24,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:24,443 INFO L87 Difference]: Start difference. First operand 382 states and 1321 transitions. Second operand 9 states. [2020-01-16 19:04:24,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:24,521 INFO L93 Difference]: Finished difference Result 611 states and 1782 transitions. [2020-01-16 19:04:24,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:24,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:24,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:24,523 INFO L225 Difference]: With dead ends: 611 [2020-01-16 19:04:24,523 INFO L226 Difference]: Without dead ends: 595 [2020-01-16 19:04:24,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:24,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-01-16 19:04:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 387. [2020-01-16 19:04:24,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:04:24,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1331 transitions. [2020-01-16 19:04:24,533 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1331 transitions. Word has length 22 [2020-01-16 19:04:24,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:24,533 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1331 transitions. [2020-01-16 19:04:24,533 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:24,533 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1331 transitions. [2020-01-16 19:04:24,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:24,533 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:24,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, 1, 1, 1] [2020-01-16 19:04:24,534 INFO L426 AbstractCegarLoop]: === Iteration 806 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:24,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:24,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1485882226, now seen corresponding path program 800 times [2020-01-16 19:04:24,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:24,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304878114] [2020-01-16 19:04:24,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:24,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304878114] [2020-01-16 19:04:24,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:24,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:24,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143152046] [2020-01-16 19:04:24,802 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:24,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:24,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:24,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:24,802 INFO L87 Difference]: Start difference. First operand 387 states and 1331 transitions. Second operand 9 states. [2020-01-16 19:04:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:24,881 INFO L93 Difference]: Finished difference Result 604 states and 1767 transitions. [2020-01-16 19:04:24,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:24,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:24,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:24,883 INFO L225 Difference]: With dead ends: 604 [2020-01-16 19:04:24,883 INFO L226 Difference]: Without dead ends: 593 [2020-01-16 19:04:24,883 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:24,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-01-16 19:04:24,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 385. [2020-01-16 19:04:24,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:04:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1327 transitions. [2020-01-16 19:04:24,893 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1327 transitions. Word has length 22 [2020-01-16 19:04:24,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:24,893 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1327 transitions. [2020-01-16 19:04:24,893 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:24,893 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1327 transitions. [2020-01-16 19:04:24,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:24,893 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:24,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, 1, 1, 1] [2020-01-16 19:04:24,894 INFO L426 AbstractCegarLoop]: === Iteration 807 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:24,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:24,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1034258186, now seen corresponding path program 801 times [2020-01-16 19:04:24,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:24,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602579065] [2020-01-16 19:04:24,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:25,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-01-16 19:04:25,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602579065] [2020-01-16 19:04:25,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:25,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:25,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030932660] [2020-01-16 19:04:25,184 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:25,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:25,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:25,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:25,184 INFO L87 Difference]: Start difference. First operand 385 states and 1327 transitions. Second operand 9 states. [2020-01-16 19:04:25,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:25,263 INFO L93 Difference]: Finished difference Result 622 states and 1806 transitions. [2020-01-16 19:04:25,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:25,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:25,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:25,265 INFO L225 Difference]: With dead ends: 622 [2020-01-16 19:04:25,265 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 19:04:25,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 19:04:25,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 393. [2020-01-16 19:04:25,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:04:25,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1340 transitions. [2020-01-16 19:04:25,275 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1340 transitions. Word has length 22 [2020-01-16 19:04:25,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:25,275 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1340 transitions. [2020-01-16 19:04:25,275 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1340 transitions. [2020-01-16 19:04:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:25,276 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:25,276 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:25,276 INFO L426 AbstractCegarLoop]: === Iteration 808 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:25,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1164228632, now seen corresponding path program 802 times [2020-01-16 19:04:25,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:25,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088010583] [2020-01-16 19:04:25,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:25,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-01-16 19:04:25,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088010583] [2020-01-16 19:04:25,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:25,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:25,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186515287] [2020-01-16 19:04:25,562 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:25,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:25,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:25,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:25,562 INFO L87 Difference]: Start difference. First operand 393 states and 1340 transitions. Second operand 9 states. [2020-01-16 19:04:25,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:25,677 INFO L93 Difference]: Finished difference Result 620 states and 1796 transitions. [2020-01-16 19:04:25,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:25,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:25,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:25,679 INFO L225 Difference]: With dead ends: 620 [2020-01-16 19:04:25,679 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:04:25,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:04:25,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 385. [2020-01-16 19:04:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:04:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1324 transitions. [2020-01-16 19:04:25,688 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1324 transitions. Word has length 22 [2020-01-16 19:04:25,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:25,688 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1324 transitions. [2020-01-16 19:04:25,688 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1324 transitions. [2020-01-16 19:04:25,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:25,689 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:25,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, 1, 1, 1] [2020-01-16 19:04:25,689 INFO L426 AbstractCegarLoop]: === Iteration 809 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:25,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:25,689 INFO L82 PathProgramCache]: Analyzing trace with hash -979535960, now seen corresponding path program 803 times [2020-01-16 19:04:25,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:25,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661228634] [2020-01-16 19:04:25,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:25,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-01-16 19:04:25,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661228634] [2020-01-16 19:04:25,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:25,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:25,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705188629] [2020-01-16 19:04:25,955 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:25,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:25,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:25,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:25,956 INFO L87 Difference]: Start difference. First operand 385 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:04:26,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:26,048 INFO L93 Difference]: Finished difference Result 601 states and 1759 transitions. [2020-01-16 19:04:26,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:26,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:26,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:26,050 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:04:26,050 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 19:04:26,050 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:26,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 19:04:26,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 386. [2020-01-16 19:04:26,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:04:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1325 transitions. [2020-01-16 19:04:26,059 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1325 transitions. Word has length 22 [2020-01-16 19:04:26,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:26,059 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1325 transitions. [2020-01-16 19:04:26,059 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1325 transitions. [2020-01-16 19:04:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:26,060 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:26,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, 1, 1, 1] [2020-01-16 19:04:26,060 INFO L426 AbstractCegarLoop]: === Iteration 810 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:26,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:26,060 INFO L82 PathProgramCache]: Analyzing trace with hash -2055247116, now seen corresponding path program 804 times [2020-01-16 19:04:26,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:26,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344359356] [2020-01-16 19:04:26,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:26,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-01-16 19:04:26,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344359356] [2020-01-16 19:04:26,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:26,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:26,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293040535] [2020-01-16 19:04:26,318 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:26,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:26,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:26,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:26,318 INFO L87 Difference]: Start difference. First operand 386 states and 1325 transitions. Second operand 9 states. [2020-01-16 19:04:26,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:26,430 INFO L93 Difference]: Finished difference Result 606 states and 1768 transitions. [2020-01-16 19:04:26,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:26,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:26,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:26,432 INFO L225 Difference]: With dead ends: 606 [2020-01-16 19:04:26,432 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 19:04:26,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:26,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 19:04:26,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 382. [2020-01-16 19:04:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:26,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1318 transitions. [2020-01-16 19:04:26,441 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1318 transitions. Word has length 22 [2020-01-16 19:04:26,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:26,442 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1318 transitions. [2020-01-16 19:04:26,442 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1318 transitions. [2020-01-16 19:04:26,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:26,442 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:26,442 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:26,442 INFO L426 AbstractCegarLoop]: === Iteration 811 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:26,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:26,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1721354494, now seen corresponding path program 805 times [2020-01-16 19:04:26,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:26,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682639563] [2020-01-16 19:04:26,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:26,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-01-16 19:04:26,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682639563] [2020-01-16 19:04:26,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:26,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:26,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455657927] [2020-01-16 19:04:26,739 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:26,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:26,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:26,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:26,739 INFO L87 Difference]: Start difference. First operand 382 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:04:26,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:26,820 INFO L93 Difference]: Finished difference Result 617 states and 1796 transitions. [2020-01-16 19:04:26,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:26,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:26,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:26,822 INFO L225 Difference]: With dead ends: 617 [2020-01-16 19:04:26,822 INFO L226 Difference]: Without dead ends: 601 [2020-01-16 19:04:26,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:26,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-01-16 19:04:26,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 389. [2020-01-16 19:04:26,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:04:26,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1334 transitions. [2020-01-16 19:04:26,831 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1334 transitions. Word has length 22 [2020-01-16 19:04:26,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:26,831 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1334 transitions. [2020-01-16 19:04:26,831 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1334 transitions. [2020-01-16 19:04:26,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:26,832 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:26,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, 1, 1, 1] [2020-01-16 19:04:26,832 INFO L426 AbstractCegarLoop]: === Iteration 812 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:26,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:26,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1611409140, now seen corresponding path program 806 times [2020-01-16 19:04:26,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:26,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333917687] [2020-01-16 19:04:26,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:27,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-01-16 19:04:27,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333917687] [2020-01-16 19:04:27,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:27,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:27,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888521025] [2020-01-16 19:04:27,118 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:27,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:27,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:27,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:27,118 INFO L87 Difference]: Start difference. First operand 389 states and 1334 transitions. Second operand 9 states. [2020-01-16 19:04:27,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:27,217 INFO L93 Difference]: Finished difference Result 611 states and 1782 transitions. [2020-01-16 19:04:27,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:27,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:27,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:27,219 INFO L225 Difference]: With dead ends: 611 [2020-01-16 19:04:27,219 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:04:27,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:04:27,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 386. [2020-01-16 19:04:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:04:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1327 transitions. [2020-01-16 19:04:27,229 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1327 transitions. Word has length 22 [2020-01-16 19:04:27,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:27,229 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1327 transitions. [2020-01-16 19:04:27,229 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1327 transitions. [2020-01-16 19:04:27,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:27,230 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:27,230 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:27,230 INFO L426 AbstractCegarLoop]: === Iteration 813 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:27,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:27,230 INFO L82 PathProgramCache]: Analyzing trace with hash 891775892, now seen corresponding path program 807 times [2020-01-16 19:04:27,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:27,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163094261] [2020-01-16 19:04:27,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:27,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163094261] [2020-01-16 19:04:27,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:27,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:27,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010039627] [2020-01-16 19:04:27,527 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:27,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:27,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:27,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:27,527 INFO L87 Difference]: Start difference. First operand 386 states and 1327 transitions. Second operand 9 states. [2020-01-16 19:04:27,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:27,604 INFO L93 Difference]: Finished difference Result 626 states and 1814 transitions. [2020-01-16 19:04:27,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:27,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:27,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:27,606 INFO L225 Difference]: With dead ends: 626 [2020-01-16 19:04:27,606 INFO L226 Difference]: Without dead ends: 610 [2020-01-16 19:04:27,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:27,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-01-16 19:04:27,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 394. [2020-01-16 19:04:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:04:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1340 transitions. [2020-01-16 19:04:27,615 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1340 transitions. Word has length 22 [2020-01-16 19:04:27,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:27,615 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1340 transitions. [2020-01-16 19:04:27,615 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:27,615 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1340 transitions. [2020-01-16 19:04:27,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:27,616 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:27,616 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:27,616 INFO L426 AbstractCegarLoop]: === Iteration 814 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:27,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:27,616 INFO L82 PathProgramCache]: Analyzing trace with hash 761805446, now seen corresponding path program 808 times [2020-01-16 19:04:27,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:27,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055329850] [2020-01-16 19:04:27,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:27,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-01-16 19:04:27,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055329850] [2020-01-16 19:04:27,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:27,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:27,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648371830] [2020-01-16 19:04:27,919 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:27,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:27,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:27,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:27,919 INFO L87 Difference]: Start difference. First operand 394 states and 1340 transitions. Second operand 9 states. [2020-01-16 19:04:28,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:28,025 INFO L93 Difference]: Finished difference Result 624 states and 1804 transitions. [2020-01-16 19:04:28,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:28,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:28,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:28,027 INFO L225 Difference]: With dead ends: 624 [2020-01-16 19:04:28,027 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:04:28,027 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:28,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:04:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 386. [2020-01-16 19:04:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:04:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1323 transitions. [2020-01-16 19:04:28,036 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1323 transitions. Word has length 22 [2020-01-16 19:04:28,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:28,036 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1323 transitions. [2020-01-16 19:04:28,036 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1323 transitions. [2020-01-16 19:04:28,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:28,037 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:28,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, 1, 1, 1] [2020-01-16 19:04:28,037 INFO L426 AbstractCegarLoop]: === Iteration 815 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:28,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:28,037 INFO L82 PathProgramCache]: Analyzing trace with hash -2586096, now seen corresponding path program 809 times [2020-01-16 19:04:28,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:28,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565783753] [2020-01-16 19:04:28,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:28,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:28,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565783753] [2020-01-16 19:04:28,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:28,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:28,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748984766] [2020-01-16 19:04:28,315 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:28,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:28,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:28,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:28,316 INFO L87 Difference]: Start difference. First operand 386 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:04:28,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:28,419 INFO L93 Difference]: Finished difference Result 608 states and 1773 transitions. [2020-01-16 19:04:28,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:28,420 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:28,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:28,421 INFO L225 Difference]: With dead ends: 608 [2020-01-16 19:04:28,421 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:04:28,421 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:04:28,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 388. [2020-01-16 19:04:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:04:28,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1326 transitions. [2020-01-16 19:04:28,431 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1326 transitions. Word has length 22 [2020-01-16 19:04:28,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:28,431 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1326 transitions. [2020-01-16 19:04:28,431 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1326 transitions. [2020-01-16 19:04:28,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:28,432 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:28,432 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:28,432 INFO L426 AbstractCegarLoop]: === Iteration 816 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:28,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:28,432 INFO L82 PathProgramCache]: Analyzing trace with hash -920536286, now seen corresponding path program 810 times [2020-01-16 19:04:28,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:28,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639002610] [2020-01-16 19:04:28,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:28,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-01-16 19:04:28,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639002610] [2020-01-16 19:04:28,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:28,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:28,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059427152] [2020-01-16 19:04:28,712 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:28,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:28,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:28,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:28,712 INFO L87 Difference]: Start difference. First operand 388 states and 1326 transitions. Second operand 9 states. [2020-01-16 19:04:28,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:28,819 INFO L93 Difference]: Finished difference Result 612 states and 1779 transitions. [2020-01-16 19:04:28,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:28,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:28,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:28,821 INFO L225 Difference]: With dead ends: 612 [2020-01-16 19:04:28,821 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 19:04:28,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:28,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 19:04:28,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 382. [2020-01-16 19:04:28,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-01-16 19:04:28,830 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-01-16 19:04:28,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:28,831 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-01-16 19:04:28,831 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:28,831 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-01-16 19:04:28,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:28,831 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:28,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, 1, 1, 1] [2020-01-16 19:04:28,831 INFO L426 AbstractCegarLoop]: === Iteration 817 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:28,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:28,832 INFO L82 PathProgramCache]: Analyzing trace with hash -183497330, now seen corresponding path program 811 times [2020-01-16 19:04:28,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:28,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40791411] [2020-01-16 19:04:28,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:29,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40791411] [2020-01-16 19:04:29,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:29,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:29,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270959887] [2020-01-16 19:04:29,130 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:29,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:29,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:29,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:29,130 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:04:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:29,213 INFO L93 Difference]: Finished difference Result 582 states and 1717 transitions. [2020-01-16 19:04:29,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:29,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:29,215 INFO L225 Difference]: With dead ends: 582 [2020-01-16 19:04:29,215 INFO L226 Difference]: Without dead ends: 573 [2020-01-16 19:04:29,215 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:29,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-01-16 19:04:29,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 384. [2020-01-16 19:04:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:04:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1319 transitions. [2020-01-16 19:04:29,223 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1319 transitions. Word has length 22 [2020-01-16 19:04:29,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:29,223 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1319 transitions. [2020-01-16 19:04:29,223 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:29,224 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1319 transitions. [2020-01-16 19:04:29,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:29,224 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:29,224 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:29,224 INFO L426 AbstractCegarLoop]: === Iteration 818 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:29,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:29,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1427443628, now seen corresponding path program 812 times [2020-01-16 19:04:29,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:29,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089611488] [2020-01-16 19:04:29,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:29,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-01-16 19:04:29,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089611488] [2020-01-16 19:04:29,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:29,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:29,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726875967] [2020-01-16 19:04:29,533 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:29,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:29,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:29,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:29,533 INFO L87 Difference]: Start difference. First operand 384 states and 1319 transitions. Second operand 9 states. [2020-01-16 19:04:29,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:29,641 INFO L93 Difference]: Finished difference Result 583 states and 1718 transitions. [2020-01-16 19:04:29,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:29,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:29,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:29,643 INFO L225 Difference]: With dead ends: 583 [2020-01-16 19:04:29,643 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:04:29,643 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:29,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:04:29,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 383. [2020-01-16 19:04:29,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:04:29,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1317 transitions. [2020-01-16 19:04:29,652 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1317 transitions. Word has length 22 [2020-01-16 19:04:29,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:29,652 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1317 transitions. [2020-01-16 19:04:29,652 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1317 transitions. [2020-01-16 19:04:29,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:29,653 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:29,653 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:29,653 INFO L426 AbstractCegarLoop]: === Iteration 819 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:29,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:29,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1865334240, now seen corresponding path program 813 times [2020-01-16 19:04:29,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:29,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306268277] [2020-01-16 19:04:29,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:29,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:29,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306268277] [2020-01-16 19:04:29,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:29,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:29,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637929661] [2020-01-16 19:04:29,924 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:29,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:29,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:29,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:29,924 INFO L87 Difference]: Start difference. First operand 383 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:04:30,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:30,006 INFO L93 Difference]: Finished difference Result 586 states and 1724 transitions. [2020-01-16 19:04:30,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:30,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:30,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:30,007 INFO L225 Difference]: With dead ends: 586 [2020-01-16 19:04:30,007 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:04:30,008 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:30,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:04:30,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 384. [2020-01-16 19:04:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:04:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1318 transitions. [2020-01-16 19:04:30,017 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1318 transitions. Word has length 22 [2020-01-16 19:04:30,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:30,017 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1318 transitions. [2020-01-16 19:04:30,017 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1318 transitions. [2020-01-16 19:04:30,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:30,018 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:30,018 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:30,018 INFO L426 AbstractCegarLoop]: === Iteration 820 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:30,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:30,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1353921900, now seen corresponding path program 814 times [2020-01-16 19:04:30,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:30,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973742454] [2020-01-16 19:04:30,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:30,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-01-16 19:04:30,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973742454] [2020-01-16 19:04:30,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:30,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:30,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3536177] [2020-01-16 19:04:30,290 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:30,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:30,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:30,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:30,290 INFO L87 Difference]: Start difference. First operand 384 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:04:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:30,397 INFO L93 Difference]: Finished difference Result 591 states and 1733 transitions. [2020-01-16 19:04:30,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:30,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:30,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:30,398 INFO L225 Difference]: With dead ends: 591 [2020-01-16 19:04:30,399 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:04:30,399 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:30,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:04:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 383. [2020-01-16 19:04:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:04:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1316 transitions. [2020-01-16 19:04:30,407 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1316 transitions. Word has length 22 [2020-01-16 19:04:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:30,408 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1316 transitions. [2020-01-16 19:04:30,408 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1316 transitions. [2020-01-16 19:04:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:30,408 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:30,408 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:30,408 INFO L426 AbstractCegarLoop]: === Iteration 821 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:30,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:30,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1854831136, now seen corresponding path program 815 times [2020-01-16 19:04:30,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:30,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910701740] [2020-01-16 19:04:30,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:30,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910701740] [2020-01-16 19:04:30,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:30,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:30,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939811476] [2020-01-16 19:04:30,689 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:30,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:30,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:30,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:30,689 INFO L87 Difference]: Start difference. First operand 383 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:04:30,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:30,794 INFO L93 Difference]: Finished difference Result 589 states and 1730 transitions. [2020-01-16 19:04:30,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:30,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:30,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:30,796 INFO L225 Difference]: With dead ends: 589 [2020-01-16 19:04:30,796 INFO L226 Difference]: Without dead ends: 579 [2020-01-16 19:04:30,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:30,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-01-16 19:04:30,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 385. [2020-01-16 19:04:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:04:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1319 transitions. [2020-01-16 19:04:30,805 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1319 transitions. Word has length 22 [2020-01-16 19:04:30,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:30,806 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1319 transitions. [2020-01-16 19:04:30,806 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:30,806 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1319 transitions. [2020-01-16 19:04:30,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:30,806 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:30,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, 1, 1, 1] [2020-01-16 19:04:30,806 INFO L426 AbstractCegarLoop]: === Iteration 822 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:30,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:30,807 INFO L82 PathProgramCache]: Analyzing trace with hash -246515954, now seen corresponding path program 816 times [2020-01-16 19:04:30,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:30,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325056971] [2020-01-16 19:04:30,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:31,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-01-16 19:04:31,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325056971] [2020-01-16 19:04:31,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:31,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:31,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236478333] [2020-01-16 19:04:31,082 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:31,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:31,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:31,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:31,083 INFO L87 Difference]: Start difference. First operand 385 states and 1319 transitions. Second operand 9 states. [2020-01-16 19:04:31,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:31,192 INFO L93 Difference]: Finished difference Result 593 states and 1736 transitions. [2020-01-16 19:04:31,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:31,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:31,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:31,193 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:04:31,193 INFO L226 Difference]: Without dead ends: 573 [2020-01-16 19:04:31,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:31,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-01-16 19:04:31,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 379. [2020-01-16 19:04:31,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:04:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1309 transitions. [2020-01-16 19:04:31,202 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1309 transitions. Word has length 22 [2020-01-16 19:04:31,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:31,202 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1309 transitions. [2020-01-16 19:04:31,202 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:31,202 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1309 transitions. [2020-01-16 19:04:31,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:31,203 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:31,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, 1, 1, 1] [2020-01-16 19:04:31,203 INFO L426 AbstractCegarLoop]: === Iteration 823 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:31,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:31,203 INFO L82 PathProgramCache]: Analyzing trace with hash 363192438, now seen corresponding path program 817 times [2020-01-16 19:04:31,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:31,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263020612] [2020-01-16 19:04:31,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:31,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-01-16 19:04:31,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263020612] [2020-01-16 19:04:31,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:31,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:31,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662762884] [2020-01-16 19:04:31,609 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:31,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:31,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:31,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:31,609 INFO L87 Difference]: Start difference. First operand 379 states and 1309 transitions. Second operand 9 states. [2020-01-16 19:04:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:31,727 INFO L93 Difference]: Finished difference Result 563 states and 1677 transitions. [2020-01-16 19:04:31,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:31,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:31,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:31,729 INFO L225 Difference]: With dead ends: 563 [2020-01-16 19:04:31,729 INFO L226 Difference]: Without dead ends: 552 [2020-01-16 19:04:31,729 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:31,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-01-16 19:04:31,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 382. [2020-01-16 19:04:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1317 transitions. [2020-01-16 19:04:31,738 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1317 transitions. Word has length 22 [2020-01-16 19:04:31,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:31,739 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1317 transitions. [2020-01-16 19:04:31,739 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:31,739 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1317 transitions. [2020-01-16 19:04:31,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:31,739 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:31,739 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:31,739 INFO L426 AbstractCegarLoop]: === Iteration 824 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:31,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:31,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1082324572, now seen corresponding path program 818 times [2020-01-16 19:04:31,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:31,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84108064] [2020-01-16 19:04:31,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:32,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-01-16 19:04:32,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84108064] [2020-01-16 19:04:32,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:32,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:32,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73578263] [2020-01-16 19:04:32,046 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:32,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:32,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:32,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:32,046 INFO L87 Difference]: Start difference. First operand 382 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:04:32,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:32,130 INFO L93 Difference]: Finished difference Result 561 states and 1672 transitions. [2020-01-16 19:04:32,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:32,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:32,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:32,131 INFO L225 Difference]: With dead ends: 561 [2020-01-16 19:04:32,131 INFO L226 Difference]: Without dead ends: 551 [2020-01-16 19:04:32,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:32,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-01-16 19:04:32,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 381. [2020-01-16 19:04:32,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:04:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1315 transitions. [2020-01-16 19:04:32,140 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1315 transitions. Word has length 22 [2020-01-16 19:04:32,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:32,140 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1315 transitions. [2020-01-16 19:04:32,140 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:32,140 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1315 transitions. [2020-01-16 19:04:32,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:32,141 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:32,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, 1, 1, 1] [2020-01-16 19:04:32,141 INFO L426 AbstractCegarLoop]: === Iteration 825 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:32,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:32,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1237245416, now seen corresponding path program 819 times [2020-01-16 19:04:32,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:32,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290216757] [2020-01-16 19:04:32,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:32,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-01-16 19:04:32,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290216757] [2020-01-16 19:04:32,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:32,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:32,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090852671] [2020-01-16 19:04:32,465 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:32,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:32,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:32,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:32,466 INFO L87 Difference]: Start difference. First operand 381 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:04:32,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:32,585 INFO L93 Difference]: Finished difference Result 565 states and 1681 transitions. [2020-01-16 19:04:32,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:32,586 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:32,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:32,587 INFO L225 Difference]: With dead ends: 565 [2020-01-16 19:04:32,587 INFO L226 Difference]: Without dead ends: 554 [2020-01-16 19:04:32,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-01-16 19:04:32,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 383. [2020-01-16 19:04:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:04:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-01-16 19:04:32,596 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-01-16 19:04:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:32,597 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-01-16 19:04:32,597 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-01-16 19:04:32,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:32,597 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:32,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, 1, 1, 1] [2020-01-16 19:04:32,598 INFO L426 AbstractCegarLoop]: === Iteration 826 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:32,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:32,598 INFO L82 PathProgramCache]: Analyzing trace with hash -984152664, now seen corresponding path program 820 times [2020-01-16 19:04:32,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:32,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136438604] [2020-01-16 19:04:32,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:32,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-01-16 19:04:32,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136438604] [2020-01-16 19:04:32,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:32,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:32,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221817402] [2020-01-16 19:04:32,903 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:32,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:32,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:32,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:32,904 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:04:33,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:33,012 INFO L93 Difference]: Finished difference Result 564 states and 1677 transitions. [2020-01-16 19:04:33,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:33,013 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:33,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:33,014 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:04:33,014 INFO L226 Difference]: Without dead ends: 552 [2020-01-16 19:04:33,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:33,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-01-16 19:04:33,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 381. [2020-01-16 19:04:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:04:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1314 transitions. [2020-01-16 19:04:33,024 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1314 transitions. Word has length 22 [2020-01-16 19:04:33,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:33,024 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1314 transitions. [2020-01-16 19:04:33,024 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1314 transitions. [2020-01-16 19:04:33,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:33,024 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:33,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, 1, 1, 1] [2020-01-16 19:04:33,025 INFO L426 AbstractCegarLoop]: === Iteration 827 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:33,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:33,025 INFO L82 PathProgramCache]: Analyzing trace with hash 11767016, now seen corresponding path program 821 times [2020-01-16 19:04:33,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:33,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571822668] [2020-01-16 19:04:33,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:33,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-01-16 19:04:33,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571822668] [2020-01-16 19:04:33,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:33,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:33,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809149869] [2020-01-16 19:04:33,329 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:33,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:33,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:33,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:33,330 INFO L87 Difference]: Start difference. First operand 381 states and 1314 transitions. Second operand 9 states. [2020-01-16 19:04:33,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:33,410 INFO L93 Difference]: Finished difference Result 560 states and 1669 transitions. [2020-01-16 19:04:33,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:33,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:33,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:33,412 INFO L225 Difference]: With dead ends: 560 [2020-01-16 19:04:33,412 INFO L226 Difference]: Without dead ends: 551 [2020-01-16 19:04:33,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:33,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-01-16 19:04:33,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 382. [2020-01-16 19:04:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:33,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-01-16 19:04:33,429 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-01-16 19:04:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:33,429 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-01-16 19:04:33,429 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-01-16 19:04:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:33,430 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:33,430 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:33,430 INFO L426 AbstractCegarLoop]: === Iteration 828 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:33,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:33,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1622707974, now seen corresponding path program 822 times [2020-01-16 19:04:33,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:33,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517225810] [2020-01-16 19:04:33,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:33,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517225810] [2020-01-16 19:04:33,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:33,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:33,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896061239] [2020-01-16 19:04:33,728 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:33,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:33,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:33,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:33,729 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:04:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:33,833 INFO L93 Difference]: Finished difference Result 561 states and 1670 transitions. [2020-01-16 19:04:33,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:33,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:33,835 INFO L225 Difference]: With dead ends: 561 [2020-01-16 19:04:33,835 INFO L226 Difference]: Without dead ends: 549 [2020-01-16 19:04:33,835 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:33,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-01-16 19:04:33,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 380. [2020-01-16 19:04:33,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:04:33,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1312 transitions. [2020-01-16 19:04:33,843 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1312 transitions. Word has length 22 [2020-01-16 19:04:33,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:33,843 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1312 transitions. [2020-01-16 19:04:33,844 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1312 transitions. [2020-01-16 19:04:33,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:33,844 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:33,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, 1, 1, 1] [2020-01-16 19:04:33,844 INFO L426 AbstractCegarLoop]: === Iteration 829 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:33,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:33,844 INFO L82 PathProgramCache]: Analyzing trace with hash -234144220, now seen corresponding path program 823 times [2020-01-16 19:04:33,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:33,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463283496] [2020-01-16 19:04:33,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:34,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463283496] [2020-01-16 19:04:34,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:34,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:34,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51916194] [2020-01-16 19:04:34,132 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:34,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:34,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:34,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:34,133 INFO L87 Difference]: Start difference. First operand 380 states and 1312 transitions. Second operand 9 states. [2020-01-16 19:04:34,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:34,253 INFO L93 Difference]: Finished difference Result 568 states and 1687 transitions. [2020-01-16 19:04:34,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:34,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:34,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:34,254 INFO L225 Difference]: With dead ends: 568 [2020-01-16 19:04:34,255 INFO L226 Difference]: Without dead ends: 557 [2020-01-16 19:04:34,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:34,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-01-16 19:04:34,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 382. [2020-01-16 19:04:34,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:34,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1316 transitions. [2020-01-16 19:04:34,264 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1316 transitions. Word has length 22 [2020-01-16 19:04:34,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:34,264 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1316 transitions. [2020-01-16 19:04:34,264 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1316 transitions. [2020-01-16 19:04:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:34,264 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:34,264 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:34,265 INFO L426 AbstractCegarLoop]: === Iteration 830 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:34,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:34,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1679661230, now seen corresponding path program 824 times [2020-01-16 19:04:34,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:34,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078924590] [2020-01-16 19:04:34,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:34,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-01-16 19:04:34,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078924590] [2020-01-16 19:04:34,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:34,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:34,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462485913] [2020-01-16 19:04:34,559 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:34,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:34,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:34,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:34,559 INFO L87 Difference]: Start difference. First operand 382 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:04:34,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:34,648 INFO L93 Difference]: Finished difference Result 566 states and 1682 transitions. [2020-01-16 19:04:34,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:34,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:34,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:34,649 INFO L225 Difference]: With dead ends: 566 [2020-01-16 19:04:34,650 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:04:34,650 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:34,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:04:34,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 381. [2020-01-16 19:04:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:04:34,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1314 transitions. [2020-01-16 19:04:34,658 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1314 transitions. Word has length 22 [2020-01-16 19:04:34,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:34,658 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1314 transitions. [2020-01-16 19:04:34,658 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:34,659 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1314 transitions. [2020-01-16 19:04:34,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:34,659 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:34,659 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:34,659 INFO L426 AbstractCegarLoop]: === Iteration 831 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:34,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:34,659 INFO L82 PathProgramCache]: Analyzing trace with hash 778548312, now seen corresponding path program 825 times [2020-01-16 19:04:34,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:34,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860630055] [2020-01-16 19:04:34,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:34,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-01-16 19:04:34,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860630055] [2020-01-16 19:04:34,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:34,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:34,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685760520] [2020-01-16 19:04:34,941 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:34,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:34,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:34,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:34,942 INFO L87 Difference]: Start difference. First operand 381 states and 1314 transitions. Second operand 9 states. [2020-01-16 19:04:35,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:35,045 INFO L93 Difference]: Finished difference Result 575 states and 1702 transitions. [2020-01-16 19:04:35,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:35,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:35,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:35,047 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:04:35,047 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 19:04:35,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:35,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 19:04:35,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 384. [2020-01-16 19:04:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:04:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1319 transitions. [2020-01-16 19:04:35,056 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1319 transitions. Word has length 22 [2020-01-16 19:04:35,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:35,057 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1319 transitions. [2020-01-16 19:04:35,057 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:35,057 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1319 transitions. [2020-01-16 19:04:35,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:35,057 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:35,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, 1, 1, 1] [2020-01-16 19:04:35,057 INFO L426 AbstractCegarLoop]: === Iteration 832 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:35,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:35,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2130383854, now seen corresponding path program 826 times [2020-01-16 19:04:35,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:35,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890412766] [2020-01-16 19:04:35,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:35,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-01-16 19:04:35,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890412766] [2020-01-16 19:04:35,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:35,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:35,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446577285] [2020-01-16 19:04:35,343 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:35,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:35,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:35,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:35,343 INFO L87 Difference]: Start difference. First operand 384 states and 1319 transitions. Second operand 9 states. [2020-01-16 19:04:35,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:35,458 INFO L93 Difference]: Finished difference Result 578 states and 1705 transitions. [2020-01-16 19:04:35,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:35,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:35,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:35,460 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:04:35,460 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:04:35,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:35,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:04:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 381. [2020-01-16 19:04:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:04:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1313 transitions. [2020-01-16 19:04:35,469 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1313 transitions. Word has length 22 [2020-01-16 19:04:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:35,469 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1313 transitions. [2020-01-16 19:04:35,470 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1313 transitions. [2020-01-16 19:04:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:35,470 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:35,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, 1, 1, 1] [2020-01-16 19:04:35,470 INFO L426 AbstractCegarLoop]: === Iteration 833 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:35,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:35,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2027560744, now seen corresponding path program 827 times [2020-01-16 19:04:35,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:35,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777596579] [2020-01-16 19:04:35,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:35,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:35,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777596579] [2020-01-16 19:04:35,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:35,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:35,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552877409] [2020-01-16 19:04:35,782 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:35,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:35,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:35,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:35,782 INFO L87 Difference]: Start difference. First operand 381 states and 1313 transitions. Second operand 9 states. [2020-01-16 19:04:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:35,860 INFO L93 Difference]: Finished difference Result 569 states and 1687 transitions. [2020-01-16 19:04:35,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:35,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:35,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:35,862 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:04:35,862 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:04:35,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:35,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:04:35,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-01-16 19:04:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1314 transitions. [2020-01-16 19:04:35,872 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1314 transitions. Word has length 22 [2020-01-16 19:04:35,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:35,872 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1314 transitions. [2020-01-16 19:04:35,872 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:35,872 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1314 transitions. [2020-01-16 19:04:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:35,873 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:35,873 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:35,873 INFO L426 AbstractCegarLoop]: === Iteration 834 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:35,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:35,873 INFO L82 PathProgramCache]: Analyzing trace with hash 951849588, now seen corresponding path program 828 times [2020-01-16 19:04:35,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:35,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553715168] [2020-01-16 19:04:35,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:36,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-01-16 19:04:36,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553715168] [2020-01-16 19:04:36,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:36,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:36,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082223603] [2020-01-16 19:04:36,150 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:36,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:36,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:36,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:36,150 INFO L87 Difference]: Start difference. First operand 382 states and 1314 transitions. Second operand 9 states. [2020-01-16 19:04:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:36,256 INFO L93 Difference]: Finished difference Result 574 states and 1696 transitions. [2020-01-16 19:04:36,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:36,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:36,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:36,257 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:04:36,258 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:04:36,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:36,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:04:36,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 380. [2020-01-16 19:04:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:04:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1311 transitions. [2020-01-16 19:04:36,267 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1311 transitions. Word has length 22 [2020-01-16 19:04:36,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:36,267 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1311 transitions. [2020-01-16 19:04:36,267 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1311 transitions. [2020-01-16 19:04:36,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:36,268 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:36,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, 1, 1, 1] [2020-01-16 19:04:36,268 INFO L426 AbstractCegarLoop]: === Iteration 835 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:36,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:36,268 INFO L82 PathProgramCache]: Analyzing trace with hash 91452004, now seen corresponding path program 829 times [2020-01-16 19:04:36,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:36,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599529913] [2020-01-16 19:04:36,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:36,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-01-16 19:04:36,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599529913] [2020-01-16 19:04:36,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:36,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:36,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153924129] [2020-01-16 19:04:36,554 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:36,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:36,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:36,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:36,555 INFO L87 Difference]: Start difference. First operand 380 states and 1311 transitions. Second operand 9 states. [2020-01-16 19:04:36,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:36,659 INFO L93 Difference]: Finished difference Result 574 states and 1703 transitions. [2020-01-16 19:04:36,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:36,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:36,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:36,661 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:04:36,661 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:04:36,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:36,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:04:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 384. [2020-01-16 19:04:36,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:04:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1321 transitions. [2020-01-16 19:04:36,671 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1321 transitions. Word has length 22 [2020-01-16 19:04:36,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:36,671 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1321 transitions. [2020-01-16 19:04:36,671 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:36,671 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1321 transitions. [2020-01-16 19:04:36,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:36,672 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:36,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:36,672 INFO L426 AbstractCegarLoop]: === Iteration 836 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:36,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:36,672 INFO L82 PathProgramCache]: Analyzing trace with hash 344544756, now seen corresponding path program 830 times [2020-01-16 19:04:36,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:36,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035190933] [2020-01-16 19:04:36,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:36,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035190933] [2020-01-16 19:04:36,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:36,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:36,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94424897] [2020-01-16 19:04:36,961 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:36,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:36,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:36,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:36,962 INFO L87 Difference]: Start difference. First operand 384 states and 1321 transitions. Second operand 9 states. [2020-01-16 19:04:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:37,065 INFO L93 Difference]: Finished difference Result 573 states and 1699 transitions. [2020-01-16 19:04:37,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:37,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:37,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:37,067 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:04:37,067 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:04:37,067 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:37,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:04:37,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 382. [2020-01-16 19:04:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1316 transitions. [2020-01-16 19:04:37,076 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1316 transitions. Word has length 22 [2020-01-16 19:04:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:37,077 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1316 transitions. [2020-01-16 19:04:37,077 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1316 transitions. [2020-01-16 19:04:37,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:37,077 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:37,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, 1, 1, 1] [2020-01-16 19:04:37,077 INFO L426 AbstractCegarLoop]: === Iteration 837 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:37,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:37,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1590384906, now seen corresponding path program 831 times [2020-01-16 19:04:37,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:37,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073933745] [2020-01-16 19:04:37,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:37,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-01-16 19:04:37,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073933745] [2020-01-16 19:04:37,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:37,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:37,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007537892] [2020-01-16 19:04:37,372 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:37,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:37,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:37,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:37,373 INFO L87 Difference]: Start difference. First operand 382 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:04:37,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:37,484 INFO L93 Difference]: Finished difference Result 579 states and 1712 transitions. [2020-01-16 19:04:37,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:37,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:37,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:37,486 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:04:37,486 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:04:37,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:37,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:04:37,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 385. [2020-01-16 19:04:37,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:04:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1321 transitions. [2020-01-16 19:04:37,495 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1321 transitions. Word has length 22 [2020-01-16 19:04:37,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:37,495 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1321 transitions. [2020-01-16 19:04:37,495 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1321 transitions. [2020-01-16 19:04:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:37,495 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:37,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, 1, 1, 1] [2020-01-16 19:04:37,496 INFO L426 AbstractCegarLoop]: === Iteration 838 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:37,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:37,496 INFO L82 PathProgramCache]: Analyzing trace with hash -204349776, now seen corresponding path program 832 times [2020-01-16 19:04:37,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:37,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57080403] [2020-01-16 19:04:37,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:37,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-01-16 19:04:37,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57080403] [2020-01-16 19:04:37,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:37,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:37,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502718921] [2020-01-16 19:04:37,779 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:37,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:37,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:37,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:37,779 INFO L87 Difference]: Start difference. First operand 385 states and 1321 transitions. Second operand 9 states. [2020-01-16 19:04:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:37,883 INFO L93 Difference]: Finished difference Result 582 states and 1715 transitions. [2020-01-16 19:04:37,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:37,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:37,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:37,885 INFO L225 Difference]: With dead ends: 582 [2020-01-16 19:04:37,885 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:04:37,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:37,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:04:37,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 382. [2020-01-16 19:04:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1314 transitions. [2020-01-16 19:04:37,894 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1314 transitions. Word has length 22 [2020-01-16 19:04:37,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:37,894 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1314 transitions. [2020-01-16 19:04:37,894 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1314 transitions. [2020-01-16 19:04:37,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:37,895 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:37,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, 1, 1, 1] [2020-01-16 19:04:37,895 INFO L426 AbstractCegarLoop]: === Iteration 839 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:37,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:37,895 INFO L82 PathProgramCache]: Analyzing trace with hash -196365100, now seen corresponding path program 833 times [2020-01-16 19:04:37,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:37,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886382967] [2020-01-16 19:04:37,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:38,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886382967] [2020-01-16 19:04:38,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:38,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:38,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538457580] [2020-01-16 19:04:38,186 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:38,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:38,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:38,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:38,186 INFO L87 Difference]: Start difference. First operand 382 states and 1314 transitions. Second operand 9 states. [2020-01-16 19:04:38,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:38,286 INFO L93 Difference]: Finished difference Result 576 states and 1703 transitions. [2020-01-16 19:04:38,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:38,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:38,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:38,288 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:04:38,288 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:04:38,288 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:38,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:04:38,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 384. [2020-01-16 19:04:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:04:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-01-16 19:04:38,297 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-01-16 19:04:38,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:38,297 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-01-16 19:04:38,298 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-01-16 19:04:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:38,298 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:38,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, 1, 1, 1] [2020-01-16 19:04:38,298 INFO L426 AbstractCegarLoop]: === Iteration 840 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:38,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:38,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1114315290, now seen corresponding path program 834 times [2020-01-16 19:04:38,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:38,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951471243] [2020-01-16 19:04:38,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:38,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-01-16 19:04:38,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951471243] [2020-01-16 19:04:38,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:38,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:38,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531903805] [2020-01-16 19:04:38,571 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:38,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:38,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:38,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:38,572 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:04:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:38,687 INFO L93 Difference]: Finished difference Result 580 states and 1709 transitions. [2020-01-16 19:04:38,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:38,688 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:38,689 INFO L225 Difference]: With dead ends: 580 [2020-01-16 19:04:38,689 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:04:38,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:38,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:04:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 380. [2020-01-16 19:04:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:04:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1310 transitions. [2020-01-16 19:04:38,698 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1310 transitions. Word has length 22 [2020-01-16 19:04:38,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:38,698 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1310 transitions. [2020-01-16 19:04:38,698 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:38,699 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1310 transitions. [2020-01-16 19:04:38,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:38,699 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:38,699 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:38,699 INFO L426 AbstractCegarLoop]: === Iteration 841 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:38,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:38,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1028468782, now seen corresponding path program 835 times [2020-01-16 19:04:38,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:38,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885208262] [2020-01-16 19:04:38,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:39,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-01-16 19:04:39,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885208262] [2020-01-16 19:04:39,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:39,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:39,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073922376] [2020-01-16 19:04:39,002 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:39,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:39,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:39,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:39,002 INFO L87 Difference]: Start difference. First operand 380 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:04:39,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:39,080 INFO L93 Difference]: Finished difference Result 563 states and 1674 transitions. [2020-01-16 19:04:39,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:39,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:39,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:39,082 INFO L225 Difference]: With dead ends: 563 [2020-01-16 19:04:39,082 INFO L226 Difference]: Without dead ends: 554 [2020-01-16 19:04:39,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:39,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-01-16 19:04:39,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 382. [2020-01-16 19:04:39,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1314 transitions. [2020-01-16 19:04:39,092 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1314 transitions. Word has length 22 [2020-01-16 19:04:39,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:39,092 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1314 transitions. [2020-01-16 19:04:39,092 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:39,092 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1314 transitions. [2020-01-16 19:04:39,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:39,093 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:39,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, 1, 1, 1] [2020-01-16 19:04:39,093 INFO L426 AbstractCegarLoop]: === Iteration 842 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:39,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:39,093 INFO L82 PathProgramCache]: Analyzing trace with hash 582472176, now seen corresponding path program 836 times [2020-01-16 19:04:39,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:39,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793187294] [2020-01-16 19:04:39,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:39,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793187294] [2020-01-16 19:04:39,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:39,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:39,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791811509] [2020-01-16 19:04:39,390 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:39,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:39,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:39,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:39,390 INFO L87 Difference]: Start difference. First operand 382 states and 1314 transitions. Second operand 9 states. [2020-01-16 19:04:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:39,497 INFO L93 Difference]: Finished difference Result 564 states and 1675 transitions. [2020-01-16 19:04:39,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:39,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:39,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:39,499 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:04:39,499 INFO L226 Difference]: Without dead ends: 553 [2020-01-16 19:04:39,499 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:39,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-01-16 19:04:39,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 381. [2020-01-16 19:04:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:04:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1312 transitions. [2020-01-16 19:04:39,508 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1312 transitions. Word has length 22 [2020-01-16 19:04:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:39,508 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1312 transitions. [2020-01-16 19:04:39,508 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1312 transitions. [2020-01-16 19:04:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:39,509 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:39,509 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:39,509 INFO L426 AbstractCegarLoop]: === Iteration 843 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:39,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:39,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1584661604, now seen corresponding path program 837 times [2020-01-16 19:04:39,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:39,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004944190] [2020-01-16 19:04:39,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:39,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004944190] [2020-01-16 19:04:39,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:39,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:39,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154521897] [2020-01-16 19:04:39,782 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:39,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:39,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:39,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:39,782 INFO L87 Difference]: Start difference. First operand 381 states and 1312 transitions. Second operand 9 states. [2020-01-16 19:04:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:39,861 INFO L93 Difference]: Finished difference Result 567 states and 1681 transitions. [2020-01-16 19:04:39,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:39,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:39,863 INFO L225 Difference]: With dead ends: 567 [2020-01-16 19:04:39,863 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:04:39,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:39,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:04:39,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 382. [2020-01-16 19:04:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1313 transitions. [2020-01-16 19:04:39,871 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1313 transitions. Word has length 22 [2020-01-16 19:04:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:39,871 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1313 transitions. [2020-01-16 19:04:39,871 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1313 transitions. [2020-01-16 19:04:39,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:39,872 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:39,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, 1, 1, 1] [2020-01-16 19:04:39,872 INFO L426 AbstractCegarLoop]: === Iteration 844 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:39,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:39,872 INFO L82 PathProgramCache]: Analyzing trace with hash 508950448, now seen corresponding path program 838 times [2020-01-16 19:04:39,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:39,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79658774] [2020-01-16 19:04:39,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:40,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-01-16 19:04:40,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79658774] [2020-01-16 19:04:40,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:40,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:40,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850811953] [2020-01-16 19:04:40,142 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:40,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:40,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:40,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:40,143 INFO L87 Difference]: Start difference. First operand 382 states and 1313 transitions. Second operand 9 states. [2020-01-16 19:04:40,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:40,247 INFO L93 Difference]: Finished difference Result 572 states and 1690 transitions. [2020-01-16 19:04:40,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:40,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:40,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:40,248 INFO L225 Difference]: With dead ends: 572 [2020-01-16 19:04:40,249 INFO L226 Difference]: Without dead ends: 557 [2020-01-16 19:04:40,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:40,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-01-16 19:04:40,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 381. [2020-01-16 19:04:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:04:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1311 transitions. [2020-01-16 19:04:40,257 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1311 transitions. Word has length 22 [2020-01-16 19:04:40,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:40,257 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1311 transitions. [2020-01-16 19:04:40,257 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:40,257 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1311 transitions. [2020-01-16 19:04:40,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:40,258 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:40,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, 1, 1, 1] [2020-01-16 19:04:40,258 INFO L426 AbstractCegarLoop]: === Iteration 845 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:40,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:40,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1595164708, now seen corresponding path program 839 times [2020-01-16 19:04:40,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:40,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448860942] [2020-01-16 19:04:40,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:40,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:40,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448860942] [2020-01-16 19:04:40,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:40,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:40,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280157500] [2020-01-16 19:04:40,538 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:40,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:40,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:40,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:40,538 INFO L87 Difference]: Start difference. First operand 381 states and 1311 transitions. Second operand 9 states. [2020-01-16 19:04:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:40,639 INFO L93 Difference]: Finished difference Result 570 states and 1687 transitions. [2020-01-16 19:04:40,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:40,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:40,640 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:04:40,640 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:04:40,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:40,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:04:40,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 383. [2020-01-16 19:04:40,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:04:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1314 transitions. [2020-01-16 19:04:40,650 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1314 transitions. Word has length 22 [2020-01-16 19:04:40,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:40,651 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1314 transitions. [2020-01-16 19:04:40,651 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:40,651 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1314 transitions. [2020-01-16 19:04:40,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:40,651 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:40,651 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:40,651 INFO L426 AbstractCegarLoop]: === Iteration 846 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:40,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:40,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1091487406, now seen corresponding path program 840 times [2020-01-16 19:04:40,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:40,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542432879] [2020-01-16 19:04:40,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:40,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-01-16 19:04:40,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542432879] [2020-01-16 19:04:40,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:40,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:40,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191013489] [2020-01-16 19:04:40,932 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:40,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:40,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:40,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:40,932 INFO L87 Difference]: Start difference. First operand 383 states and 1314 transitions. Second operand 9 states. [2020-01-16 19:04:41,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:41,043 INFO L93 Difference]: Finished difference Result 574 states and 1693 transitions. [2020-01-16 19:04:41,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:41,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:41,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:41,044 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:04:41,045 INFO L226 Difference]: Without dead ends: 553 [2020-01-16 19:04:41,045 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-01-16 19:04:41,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 376. [2020-01-16 19:04:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:04:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1303 transitions. [2020-01-16 19:04:41,053 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1303 transitions. Word has length 22 [2020-01-16 19:04:41,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:41,053 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1303 transitions. [2020-01-16 19:04:41,053 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1303 transitions. [2020-01-16 19:04:41,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:41,054 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:41,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, 1, 1, 1] [2020-01-16 19:04:41,054 INFO L426 AbstractCegarLoop]: === Iteration 847 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:41,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:41,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1001902390, now seen corresponding path program 841 times [2020-01-16 19:04:41,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:41,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035173423] [2020-01-16 19:04:41,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:41,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-01-16 19:04:41,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035173423] [2020-01-16 19:04:41,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:41,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:41,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410695519] [2020-01-16 19:04:41,332 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:41,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:41,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:41,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:41,332 INFO L87 Difference]: Start difference. First operand 376 states and 1303 transitions. Second operand 9 states. [2020-01-16 19:04:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:41,414 INFO L93 Difference]: Finished difference Result 583 states and 1720 transitions. [2020-01-16 19:04:41,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:41,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:41,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:41,416 INFO L225 Difference]: With dead ends: 583 [2020-01-16 19:04:41,416 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 19:04:41,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:41,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 19:04:41,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 386. [2020-01-16 19:04:41,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:04:41,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1333 transitions. [2020-01-16 19:04:41,425 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1333 transitions. Word has length 22 [2020-01-16 19:04:41,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:41,425 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1333 transitions. [2020-01-16 19:04:41,425 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:41,425 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1333 transitions. [2020-01-16 19:04:41,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:41,426 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:41,426 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:41,426 INFO L426 AbstractCegarLoop]: === Iteration 848 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:41,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:41,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1702799020, now seen corresponding path program 842 times [2020-01-16 19:04:41,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:41,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443974354] [2020-01-16 19:04:41,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:41,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-01-16 19:04:41,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443974354] [2020-01-16 19:04:41,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:41,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:41,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455313958] [2020-01-16 19:04:41,699 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:41,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:41,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:41,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:41,699 INFO L87 Difference]: Start difference. First operand 386 states and 1333 transitions. Second operand 9 states. [2020-01-16 19:04:41,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:41,805 INFO L93 Difference]: Finished difference Result 578 states and 1707 transitions. [2020-01-16 19:04:41,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:41,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:41,807 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:04:41,807 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:04:41,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:04:41,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 382. [2020-01-16 19:04:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1325 transitions. [2020-01-16 19:04:41,817 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1325 transitions. Word has length 22 [2020-01-16 19:04:41,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:41,817 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1325 transitions. [2020-01-16 19:04:41,817 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1325 transitions. [2020-01-16 19:04:41,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:41,817 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:41,817 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:41,817 INFO L426 AbstractCegarLoop]: === Iteration 849 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:41,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:41,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1940514586, now seen corresponding path program 843 times [2020-01-16 19:04:41,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:41,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63272130] [2020-01-16 19:04:41,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:42,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63272130] [2020-01-16 19:04:42,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:42,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:42,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881618609] [2020-01-16 19:04:42,090 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:42,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:42,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:42,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:42,091 INFO L87 Difference]: Start difference. First operand 382 states and 1325 transitions. Second operand 9 states. [2020-01-16 19:04:42,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:42,171 INFO L93 Difference]: Finished difference Result 579 states and 1708 transitions. [2020-01-16 19:04:42,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:42,172 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:42,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:42,173 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:04:42,173 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:04:42,173 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:42,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:04:42,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 384. [2020-01-16 19:04:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:04:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1327 transitions. [2020-01-16 19:04:42,183 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1327 transitions. Word has length 22 [2020-01-16 19:04:42,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:42,183 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1327 transitions. [2020-01-16 19:04:42,183 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:42,183 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1327 transitions. [2020-01-16 19:04:42,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:42,184 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:42,184 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:42,184 INFO L426 AbstractCegarLoop]: === Iteration 850 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:42,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:42,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1379446094, now seen corresponding path program 844 times [2020-01-16 19:04:42,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:42,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812349781] [2020-01-16 19:04:42,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:42,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:42,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812349781] [2020-01-16 19:04:42,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:42,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:42,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049177290] [2020-01-16 19:04:42,491 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:42,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:42,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:42,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:42,491 INFO L87 Difference]: Start difference. First operand 384 states and 1327 transitions. Second operand 9 states. [2020-01-16 19:04:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:42,577 INFO L93 Difference]: Finished difference Result 572 states and 1693 transitions. [2020-01-16 19:04:42,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:42,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:42,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:42,579 INFO L225 Difference]: With dead ends: 572 [2020-01-16 19:04:42,579 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:04:42,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:04:42,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 382. [2020-01-16 19:04:42,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1323 transitions. [2020-01-16 19:04:42,589 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1323 transitions. Word has length 22 [2020-01-16 19:04:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:42,589 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1323 transitions. [2020-01-16 19:04:42,589 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1323 transitions. [2020-01-16 19:04:42,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:42,589 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:42,590 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:42,590 INFO L426 AbstractCegarLoop]: === Iteration 851 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:42,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:42,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1160162504, now seen corresponding path program 845 times [2020-01-16 19:04:42,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:42,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573837789] [2020-01-16 19:04:42,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:42,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573837789] [2020-01-16 19:04:42,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:42,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:42,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912970641] [2020-01-16 19:04:42,877 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:42,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:42,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:42,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:42,877 INFO L87 Difference]: Start difference. First operand 382 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:04:42,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:42,980 INFO L93 Difference]: Finished difference Result 568 states and 1686 transitions. [2020-01-16 19:04:42,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:42,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:42,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:42,982 INFO L225 Difference]: With dead ends: 568 [2020-01-16 19:04:42,982 INFO L226 Difference]: Without dead ends: 557 [2020-01-16 19:04:42,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:42,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-01-16 19:04:42,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 383. [2020-01-16 19:04:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:04:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1324 transitions. [2020-01-16 19:04:42,991 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1324 transitions. Word has length 22 [2020-01-16 19:04:42,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:42,992 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1324 transitions. [2020-01-16 19:04:42,992 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1324 transitions. [2020-01-16 19:04:42,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:42,992 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:42,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, 1, 1, 1] [2020-01-16 19:04:42,992 INFO L426 AbstractCegarLoop]: === Iteration 852 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:42,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:42,993 INFO L82 PathProgramCache]: Analyzing trace with hash -285354506, now seen corresponding path program 846 times [2020-01-16 19:04:42,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:42,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031491756] [2020-01-16 19:04:42,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:43,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-01-16 19:04:43,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031491756] [2020-01-16 19:04:43,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:43,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:43,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170303555] [2020-01-16 19:04:43,279 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:43,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:43,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:43,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:43,280 INFO L87 Difference]: Start difference. First operand 383 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:04:43,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:43,363 INFO L93 Difference]: Finished difference Result 566 states and 1681 transitions. [2020-01-16 19:04:43,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:43,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:43,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:43,364 INFO L225 Difference]: With dead ends: 566 [2020-01-16 19:04:43,364 INFO L226 Difference]: Without dead ends: 554 [2020-01-16 19:04:43,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-01-16 19:04:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 380. [2020-01-16 19:04:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:04:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1319 transitions. [2020-01-16 19:04:43,374 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1319 transitions. Word has length 22 [2020-01-16 19:04:43,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:43,374 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1319 transitions. [2020-01-16 19:04:43,374 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:43,374 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1319 transitions. [2020-01-16 19:04:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:43,375 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:43,375 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:43,375 INFO L426 AbstractCegarLoop]: === Iteration 853 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:43,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:43,375 INFO L82 PathProgramCache]: Analyzing trace with hash 579416664, now seen corresponding path program 847 times [2020-01-16 19:04:43,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:43,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269229356] [2020-01-16 19:04:43,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:43,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269229356] [2020-01-16 19:04:43,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:43,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:43,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594276793] [2020-01-16 19:04:43,654 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:43,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:43,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:43,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:43,655 INFO L87 Difference]: Start difference. First operand 380 states and 1319 transitions. Second operand 9 states. [2020-01-16 19:04:43,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:43,749 INFO L93 Difference]: Finished difference Result 587 states and 1730 transitions. [2020-01-16 19:04:43,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:43,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:43,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:43,751 INFO L225 Difference]: With dead ends: 587 [2020-01-16 19:04:43,751 INFO L226 Difference]: Without dead ends: 571 [2020-01-16 19:04:43,752 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-01-16 19:04:43,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 387. [2020-01-16 19:04:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:04:43,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1335 transitions. [2020-01-16 19:04:43,760 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1335 transitions. Word has length 22 [2020-01-16 19:04:43,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:43,760 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1335 transitions. [2020-01-16 19:04:43,760 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:43,760 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1335 transitions. [2020-01-16 19:04:43,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:43,761 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:43,761 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:43,761 INFO L426 AbstractCegarLoop]: === Iteration 854 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:43,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:43,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2125284746, now seen corresponding path program 848 times [2020-01-16 19:04:43,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:43,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154323078] [2020-01-16 19:04:43,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:44,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154323078] [2020-01-16 19:04:44,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:44,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:44,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483985466] [2020-01-16 19:04:44,030 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:44,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:44,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:44,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:44,030 INFO L87 Difference]: Start difference. First operand 387 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:04:44,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:44,134 INFO L93 Difference]: Finished difference Result 582 states and 1717 transitions. [2020-01-16 19:04:44,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:44,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:44,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:44,136 INFO L225 Difference]: With dead ends: 582 [2020-01-16 19:04:44,136 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 19:04:44,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:44,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 19:04:44,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 383. [2020-01-16 19:04:44,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:04:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1326 transitions. [2020-01-16 19:04:44,146 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1326 transitions. Word has length 22 [2020-01-16 19:04:44,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:44,146 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1326 transitions. [2020-01-16 19:04:44,146 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1326 transitions. [2020-01-16 19:04:44,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:44,146 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:44,147 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:44,147 INFO L426 AbstractCegarLoop]: === Iteration 855 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:44,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:44,147 INFO L82 PathProgramCache]: Analyzing trace with hash 680328836, now seen corresponding path program 849 times [2020-01-16 19:04:44,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:44,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264279307] [2020-01-16 19:04:44,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:44,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-01-16 19:04:44,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264279307] [2020-01-16 19:04:44,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:44,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:44,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813039032] [2020-01-16 19:04:44,442 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:44,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:44,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:44,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:44,443 INFO L87 Difference]: Start difference. First operand 383 states and 1326 transitions. Second operand 9 states. [2020-01-16 19:04:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:44,522 INFO L93 Difference]: Finished difference Result 585 states and 1722 transitions. [2020-01-16 19:04:44,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:44,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:44,524 INFO L225 Difference]: With dead ends: 585 [2020-01-16 19:04:44,524 INFO L226 Difference]: Without dead ends: 569 [2020-01-16 19:04:44,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-01-16 19:04:44,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 386. [2020-01-16 19:04:44,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:04:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1330 transitions. [2020-01-16 19:04:44,533 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1330 transitions. Word has length 22 [2020-01-16 19:04:44,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:44,533 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1330 transitions. [2020-01-16 19:04:44,533 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:44,534 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1330 transitions. [2020-01-16 19:04:44,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:44,534 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:44,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, 1, 1, 1] [2020-01-16 19:04:44,534 INFO L426 AbstractCegarLoop]: === Iteration 856 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:44,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:44,534 INFO L82 PathProgramCache]: Analyzing trace with hash 806965210, now seen corresponding path program 850 times [2020-01-16 19:04:44,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:44,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517869843] [2020-01-16 19:04:44,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:44,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-01-16 19:04:44,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517869843] [2020-01-16 19:04:44,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:44,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:44,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782419273] [2020-01-16 19:04:44,818 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:44,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:44,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:44,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:44,818 INFO L87 Difference]: Start difference. First operand 386 states and 1330 transitions. Second operand 9 states. [2020-01-16 19:04:44,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:44,926 INFO L93 Difference]: Finished difference Result 579 states and 1708 transitions. [2020-01-16 19:04:44,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:44,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:44,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:44,928 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:04:44,928 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:04:44,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:44,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:04:44,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 383. [2020-01-16 19:04:44,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:04:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1323 transitions. [2020-01-16 19:04:44,938 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1323 transitions. Word has length 22 [2020-01-16 19:04:44,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:44,938 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1323 transitions. [2020-01-16 19:04:44,938 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:44,938 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1323 transitions. [2020-01-16 19:04:44,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:44,939 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:44,939 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:44,939 INFO L426 AbstractCegarLoop]: === Iteration 857 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:44,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:44,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1608052958, now seen corresponding path program 851 times [2020-01-16 19:04:44,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:44,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770455837] [2020-01-16 19:04:44,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:45,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-01-16 19:04:45,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770455837] [2020-01-16 19:04:45,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:45,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:45,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094662560] [2020-01-16 19:04:45,215 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:45,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:45,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:45,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:45,216 INFO L87 Difference]: Start difference. First operand 383 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:04:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:45,329 INFO L93 Difference]: Finished difference Result 574 states and 1699 transitions. [2020-01-16 19:04:45,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:45,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:45,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:45,331 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:04:45,331 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:04:45,331 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:45,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:04:45,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 385. [2020-01-16 19:04:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:04:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1326 transitions. [2020-01-16 19:04:45,340 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1326 transitions. Word has length 22 [2020-01-16 19:04:45,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:45,340 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1326 transitions. [2020-01-16 19:04:45,340 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:45,340 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1326 transitions. [2020-01-16 19:04:45,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:45,341 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:45,341 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:45,341 INFO L426 AbstractCegarLoop]: === Iteration 858 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:45,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:45,341 INFO L82 PathProgramCache]: Analyzing trace with hash -266120170, now seen corresponding path program 852 times [2020-01-16 19:04:45,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:45,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921370052] [2020-01-16 19:04:45,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:45,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921370052] [2020-01-16 19:04:45,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:45,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:45,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172767043] [2020-01-16 19:04:45,617 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:45,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:45,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:45,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:45,617 INFO L87 Difference]: Start difference. First operand 385 states and 1326 transitions. Second operand 9 states. [2020-01-16 19:04:45,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:45,725 INFO L93 Difference]: Finished difference Result 573 states and 1695 transitions. [2020-01-16 19:04:45,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:45,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:45,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:45,727 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:04:45,727 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:04:45,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:45,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:04:45,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 380. [2020-01-16 19:04:45,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:04:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1317 transitions. [2020-01-16 19:04:45,736 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1317 transitions. Word has length 22 [2020-01-16 19:04:45,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:45,737 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1317 transitions. [2020-01-16 19:04:45,737 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1317 transitions. [2020-01-16 19:04:45,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:45,737 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:45,737 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:45,737 INFO L426 AbstractCegarLoop]: === Iteration 859 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:45,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:45,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1959102490, now seen corresponding path program 853 times [2020-01-16 19:04:45,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:45,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25724000] [2020-01-16 19:04:45,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:46,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:46,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25724000] [2020-01-16 19:04:46,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:46,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:46,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019349131] [2020-01-16 19:04:46,028 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:46,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:46,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:46,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:46,028 INFO L87 Difference]: Start difference. First operand 380 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:04:46,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:46,108 INFO L93 Difference]: Finished difference Result 577 states and 1701 transitions. [2020-01-16 19:04:46,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:46,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:46,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:46,110 INFO L225 Difference]: With dead ends: 577 [2020-01-16 19:04:46,110 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:04:46,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:46,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:04:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 384. [2020-01-16 19:04:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:04:46,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1325 transitions. [2020-01-16 19:04:46,119 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1325 transitions. Word has length 22 [2020-01-16 19:04:46,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:46,120 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1325 transitions. [2020-01-16 19:04:46,120 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:46,120 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1325 transitions. [2020-01-16 19:04:46,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:46,120 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:46,120 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:46,120 INFO L426 AbstractCegarLoop]: === Iteration 860 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:46,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:46,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1398033998, now seen corresponding path program 854 times [2020-01-16 19:04:46,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:46,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234590713] [2020-01-16 19:04:46,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:46,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234590713] [2020-01-16 19:04:46,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:46,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:46,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962484850] [2020-01-16 19:04:46,405 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:46,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:46,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:46,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:46,406 INFO L87 Difference]: Start difference. First operand 384 states and 1325 transitions. Second operand 9 states. [2020-01-16 19:04:46,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:46,487 INFO L93 Difference]: Finished difference Result 570 states and 1686 transitions. [2020-01-16 19:04:46,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:46,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:46,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:46,489 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:04:46,489 INFO L226 Difference]: Without dead ends: 559 [2020-01-16 19:04:46,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-01-16 19:04:46,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 382. [2020-01-16 19:04:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1321 transitions. [2020-01-16 19:04:46,498 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1321 transitions. Word has length 22 [2020-01-16 19:04:46,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:46,499 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1321 transitions. [2020-01-16 19:04:46,499 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:46,499 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1321 transitions. [2020-01-16 19:04:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:46,499 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:46,499 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:46,499 INFO L426 AbstractCegarLoop]: === Iteration 861 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:46,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:46,500 INFO L82 PathProgramCache]: Analyzing trace with hash 735426952, now seen corresponding path program 855 times [2020-01-16 19:04:46,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:46,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941023219] [2020-01-16 19:04:46,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:46,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941023219] [2020-01-16 19:04:46,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:46,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:46,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776604334] [2020-01-16 19:04:46,794 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:46,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:46,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:46,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:46,795 INFO L87 Difference]: Start difference. First operand 382 states and 1321 transitions. Second operand 9 states. [2020-01-16 19:04:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:46,876 INFO L93 Difference]: Finished difference Result 579 states and 1704 transitions. [2020-01-16 19:04:46,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:46,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:46,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:46,877 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:04:46,878 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:04:46,878 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:46,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:04:46,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 385. [2020-01-16 19:04:46,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:04:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1325 transitions. [2020-01-16 19:04:46,887 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1325 transitions. Word has length 22 [2020-01-16 19:04:46,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:46,887 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1325 transitions. [2020-01-16 19:04:46,887 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:46,887 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1325 transitions. [2020-01-16 19:04:46,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:46,887 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:46,888 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:46,888 INFO L426 AbstractCegarLoop]: === Iteration 862 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:46,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:46,888 INFO L82 PathProgramCache]: Analyzing trace with hash -226776710, now seen corresponding path program 856 times [2020-01-16 19:04:46,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:46,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131332160] [2020-01-16 19:04:46,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:47,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-01-16 19:04:47,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131332160] [2020-01-16 19:04:47,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:47,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:47,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607948185] [2020-01-16 19:04:47,178 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:47,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:47,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:47,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:47,178 INFO L87 Difference]: Start difference. First operand 385 states and 1325 transitions. Second operand 9 states. [2020-01-16 19:04:47,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:47,284 INFO L93 Difference]: Finished difference Result 573 states and 1690 transitions. [2020-01-16 19:04:47,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:47,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:47,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:47,286 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:04:47,286 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:04:47,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:47,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:04:47,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-01-16 19:04:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1319 transitions. [2020-01-16 19:04:47,295 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1319 transitions. Word has length 22 [2020-01-16 19:04:47,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:47,295 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1319 transitions. [2020-01-16 19:04:47,295 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:47,295 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1319 transitions. [2020-01-16 19:04:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:47,295 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:47,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, 1, 1, 1] [2020-01-16 19:04:47,295 INFO L426 AbstractCegarLoop]: === Iteration 863 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:47,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:47,296 INFO L82 PathProgramCache]: Analyzing trace with hash 790149178, now seen corresponding path program 857 times [2020-01-16 19:04:47,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:47,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946332761] [2020-01-16 19:04:47,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:47,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-01-16 19:04:47,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946332761] [2020-01-16 19:04:47,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:47,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:47,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041840158] [2020-01-16 19:04:47,632 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:47,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:47,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:47,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:47,632 INFO L87 Difference]: Start difference. First operand 382 states and 1319 transitions. Second operand 9 states. [2020-01-16 19:04:47,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:47,718 INFO L93 Difference]: Finished difference Result 563 states and 1671 transitions. [2020-01-16 19:04:47,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:47,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:47,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:47,720 INFO L225 Difference]: With dead ends: 563 [2020-01-16 19:04:47,720 INFO L226 Difference]: Without dead ends: 554 [2020-01-16 19:04:47,721 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:47,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-01-16 19:04:47,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 383. [2020-01-16 19:04:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:04:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1320 transitions. [2020-01-16 19:04:47,730 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1320 transitions. Word has length 22 [2020-01-16 19:04:47,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:47,730 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1320 transitions. [2020-01-16 19:04:47,730 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1320 transitions. [2020-01-16 19:04:47,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:47,730 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:47,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, 1, 1, 1] [2020-01-16 19:04:47,731 INFO L426 AbstractCegarLoop]: === Iteration 864 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:47,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:47,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1893877160, now seen corresponding path program 858 times [2020-01-16 19:04:47,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:47,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812865442] [2020-01-16 19:04:47,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:48,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812865442] [2020-01-16 19:04:48,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:48,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:48,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827517766] [2020-01-16 19:04:48,030 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:48,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:48,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:48,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:48,030 INFO L87 Difference]: Start difference. First operand 383 states and 1320 transitions. Second operand 9 states. [2020-01-16 19:04:48,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:48,143 INFO L93 Difference]: Finished difference Result 564 states and 1672 transitions. [2020-01-16 19:04:48,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:48,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:48,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:48,144 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:04:48,144 INFO L226 Difference]: Without dead ends: 551 [2020-01-16 19:04:48,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-01-16 19:04:48,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 380. [2020-01-16 19:04:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:04:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1315 transitions. [2020-01-16 19:04:48,154 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1315 transitions. Word has length 22 [2020-01-16 19:04:48,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:48,154 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1315 transitions. [2020-01-16 19:04:48,154 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:48,154 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1315 transitions. [2020-01-16 19:04:48,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:48,155 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:48,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, 1, 1, 1] [2020-01-16 19:04:48,155 INFO L426 AbstractCegarLoop]: === Iteration 865 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:48,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:48,155 INFO L82 PathProgramCache]: Analyzing trace with hash 698675460, now seen corresponding path program 859 times [2020-01-16 19:04:48,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:48,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828450345] [2020-01-16 19:04:48,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:48,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:48,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828450345] [2020-01-16 19:04:48,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:48,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:48,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710896916] [2020-01-16 19:04:48,453 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:48,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:48,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:48,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:48,454 INFO L87 Difference]: Start difference. First operand 380 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:04:48,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:48,577 INFO L93 Difference]: Finished difference Result 558 states and 1663 transitions. [2020-01-16 19:04:48,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:48,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:48,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:48,578 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:04:48,578 INFO L226 Difference]: Without dead ends: 547 [2020-01-16 19:04:48,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:48,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-01-16 19:04:48,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 382. [2020-01-16 19:04:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1319 transitions. [2020-01-16 19:04:48,588 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1319 transitions. Word has length 22 [2020-01-16 19:04:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:48,588 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1319 transitions. [2020-01-16 19:04:48,588 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:48,588 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1319 transitions. [2020-01-16 19:04:48,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:48,588 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:48,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, 1, 1, 1] [2020-01-16 19:04:48,589 INFO L426 AbstractCegarLoop]: === Iteration 866 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:48,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:48,589 INFO L82 PathProgramCache]: Analyzing trace with hash -746841550, now seen corresponding path program 860 times [2020-01-16 19:04:48,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:48,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823945093] [2020-01-16 19:04:48,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:48,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:48,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823945093] [2020-01-16 19:04:48,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:48,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:48,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840059334] [2020-01-16 19:04:48,888 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:48,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:48,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:48,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:48,888 INFO L87 Difference]: Start difference. First operand 382 states and 1319 transitions. Second operand 9 states. [2020-01-16 19:04:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:48,969 INFO L93 Difference]: Finished difference Result 556 states and 1658 transitions. [2020-01-16 19:04:48,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:48,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:48,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:48,970 INFO L225 Difference]: With dead ends: 556 [2020-01-16 19:04:48,970 INFO L226 Difference]: Without dead ends: 546 [2020-01-16 19:04:48,971 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:48,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-01-16 19:04:48,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 381. [2020-01-16 19:04:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:04:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1317 transitions. [2020-01-16 19:04:48,979 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1317 transitions. Word has length 22 [2020-01-16 19:04:48,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:48,980 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1317 transitions. [2020-01-16 19:04:48,980 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1317 transitions. [2020-01-16 19:04:48,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:48,980 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:48,980 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:48,980 INFO L426 AbstractCegarLoop]: === Iteration 867 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:48,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:48,981 INFO L82 PathProgramCache]: Analyzing trace with hash -901762394, now seen corresponding path program 861 times [2020-01-16 19:04:48,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:48,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473390161] [2020-01-16 19:04:48,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:49,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473390161] [2020-01-16 19:04:49,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:49,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:49,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872688954] [2020-01-16 19:04:49,264 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:49,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:49,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:49,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:49,264 INFO L87 Difference]: Start difference. First operand 381 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:04:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:49,372 INFO L93 Difference]: Finished difference Result 560 states and 1667 transitions. [2020-01-16 19:04:49,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:49,372 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:49,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:49,373 INFO L225 Difference]: With dead ends: 560 [2020-01-16 19:04:49,374 INFO L226 Difference]: Without dead ends: 549 [2020-01-16 19:04:49,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:49,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-01-16 19:04:49,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 383. [2020-01-16 19:04:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:04:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1320 transitions. [2020-01-16 19:04:49,382 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1320 transitions. Word has length 22 [2020-01-16 19:04:49,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:49,383 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1320 transitions. [2020-01-16 19:04:49,383 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1320 transitions. [2020-01-16 19:04:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:49,383 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:49,383 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:49,383 INFO L426 AbstractCegarLoop]: === Iteration 868 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:49,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:49,384 INFO L82 PathProgramCache]: Analyzing trace with hash -648669642, now seen corresponding path program 862 times [2020-01-16 19:04:49,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:49,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639874244] [2020-01-16 19:04:49,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:49,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-01-16 19:04:49,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639874244] [2020-01-16 19:04:49,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:49,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:49,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4226764] [2020-01-16 19:04:49,671 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:49,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:49,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:49,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:49,671 INFO L87 Difference]: Start difference. First operand 383 states and 1320 transitions. Second operand 9 states. [2020-01-16 19:04:49,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:49,778 INFO L93 Difference]: Finished difference Result 559 states and 1663 transitions. [2020-01-16 19:04:49,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:49,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:49,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:49,779 INFO L225 Difference]: With dead ends: 559 [2020-01-16 19:04:49,780 INFO L226 Difference]: Without dead ends: 547 [2020-01-16 19:04:49,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:49,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-01-16 19:04:49,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 381. [2020-01-16 19:04:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:04:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1316 transitions. [2020-01-16 19:04:49,788 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1316 transitions. Word has length 22 [2020-01-16 19:04:49,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:49,788 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1316 transitions. [2020-01-16 19:04:49,788 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1316 transitions. [2020-01-16 19:04:49,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:49,789 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:49,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, 1, 1, 1] [2020-01-16 19:04:49,789 INFO L426 AbstractCegarLoop]: === Iteration 869 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:49,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:49,789 INFO L82 PathProgramCache]: Analyzing trace with hash 347250038, now seen corresponding path program 863 times [2020-01-16 19:04:49,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:49,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935505177] [2020-01-16 19:04:49,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:50,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935505177] [2020-01-16 19:04:50,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:50,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:50,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009500775] [2020-01-16 19:04:50,091 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:50,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:50,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:50,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:50,092 INFO L87 Difference]: Start difference. First operand 381 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:04:50,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:50,179 INFO L93 Difference]: Finished difference Result 555 states and 1655 transitions. [2020-01-16 19:04:50,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:50,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:50,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:50,181 INFO L225 Difference]: With dead ends: 555 [2020-01-16 19:04:50,181 INFO L226 Difference]: Without dead ends: 546 [2020-01-16 19:04:50,181 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:50,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-01-16 19:04:50,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 382. [2020-01-16 19:04:50,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:50,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1317 transitions. [2020-01-16 19:04:50,190 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1317 transitions. Word has length 22 [2020-01-16 19:04:50,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:50,190 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1317 transitions. [2020-01-16 19:04:50,190 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:50,190 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1317 transitions. [2020-01-16 19:04:50,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:50,191 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:50,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, 1, 1, 1] [2020-01-16 19:04:50,191 INFO L426 AbstractCegarLoop]: === Iteration 870 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:50,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:50,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1958190996, now seen corresponding path program 864 times [2020-01-16 19:04:50,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:50,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996138107] [2020-01-16 19:04:50,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:50,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-01-16 19:04:50,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996138107] [2020-01-16 19:04:50,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:50,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:50,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247582419] [2020-01-16 19:04:50,519 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:50,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:50,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:50,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:50,519 INFO L87 Difference]: Start difference. First operand 382 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:04:50,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:50,625 INFO L93 Difference]: Finished difference Result 556 states and 1656 transitions. [2020-01-16 19:04:50,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:50,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:50,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:50,627 INFO L225 Difference]: With dead ends: 556 [2020-01-16 19:04:50,627 INFO L226 Difference]: Without dead ends: 542 [2020-01-16 19:04:50,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:50,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-01-16 19:04:50,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 378. [2020-01-16 19:04:50,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:04:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1311 transitions. [2020-01-16 19:04:50,635 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1311 transitions. Word has length 22 [2020-01-16 19:04:50,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:50,635 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1311 transitions. [2020-01-16 19:04:50,636 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1311 transitions. [2020-01-16 19:04:50,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:50,636 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:50,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, 1, 1, 1] [2020-01-16 19:04:50,636 INFO L426 AbstractCegarLoop]: === Iteration 871 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:50,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:50,637 INFO L82 PathProgramCache]: Analyzing trace with hash -2020131198, now seen corresponding path program 865 times [2020-01-16 19:04:50,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:50,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234234441] [2020-01-16 19:04:50,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:50,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-01-16 19:04:50,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234234441] [2020-01-16 19:04:50,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:50,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:50,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149413076] [2020-01-16 19:04:50,914 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:50,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:50,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:50,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:50,914 INFO L87 Difference]: Start difference. First operand 378 states and 1311 transitions. Second operand 9 states. [2020-01-16 19:04:51,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:51,011 INFO L93 Difference]: Finished difference Result 587 states and 1729 transitions. [2020-01-16 19:04:51,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:51,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:51,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:51,013 INFO L225 Difference]: With dead ends: 587 [2020-01-16 19:04:51,013 INFO L226 Difference]: Without dead ends: 571 [2020-01-16 19:04:51,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-01-16 19:04:51,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 386. [2020-01-16 19:04:51,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:04:51,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1331 transitions. [2020-01-16 19:04:51,022 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1331 transitions. Word has length 22 [2020-01-16 19:04:51,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:51,022 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1331 transitions. [2020-01-16 19:04:51,022 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:51,022 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1331 transitions. [2020-01-16 19:04:51,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:51,023 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:51,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, 1, 1, 1] [2020-01-16 19:04:51,023 INFO L426 AbstractCegarLoop]: === Iteration 872 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:51,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:51,023 INFO L82 PathProgramCache]: Analyzing trace with hash -429865312, now seen corresponding path program 866 times [2020-01-16 19:04:51,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:51,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769800166] [2020-01-16 19:04:51,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:51,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-01-16 19:04:51,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769800166] [2020-01-16 19:04:51,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:51,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:51,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460179099] [2020-01-16 19:04:51,291 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:51,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:51,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:51,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:51,291 INFO L87 Difference]: Start difference. First operand 386 states and 1331 transitions. Second operand 9 states. [2020-01-16 19:04:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:51,395 INFO L93 Difference]: Finished difference Result 582 states and 1716 transitions. [2020-01-16 19:04:51,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:51,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:51,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:51,397 INFO L225 Difference]: With dead ends: 582 [2020-01-16 19:04:51,397 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 19:04:51,397 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:51,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 19:04:51,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 382. [2020-01-16 19:04:51,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1323 transitions. [2020-01-16 19:04:51,406 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1323 transitions. Word has length 22 [2020-01-16 19:04:51,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:51,406 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1323 transitions. [2020-01-16 19:04:51,407 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:51,407 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1323 transitions. [2020-01-16 19:04:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:51,407 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:51,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, 1, 1, 1] [2020-01-16 19:04:51,407 INFO L426 AbstractCegarLoop]: === Iteration 873 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:51,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:51,407 INFO L82 PathProgramCache]: Analyzing trace with hash -667580878, now seen corresponding path program 867 times [2020-01-16 19:04:51,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:51,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137210167] [2020-01-16 19:04:51,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:51,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137210167] [2020-01-16 19:04:51,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:51,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:51,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208158506] [2020-01-16 19:04:51,683 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:51,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:51,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:51,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:51,684 INFO L87 Difference]: Start difference. First operand 382 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:04:51,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:51,778 INFO L93 Difference]: Finished difference Result 583 states and 1717 transitions. [2020-01-16 19:04:51,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:51,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:51,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:51,780 INFO L225 Difference]: With dead ends: 583 [2020-01-16 19:04:51,780 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 19:04:51,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:51,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 19:04:51,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 384. [2020-01-16 19:04:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:04:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1325 transitions. [2020-01-16 19:04:51,789 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1325 transitions. Word has length 22 [2020-01-16 19:04:51,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:51,789 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1325 transitions. [2020-01-16 19:04:51,789 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1325 transitions. [2020-01-16 19:04:51,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:51,790 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:51,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, 1, 1, 1] [2020-01-16 19:04:51,790 INFO L426 AbstractCegarLoop]: === Iteration 874 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:51,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:51,790 INFO L82 PathProgramCache]: Analyzing trace with hash -106512386, now seen corresponding path program 868 times [2020-01-16 19:04:51,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:51,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121596499] [2020-01-16 19:04:51,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:52,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-01-16 19:04:52,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121596499] [2020-01-16 19:04:52,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:52,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:52,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399531793] [2020-01-16 19:04:52,064 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:52,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:52,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:52,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:52,065 INFO L87 Difference]: Start difference. First operand 384 states and 1325 transitions. Second operand 9 states. [2020-01-16 19:04:52,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:52,148 INFO L93 Difference]: Finished difference Result 576 states and 1702 transitions. [2020-01-16 19:04:52,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:52,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:52,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:52,150 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:04:52,150 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:04:52,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:52,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:04:52,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 382. [2020-01-16 19:04:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1321 transitions. [2020-01-16 19:04:52,159 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1321 transitions. Word has length 22 [2020-01-16 19:04:52,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:52,159 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1321 transitions. [2020-01-16 19:04:52,159 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:52,159 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1321 transitions. [2020-01-16 19:04:52,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:52,160 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:52,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, 1, 1, 1] [2020-01-16 19:04:52,160 INFO L426 AbstractCegarLoop]: === Iteration 875 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:52,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:52,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1861871084, now seen corresponding path program 869 times [2020-01-16 19:04:52,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:52,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653943450] [2020-01-16 19:04:52,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:52,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-01-16 19:04:52,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653943450] [2020-01-16 19:04:52,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:52,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:52,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471966478] [2020-01-16 19:04:52,439 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:52,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:52,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:52,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:52,439 INFO L87 Difference]: Start difference. First operand 382 states and 1321 transitions. Second operand 9 states. [2020-01-16 19:04:52,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:52,557 INFO L93 Difference]: Finished difference Result 572 states and 1695 transitions. [2020-01-16 19:04:52,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:52,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:52,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:52,559 INFO L225 Difference]: With dead ends: 572 [2020-01-16 19:04:52,559 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:04:52,559 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:52,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:04:52,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 383. [2020-01-16 19:04:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:04:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1322 transitions. [2020-01-16 19:04:52,568 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1322 transitions. Word has length 22 [2020-01-16 19:04:52,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:52,568 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1322 transitions. [2020-01-16 19:04:52,568 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:52,568 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1322 transitions. [2020-01-16 19:04:52,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:52,569 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:52,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, 1, 1, 1] [2020-01-16 19:04:52,569 INFO L426 AbstractCegarLoop]: === Iteration 876 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:52,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:52,569 INFO L82 PathProgramCache]: Analyzing trace with hash 987579202, now seen corresponding path program 870 times [2020-01-16 19:04:52,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:52,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455382009] [2020-01-16 19:04:52,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:52,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:52,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455382009] [2020-01-16 19:04:52,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:52,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:52,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308431867] [2020-01-16 19:04:52,866 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:52,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:52,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:52,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:52,867 INFO L87 Difference]: Start difference. First operand 383 states and 1322 transitions. Second operand 9 states. [2020-01-16 19:04:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:52,948 INFO L93 Difference]: Finished difference Result 570 states and 1690 transitions. [2020-01-16 19:04:52,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:52,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:52,950 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:04:52,950 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:04:52,950 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:04:52,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 380. [2020-01-16 19:04:52,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:04:52,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1317 transitions. [2020-01-16 19:04:52,959 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1317 transitions. Word has length 22 [2020-01-16 19:04:52,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:52,959 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1317 transitions. [2020-01-16 19:04:52,959 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:52,959 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1317 transitions. [2020-01-16 19:04:52,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:52,959 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:52,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, 1, 1, 1] [2020-01-16 19:04:52,960 INFO L426 AbstractCegarLoop]: === Iteration 877 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:52,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:52,960 INFO L82 PathProgramCache]: Analyzing trace with hash 92297432, now seen corresponding path program 871 times [2020-01-16 19:04:52,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:52,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47540996] [2020-01-16 19:04:52,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:53,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47540996] [2020-01-16 19:04:53,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:53,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:53,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204910639] [2020-01-16 19:04:53,241 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:53,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:53,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:53,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:53,241 INFO L87 Difference]: Start difference. First operand 380 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:04:53,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:53,337 INFO L93 Difference]: Finished difference Result 593 states and 1746 transitions. [2020-01-16 19:04:53,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:53,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:53,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:53,339 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:04:53,339 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:04:53,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:53,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:04:53,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 388. [2020-01-16 19:04:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:04:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1337 transitions. [2020-01-16 19:04:53,348 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1337 transitions. Word has length 22 [2020-01-16 19:04:53,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:53,348 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1337 transitions. [2020-01-16 19:04:53,348 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1337 transitions. [2020-01-16 19:04:53,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:53,349 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:53,349 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:53,349 INFO L426 AbstractCegarLoop]: === Iteration 878 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:53,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:53,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1682563318, now seen corresponding path program 872 times [2020-01-16 19:04:53,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:53,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348841183] [2020-01-16 19:04:53,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:53,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-01-16 19:04:53,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348841183] [2020-01-16 19:04:53,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:53,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:53,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624267967] [2020-01-16 19:04:53,630 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:53,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:53,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:53,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:53,631 INFO L87 Difference]: Start difference. First operand 388 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:04:53,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:53,738 INFO L93 Difference]: Finished difference Result 588 states and 1733 transitions. [2020-01-16 19:04:53,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:53,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:53,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:53,739 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:04:53,739 INFO L226 Difference]: Without dead ends: 573 [2020-01-16 19:04:53,739 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:53,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-01-16 19:04:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 384. [2020-01-16 19:04:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:04:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1327 transitions. [2020-01-16 19:04:53,748 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1327 transitions. Word has length 22 [2020-01-16 19:04:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:53,748 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1327 transitions. [2020-01-16 19:04:53,748 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1327 transitions. [2020-01-16 19:04:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:53,748 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:53,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, 1, 1, 1] [2020-01-16 19:04:53,748 INFO L426 AbstractCegarLoop]: === Iteration 879 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:53,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1256379320, now seen corresponding path program 873 times [2020-01-16 19:04:53,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:53,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896156192] [2020-01-16 19:04:53,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:54,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896156192] [2020-01-16 19:04:54,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:54,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:54,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100586717] [2020-01-16 19:04:54,037 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:54,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:54,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:54,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:54,038 INFO L87 Difference]: Start difference. First operand 384 states and 1327 transitions. Second operand 9 states. [2020-01-16 19:04:54,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:54,130 INFO L93 Difference]: Finished difference Result 587 states and 1733 transitions. [2020-01-16 19:04:54,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:54,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:54,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:54,132 INFO L225 Difference]: With dead ends: 587 [2020-01-16 19:04:54,132 INFO L226 Difference]: Without dead ends: 571 [2020-01-16 19:04:54,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:54,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-01-16 19:04:54,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 389. [2020-01-16 19:04:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:04:54,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1335 transitions. [2020-01-16 19:04:54,142 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1335 transitions. Word has length 22 [2020-01-16 19:04:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:54,142 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1335 transitions. [2020-01-16 19:04:54,142 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:54,142 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1335 transitions. [2020-01-16 19:04:54,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:54,143 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:54,143 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:54,143 INFO L426 AbstractCegarLoop]: === Iteration 880 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:54,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:54,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1337260074, now seen corresponding path program 874 times [2020-01-16 19:04:54,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:54,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163649260] [2020-01-16 19:04:54,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:54,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163649260] [2020-01-16 19:04:54,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:54,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:54,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989400322] [2020-01-16 19:04:54,427 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:54,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:54,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:54,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:54,428 INFO L87 Difference]: Start difference. First operand 389 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:04:54,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:54,540 INFO L93 Difference]: Finished difference Result 574 states and 1713 transitions. [2020-01-16 19:04:54,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:54,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:54,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:54,542 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:04:54,542 INFO L226 Difference]: Without dead ends: 557 [2020-01-16 19:04:54,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-01-16 19:04:54,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 384. [2020-01-16 19:04:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:04:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-01-16 19:04:54,551 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-01-16 19:04:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:54,551 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-01-16 19:04:54,551 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:54,551 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-01-16 19:04:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:54,551 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:54,551 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:54,552 INFO L426 AbstractCegarLoop]: === Iteration 881 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:54,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:54,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1823291562, now seen corresponding path program 875 times [2020-01-16 19:04:54,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:54,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499143011] [2020-01-16 19:04:54,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:54,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-01-16 19:04:54,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499143011] [2020-01-16 19:04:54,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:54,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:54,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288335742] [2020-01-16 19:04:54,835 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:54,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:54,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:54,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:54,836 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:04:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:54,944 INFO L93 Difference]: Finished difference Result 580 states and 1715 transitions. [2020-01-16 19:04:54,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:54,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:54,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:54,946 INFO L225 Difference]: With dead ends: 580 [2020-01-16 19:04:54,946 INFO L226 Difference]: Without dead ends: 569 [2020-01-16 19:04:54,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:54,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-01-16 19:04:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 387. [2020-01-16 19:04:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:04:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1328 transitions. [2020-01-16 19:04:54,956 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1328 transitions. Word has length 22 [2020-01-16 19:04:54,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:54,956 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1328 transitions. [2020-01-16 19:04:54,956 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1328 transitions. [2020-01-16 19:04:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:54,956 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:54,956 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:54,957 INFO L426 AbstractCegarLoop]: === Iteration 882 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:54,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:54,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1597935054, now seen corresponding path program 876 times [2020-01-16 19:04:54,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:54,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138386399] [2020-01-16 19:04:54,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:55,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-01-16 19:04:55,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138386399] [2020-01-16 19:04:55,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:55,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:55,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455437558] [2020-01-16 19:04:55,246 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:55,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:55,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:55,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:55,246 INFO L87 Difference]: Start difference. First operand 387 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:04:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:55,359 INFO L93 Difference]: Finished difference Result 572 states and 1706 transitions. [2020-01-16 19:04:55,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:55,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:55,360 INFO L225 Difference]: With dead ends: 572 [2020-01-16 19:04:55,360 INFO L226 Difference]: Without dead ends: 553 [2020-01-16 19:04:55,360 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:55,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-01-16 19:04:55,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 380. [2020-01-16 19:04:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:04:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1315 transitions. [2020-01-16 19:04:55,369 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1315 transitions. Word has length 22 [2020-01-16 19:04:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:55,369 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1315 transitions. [2020-01-16 19:04:55,369 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1315 transitions. [2020-01-16 19:04:55,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:55,369 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:55,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, 1, 1, 1] [2020-01-16 19:04:55,370 INFO L426 AbstractCegarLoop]: === Iteration 883 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:55,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:55,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1117524302, now seen corresponding path program 877 times [2020-01-16 19:04:55,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:55,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558229104] [2020-01-16 19:04:55,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:55,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-01-16 19:04:55,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558229104] [2020-01-16 19:04:55,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:55,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:55,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121207524] [2020-01-16 19:04:55,642 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:55,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:55,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:55,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:55,642 INFO L87 Difference]: Start difference. First operand 380 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:04:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:55,726 INFO L93 Difference]: Finished difference Result 583 states and 1716 transitions. [2020-01-16 19:04:55,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:55,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:55,728 INFO L225 Difference]: With dead ends: 583 [2020-01-16 19:04:55,728 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 19:04:55,728 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:55,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 19:04:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 384. [2020-01-16 19:04:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:04:55,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-01-16 19:04:55,737 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-01-16 19:04:55,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:55,737 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-01-16 19:04:55,737 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-01-16 19:04:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:55,737 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:55,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, 1, 1, 1] [2020-01-16 19:04:55,738 INFO L426 AbstractCegarLoop]: === Iteration 884 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:55,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:55,738 INFO L82 PathProgramCache]: Analyzing trace with hash -556455810, now seen corresponding path program 878 times [2020-01-16 19:04:55,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:55,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430101909] [2020-01-16 19:04:55,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:56,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430101909] [2020-01-16 19:04:56,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:56,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:56,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79900723] [2020-01-16 19:04:56,012 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:56,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:56,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:56,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:56,013 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:04:56,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:56,101 INFO L93 Difference]: Finished difference Result 576 states and 1701 transitions. [2020-01-16 19:04:56,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:56,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:56,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:56,103 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:04:56,103 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:04:56,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:04:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 382. [2020-01-16 19:04:56,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1319 transitions. [2020-01-16 19:04:56,112 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1319 transitions. Word has length 22 [2020-01-16 19:04:56,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:56,113 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1319 transitions. [2020-01-16 19:04:56,113 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:56,113 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1319 transitions. [2020-01-16 19:04:56,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:56,113 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:56,113 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:56,113 INFO L426 AbstractCegarLoop]: === Iteration 885 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:56,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:56,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1705269624, now seen corresponding path program 879 times [2020-01-16 19:04:56,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:56,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146557846] [2020-01-16 19:04:56,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:56,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-01-16 19:04:56,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146557846] [2020-01-16 19:04:56,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:56,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:56,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307158058] [2020-01-16 19:04:56,411 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:56,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:56,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:56,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:56,412 INFO L87 Difference]: Start difference. First operand 382 states and 1319 transitions. Second operand 9 states. [2020-01-16 19:04:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:56,522 INFO L93 Difference]: Finished difference Result 581 states and 1715 transitions. [2020-01-16 19:04:56,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:56,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:56,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:56,524 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:04:56,524 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:04:56,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:56,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:04:56,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 387. [2020-01-16 19:04:56,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:04:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1327 transitions. [2020-01-16 19:04:56,533 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1327 transitions. Word has length 22 [2020-01-16 19:04:56,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:56,533 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1327 transitions. [2020-01-16 19:04:56,533 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:56,533 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1327 transitions. [2020-01-16 19:04:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:56,533 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:56,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, 1, 1, 1] [2020-01-16 19:04:56,534 INFO L426 AbstractCegarLoop]: === Iteration 886 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:56,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:56,534 INFO L82 PathProgramCache]: Analyzing trace with hash 316647034, now seen corresponding path program 880 times [2020-01-16 19:04:56,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:56,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592151232] [2020-01-16 19:04:56,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:56,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592151232] [2020-01-16 19:04:56,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:56,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:56,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891919635] [2020-01-16 19:04:56,818 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:56,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:56,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:56,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:56,819 INFO L87 Difference]: Start difference. First operand 387 states and 1327 transitions. Second operand 9 states. [2020-01-16 19:04:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:56,930 INFO L93 Difference]: Finished difference Result 568 states and 1695 transitions. [2020-01-16 19:04:56,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:56,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:56,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:56,932 INFO L225 Difference]: With dead ends: 568 [2020-01-16 19:04:56,932 INFO L226 Difference]: Without dead ends: 551 [2020-01-16 19:04:56,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:56,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-01-16 19:04:56,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 382. [2020-01-16 19:04:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1317 transitions. [2020-01-16 19:04:56,942 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1317 transitions. Word has length 22 [2020-01-16 19:04:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:56,942 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1317 transitions. [2020-01-16 19:04:56,942 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1317 transitions. [2020-01-16 19:04:56,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:56,942 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:56,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:56,942 INFO L426 AbstractCegarLoop]: === Iteration 887 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:56,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:56,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1650547398, now seen corresponding path program 881 times [2020-01-16 19:04:56,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:56,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971878159] [2020-01-16 19:04:56,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:57,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-01-16 19:04:57,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971878159] [2020-01-16 19:04:57,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:57,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:57,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795646954] [2020-01-16 19:04:57,223 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:57,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:57,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:57,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:57,224 INFO L87 Difference]: Start difference. First operand 382 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:04:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:57,312 INFO L93 Difference]: Finished difference Result 570 states and 1689 transitions. [2020-01-16 19:04:57,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:57,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:57,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:57,313 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:04:57,313 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:04:57,314 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:57,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:04:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 383. [2020-01-16 19:04:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:04:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-01-16 19:04:57,323 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-01-16 19:04:57,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:57,323 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-01-16 19:04:57,323 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:57,323 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-01-16 19:04:57,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:57,323 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:57,323 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:57,324 INFO L426 AbstractCegarLoop]: === Iteration 888 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:57,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:57,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1115317596, now seen corresponding path program 882 times [2020-01-16 19:04:57,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:57,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476073121] [2020-01-16 19:04:57,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:57,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476073121] [2020-01-16 19:04:57,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:57,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:57,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893064990] [2020-01-16 19:04:57,606 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:57,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:57,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:57,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:57,606 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:04:57,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:57,724 INFO L93 Difference]: Finished difference Result 564 states and 1686 transitions. [2020-01-16 19:04:57,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:57,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:57,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:57,726 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:04:57,726 INFO L226 Difference]: Without dead ends: 549 [2020-01-16 19:04:57,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:57,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-01-16 19:04:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 380. [2020-01-16 19:04:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:04:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1313 transitions. [2020-01-16 19:04:57,735 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1313 transitions. Word has length 22 [2020-01-16 19:04:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:57,735 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1313 transitions. [2020-01-16 19:04:57,735 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1313 transitions. [2020-01-16 19:04:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:57,736 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:57,736 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:57,736 INFO L426 AbstractCegarLoop]: === Iteration 889 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:57,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:57,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1540253648, now seen corresponding path program 883 times [2020-01-16 19:04:57,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:57,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119679806] [2020-01-16 19:04:57,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:58,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-01-16 19:04:58,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119679806] [2020-01-16 19:04:58,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:58,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:58,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948281677] [2020-01-16 19:04:58,022 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:58,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:58,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:58,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:58,023 INFO L87 Difference]: Start difference. First operand 380 states and 1313 transitions. Second operand 9 states. [2020-01-16 19:04:58,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:58,159 INFO L93 Difference]: Finished difference Result 564 states and 1677 transitions. [2020-01-16 19:04:58,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:58,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:58,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:58,160 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:04:58,161 INFO L226 Difference]: Without dead ends: 553 [2020-01-16 19:04:58,161 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:58,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-01-16 19:04:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 382. [2020-01-16 19:04:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1317 transitions. [2020-01-16 19:04:58,170 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1317 transitions. Word has length 22 [2020-01-16 19:04:58,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:58,170 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1317 transitions. [2020-01-16 19:04:58,170 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1317 transitions. [2020-01-16 19:04:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:58,170 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:58,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, 1, 1, 1] [2020-01-16 19:04:58,171 INFO L426 AbstractCegarLoop]: === Iteration 890 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:58,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:58,171 INFO L82 PathProgramCache]: Analyzing trace with hash 94736638, now seen corresponding path program 884 times [2020-01-16 19:04:58,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:58,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378548346] [2020-01-16 19:04:58,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:58,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:58,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378548346] [2020-01-16 19:04:58,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:58,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:58,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591759469] [2020-01-16 19:04:58,461 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:58,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:58,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:58,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:58,462 INFO L87 Difference]: Start difference. First operand 382 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:04:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:58,557 INFO L93 Difference]: Finished difference Result 562 states and 1672 transitions. [2020-01-16 19:04:58,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:58,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:58,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:58,559 INFO L225 Difference]: With dead ends: 562 [2020-01-16 19:04:58,559 INFO L226 Difference]: Without dead ends: 552 [2020-01-16 19:04:58,559 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:58,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-01-16 19:04:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 381. [2020-01-16 19:04:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:04:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1315 transitions. [2020-01-16 19:04:58,568 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1315 transitions. Word has length 22 [2020-01-16 19:04:58,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:58,568 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1315 transitions. [2020-01-16 19:04:58,568 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1315 transitions. [2020-01-16 19:04:58,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:58,569 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:58,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, 1, 1, 1] [2020-01-16 19:04:58,569 INFO L426 AbstractCegarLoop]: === Iteration 891 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:58,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash 952508326, now seen corresponding path program 885 times [2020-01-16 19:04:58,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:58,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742053903] [2020-01-16 19:04:58,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:58,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742053903] [2020-01-16 19:04:58,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:58,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:58,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513600725] [2020-01-16 19:04:58,853 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:58,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:58,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:58,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:58,854 INFO L87 Difference]: Start difference. First operand 381 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:04:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:58,972 INFO L93 Difference]: Finished difference Result 566 states and 1683 transitions. [2020-01-16 19:04:58,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:58,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:58,974 INFO L225 Difference]: With dead ends: 566 [2020-01-16 19:04:58,974 INFO L226 Difference]: Without dead ends: 555 [2020-01-16 19:04:58,974 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:58,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-01-16 19:04:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 384. [2020-01-16 19:04:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:04:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1320 transitions. [2020-01-16 19:04:58,984 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1320 transitions. Word has length 22 [2020-01-16 19:04:58,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:58,984 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1320 transitions. [2020-01-16 19:04:58,984 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:58,984 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1320 transitions. [2020-01-16 19:04:58,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:58,985 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:58,985 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:58,985 INFO L426 AbstractCegarLoop]: === Iteration 892 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:58,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:58,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1254526270, now seen corresponding path program 886 times [2020-01-16 19:04:58,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:58,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721235886] [2020-01-16 19:04:58,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:59,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-01-16 19:04:59,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721235886] [2020-01-16 19:04:59,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:59,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:59,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124814964] [2020-01-16 19:04:59,270 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:59,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:59,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:59,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:59,270 INFO L87 Difference]: Start difference. First operand 384 states and 1320 transitions. Second operand 9 states. [2020-01-16 19:04:59,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:59,382 INFO L93 Difference]: Finished difference Result 558 states and 1674 transitions. [2020-01-16 19:04:59,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:59,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:59,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:59,384 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:04:59,384 INFO L226 Difference]: Without dead ends: 543 [2020-01-16 19:04:59,384 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:59,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-01-16 19:04:59,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 381. [2020-01-16 19:04:59,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:04:59,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1314 transitions. [2020-01-16 19:04:59,393 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1314 transitions. Word has length 22 [2020-01-16 19:04:59,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:59,393 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1314 transitions. [2020-01-16 19:04:59,393 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1314 transitions. [2020-01-16 19:04:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:59,394 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:59,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:04:59,394 INFO L426 AbstractCegarLoop]: === Iteration 893 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:59,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:59,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2093446538, now seen corresponding path program 887 times [2020-01-16 19:04:59,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:59,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642137825] [2020-01-16 19:04:59,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:04:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:04:59,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642137825] [2020-01-16 19:04:59,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:04:59,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:04:59,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419772393] [2020-01-16 19:04:59,683 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:04:59,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:04:59,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:04:59,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:04:59,684 INFO L87 Difference]: Start difference. First operand 381 states and 1314 transitions. Second operand 9 states. [2020-01-16 19:04:59,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:04:59,771 INFO L93 Difference]: Finished difference Result 562 states and 1672 transitions. [2020-01-16 19:04:59,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:04:59,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:04:59,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:04:59,773 INFO L225 Difference]: With dead ends: 562 [2020-01-16 19:04:59,773 INFO L226 Difference]: Without dead ends: 553 [2020-01-16 19:04:59,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:04:59,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-01-16 19:04:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 382. [2020-01-16 19:04:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:04:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-01-16 19:04:59,782 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-01-16 19:04:59,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:04:59,782 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-01-16 19:04:59,782 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:04:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-01-16 19:04:59,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:04:59,783 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:04:59,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, 1, 1, 1] [2020-01-16 19:04:59,783 INFO L426 AbstractCegarLoop]: === Iteration 894 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:04:59,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:04:59,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1558216736, now seen corresponding path program 888 times [2020-01-16 19:04:59,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:04:59,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053867683] [2020-01-16 19:04:59,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:04:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:00,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-01-16 19:05:00,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053867683] [2020-01-16 19:05:00,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:00,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:00,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544956391] [2020-01-16 19:05:00,063 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:00,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:00,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:00,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:00,063 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:05:00,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:00,200 INFO L93 Difference]: Finished difference Result 556 states and 1669 transitions. [2020-01-16 19:05:00,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:00,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:00,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:00,202 INFO L225 Difference]: With dead ends: 556 [2020-01-16 19:05:00,202 INFO L226 Difference]: Without dead ends: 540 [2020-01-16 19:05:00,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:00,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-01-16 19:05:00,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 378. [2020-01-16 19:05:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:05:00,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1309 transitions. [2020-01-16 19:05:00,211 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1309 transitions. Word has length 22 [2020-01-16 19:05:00,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:00,212 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1309 transitions. [2020-01-16 19:05:00,212 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1309 transitions. [2020-01-16 19:05:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:00,212 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:00,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, 1, 1, 1] [2020-01-16 19:05:00,212 INFO L426 AbstractCegarLoop]: === Iteration 895 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:00,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:00,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1640194754, now seen corresponding path program 889 times [2020-01-16 19:05:00,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:00,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042863513] [2020-01-16 19:05:00,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:00,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:00,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042863513] [2020-01-16 19:05:00,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:00,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:00,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596977520] [2020-01-16 19:05:00,500 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:00,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:00,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:00,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:00,501 INFO L87 Difference]: Start difference. First operand 378 states and 1309 transitions. Second operand 9 states. [2020-01-16 19:05:00,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:00,594 INFO L93 Difference]: Finished difference Result 598 states and 1763 transitions. [2020-01-16 19:05:00,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:00,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:00,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:00,595 INFO L225 Difference]: With dead ends: 598 [2020-01-16 19:05:00,595 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 19:05:00,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:00,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 19:05:00,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 388. [2020-01-16 19:05:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:05:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-01-16 19:05:00,604 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-01-16 19:05:00,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:00,605 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-01-16 19:05:00,605 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-01-16 19:05:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:00,605 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:00,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, 1, 1, 1] [2020-01-16 19:05:00,605 INFO L426 AbstractCegarLoop]: === Iteration 896 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:00,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:00,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1064506656, now seen corresponding path program 890 times [2020-01-16 19:05:00,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:00,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671283173] [2020-01-16 19:05:00,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:00,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:00,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671283173] [2020-01-16 19:05:00,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:00,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:00,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677266986] [2020-01-16 19:05:00,891 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:00,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:00,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:00,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:00,891 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:05:01,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:01,009 INFO L93 Difference]: Finished difference Result 593 states and 1750 transitions. [2020-01-16 19:05:01,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:01,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:01,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:01,011 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:05:01,012 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:05:01,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:01,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:05:01,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 384. [2020-01-16 19:05:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:05:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1329 transitions. [2020-01-16 19:05:01,020 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1329 transitions. Word has length 22 [2020-01-16 19:05:01,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:01,021 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1329 transitions. [2020-01-16 19:05:01,021 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1329 transitions. [2020-01-16 19:05:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:01,021 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:01,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, 1, 1, 1] [2020-01-16 19:05:01,021 INFO L426 AbstractCegarLoop]: === Iteration 897 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:01,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:01,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1741106926, now seen corresponding path program 891 times [2020-01-16 19:05:01,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:01,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527782296] [2020-01-16 19:05:01,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:01,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527782296] [2020-01-16 19:05:01,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:01,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:01,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708206182] [2020-01-16 19:05:01,314 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:01,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:01,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:01,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:01,314 INFO L87 Difference]: Start difference. First operand 384 states and 1329 transitions. Second operand 9 states. [2020-01-16 19:05:01,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:01,423 INFO L93 Difference]: Finished difference Result 596 states and 1755 transitions. [2020-01-16 19:05:01,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:01,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:01,431 INFO L225 Difference]: With dead ends: 596 [2020-01-16 19:05:01,431 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:05:01,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:01,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:05:01,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 387. [2020-01-16 19:05:01,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:05:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1333 transitions. [2020-01-16 19:05:01,442 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1333 transitions. Word has length 22 [2020-01-16 19:05:01,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:01,442 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1333 transitions. [2020-01-16 19:05:01,442 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1333 transitions. [2020-01-16 19:05:01,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:01,443 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:01,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:01,443 INFO L426 AbstractCegarLoop]: === Iteration 898 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:01,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:01,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1867743300, now seen corresponding path program 892 times [2020-01-16 19:05:01,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:01,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374485557] [2020-01-16 19:05:01,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:01,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-01-16 19:05:01,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374485557] [2020-01-16 19:05:01,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:01,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:01,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778931772] [2020-01-16 19:05:01,741 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:01,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:01,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:01,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:01,741 INFO L87 Difference]: Start difference. First operand 387 states and 1333 transitions. Second operand 9 states. [2020-01-16 19:05:01,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:01,851 INFO L93 Difference]: Finished difference Result 590 states and 1741 transitions. [2020-01-16 19:05:01,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:01,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:01,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:01,853 INFO L225 Difference]: With dead ends: 590 [2020-01-16 19:05:01,853 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:05:01,853 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:01,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:05:01,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 384. [2020-01-16 19:05:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:05:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1326 transitions. [2020-01-16 19:05:01,863 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1326 transitions. Word has length 22 [2020-01-16 19:05:01,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:01,863 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1326 transitions. [2020-01-16 19:05:01,863 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1326 transitions. [2020-01-16 19:05:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:01,864 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:01,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, 1, 1, 1] [2020-01-16 19:05:01,864 INFO L426 AbstractCegarLoop]: === Iteration 899 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:01,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:01,864 INFO L82 PathProgramCache]: Analyzing trace with hash -547274868, now seen corresponding path program 893 times [2020-01-16 19:05:01,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:01,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53517424] [2020-01-16 19:05:01,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:02,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-01-16 19:05:02,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53517424] [2020-01-16 19:05:02,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:02,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:02,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820581398] [2020-01-16 19:05:02,156 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:02,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:02,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:02,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:02,156 INFO L87 Difference]: Start difference. First operand 384 states and 1326 transitions. Second operand 9 states. [2020-01-16 19:05:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:02,272 INFO L93 Difference]: Finished difference Result 585 states and 1732 transitions. [2020-01-16 19:05:02,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:02,272 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:02,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:02,273 INFO L225 Difference]: With dead ends: 585 [2020-01-16 19:05:02,274 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:05:02,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:05:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 386. [2020-01-16 19:05:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:05:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1329 transitions. [2020-01-16 19:05:02,283 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1329 transitions. Word has length 22 [2020-01-16 19:05:02,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:02,283 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1329 transitions. [2020-01-16 19:05:02,283 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:02,283 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1329 transitions. [2020-01-16 19:05:02,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:02,283 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:02,284 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:02,284 INFO L426 AbstractCegarLoop]: === Iteration 900 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:02,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:02,284 INFO L82 PathProgramCache]: Analyzing trace with hash 794657920, now seen corresponding path program 894 times [2020-01-16 19:05:02,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:02,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804933942] [2020-01-16 19:05:02,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:02,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-01-16 19:05:02,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804933942] [2020-01-16 19:05:02,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:02,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:02,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804587114] [2020-01-16 19:05:02,599 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:02,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:02,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:02,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:02,599 INFO L87 Difference]: Start difference. First operand 386 states and 1329 transitions. Second operand 9 states. [2020-01-16 19:05:02,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:02,715 INFO L93 Difference]: Finished difference Result 584 states and 1728 transitions. [2020-01-16 19:05:02,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:02,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:02,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:02,717 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:05:02,717 INFO L226 Difference]: Without dead ends: 569 [2020-01-16 19:05:02,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:02,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-01-16 19:05:02,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 381. [2020-01-16 19:05:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:05:02,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1319 transitions. [2020-01-16 19:05:02,726 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1319 transitions. Word has length 22 [2020-01-16 19:05:02,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:02,726 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1319 transitions. [2020-01-16 19:05:02,726 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:02,726 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1319 transitions. [2020-01-16 19:05:02,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:02,727 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:02,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, 1, 1, 1] [2020-01-16 19:05:02,727 INFO L426 AbstractCegarLoop]: === Iteration 901 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:02,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:02,727 INFO L82 PathProgramCache]: Analyzing trace with hash -119858186, now seen corresponding path program 895 times [2020-01-16 19:05:02,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:02,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889862623] [2020-01-16 19:05:02,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:03,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889862623] [2020-01-16 19:05:03,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:03,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:03,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146538922] [2020-01-16 19:05:03,034 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:03,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:03,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:03,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:03,034 INFO L87 Difference]: Start difference. First operand 381 states and 1319 transitions. Second operand 9 states. [2020-01-16 19:05:03,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:03,132 INFO L93 Difference]: Finished difference Result 600 states and 1767 transitions. [2020-01-16 19:05:03,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:03,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:03,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:03,134 INFO L225 Difference]: With dead ends: 600 [2020-01-16 19:05:03,134 INFO L226 Difference]: Without dead ends: 584 [2020-01-16 19:05:03,134 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:03,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-01-16 19:05:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 389. [2020-01-16 19:05:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:05:03,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1339 transitions. [2020-01-16 19:05:03,143 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1339 transitions. Word has length 22 [2020-01-16 19:05:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:03,143 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1339 transitions. [2020-01-16 19:05:03,143 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1339 transitions. [2020-01-16 19:05:03,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:03,144 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:03,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, 1, 1, 1] [2020-01-16 19:05:03,144 INFO L426 AbstractCegarLoop]: === Iteration 902 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:03,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:03,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1470407700, now seen corresponding path program 896 times [2020-01-16 19:05:03,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:03,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392026030] [2020-01-16 19:05:03,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:03,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392026030] [2020-01-16 19:05:03,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:03,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:03,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640587611] [2020-01-16 19:05:03,447 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:03,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:03,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:03,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:03,447 INFO L87 Difference]: Start difference. First operand 389 states and 1339 transitions. Second operand 9 states. [2020-01-16 19:05:03,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:03,588 INFO L93 Difference]: Finished difference Result 595 states and 1754 transitions. [2020-01-16 19:05:03,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:03,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:03,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:03,590 INFO L225 Difference]: With dead ends: 595 [2020-01-16 19:05:03,590 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:05:03,590 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:03,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:05:03,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 385. [2020-01-16 19:05:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:05:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1329 transitions. [2020-01-16 19:05:03,599 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1329 transitions. Word has length 22 [2020-01-16 19:05:03,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:03,599 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1329 transitions. [2020-01-16 19:05:03,599 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1329 transitions. [2020-01-16 19:05:03,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:03,600 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:03,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, 1, 1, 1] [2020-01-16 19:05:03,600 INFO L426 AbstractCegarLoop]: === Iteration 903 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:03,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:03,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1468534938, now seen corresponding path program 897 times [2020-01-16 19:05:03,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:03,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605321931] [2020-01-16 19:05:03,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:03,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-01-16 19:05:03,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605321931] [2020-01-16 19:05:03,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:03,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:03,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195761378] [2020-01-16 19:05:03,896 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:03,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:03,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:03,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:03,896 INFO L87 Difference]: Start difference. First operand 385 states and 1329 transitions. Second operand 9 states. [2020-01-16 19:05:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:04,013 INFO L93 Difference]: Finished difference Result 594 states and 1754 transitions. [2020-01-16 19:05:04,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:04,013 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:04,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:04,014 INFO L225 Difference]: With dead ends: 594 [2020-01-16 19:05:04,015 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:05:04,015 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:04,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:05:04,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 390. [2020-01-16 19:05:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:05:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1337 transitions. [2020-01-16 19:05:04,024 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1337 transitions. Word has length 22 [2020-01-16 19:05:04,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:04,024 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1337 transitions. [2020-01-16 19:05:04,024 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1337 transitions. [2020-01-16 19:05:04,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:04,025 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:04,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, 1, 1, 1] [2020-01-16 19:05:04,025 INFO L426 AbstractCegarLoop]: === Iteration 904 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:04,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:04,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1125104456, now seen corresponding path program 898 times [2020-01-16 19:05:04,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:04,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698453194] [2020-01-16 19:05:04,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:04,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-01-16 19:05:04,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698453194] [2020-01-16 19:05:04,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:04,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:04,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445937577] [2020-01-16 19:05:04,318 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:04,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:04,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:04,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:04,318 INFO L87 Difference]: Start difference. First operand 390 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:05:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:04,428 INFO L93 Difference]: Finished difference Result 581 states and 1734 transitions. [2020-01-16 19:05:04,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:04,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:04,430 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:05:04,430 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 19:05:04,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:04,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 19:05:04,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 385. [2020-01-16 19:05:04,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:05:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1325 transitions. [2020-01-16 19:05:04,439 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1325 transitions. Word has length 22 [2020-01-16 19:05:04,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:04,439 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1325 transitions. [2020-01-16 19:05:04,439 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:04,440 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1325 transitions. [2020-01-16 19:05:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:04,440 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:04,440 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:04,440 INFO L426 AbstractCegarLoop]: === Iteration 905 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:04,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:04,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1611135944, now seen corresponding path program 899 times [2020-01-16 19:05:04,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:04,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765045040] [2020-01-16 19:05:04,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:04,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765045040] [2020-01-16 19:05:04,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:04,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:04,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828398834] [2020-01-16 19:05:04,746 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:04,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:04,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:04,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:04,747 INFO L87 Difference]: Start difference. First operand 385 states and 1325 transitions. Second operand 9 states. [2020-01-16 19:05:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:04,866 INFO L93 Difference]: Finished difference Result 587 states and 1736 transitions. [2020-01-16 19:05:04,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:04,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:04,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:04,868 INFO L225 Difference]: With dead ends: 587 [2020-01-16 19:05:04,868 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:05:04,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:05:04,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 388. [2020-01-16 19:05:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:05:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1330 transitions. [2020-01-16 19:05:04,878 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1330 transitions. Word has length 22 [2020-01-16 19:05:04,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:04,878 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1330 transitions. [2020-01-16 19:05:04,879 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:04,879 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1330 transitions. [2020-01-16 19:05:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:04,879 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:04,879 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:04,879 INFO L426 AbstractCegarLoop]: === Iteration 906 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:04,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:04,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1810090672, now seen corresponding path program 900 times [2020-01-16 19:05:04,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:04,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144102846] [2020-01-16 19:05:04,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:05,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-01-16 19:05:05,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144102846] [2020-01-16 19:05:05,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:05,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:05,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072152101] [2020-01-16 19:05:05,181 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:05,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:05,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:05,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:05,182 INFO L87 Difference]: Start difference. First operand 388 states and 1330 transitions. Second operand 9 states. [2020-01-16 19:05:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:05,292 INFO L93 Difference]: Finished difference Result 579 states and 1727 transitions. [2020-01-16 19:05:05,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:05,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:05,294 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:05:05,294 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:05:05,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:05,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:05:05,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 381. [2020-01-16 19:05:05,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:05:05,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1316 transitions. [2020-01-16 19:05:05,304 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1316 transitions. Word has length 22 [2020-01-16 19:05:05,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:05,304 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1316 transitions. [2020-01-16 19:05:05,304 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:05,304 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1316 transitions. [2020-01-16 19:05:05,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:05,305 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:05,305 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:05,305 INFO L426 AbstractCegarLoop]: === Iteration 907 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:05,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:05,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1142625094, now seen corresponding path program 901 times [2020-01-16 19:05:05,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:05,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525364219] [2020-01-16 19:05:05,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:05,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-01-16 19:05:05,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525364219] [2020-01-16 19:05:05,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:05,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:05,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346292449] [2020-01-16 19:05:05,588 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:05,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:05,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:05,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:05,589 INFO L87 Difference]: Start difference. First operand 381 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:05:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:05,706 INFO L93 Difference]: Finished difference Result 595 states and 1750 transitions. [2020-01-16 19:05:05,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:05,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:05,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:05,708 INFO L225 Difference]: With dead ends: 595 [2020-01-16 19:05:05,708 INFO L226 Difference]: Without dead ends: 579 [2020-01-16 19:05:05,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:05,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-01-16 19:05:05,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 387. [2020-01-16 19:05:05,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:05:05,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1330 transitions. [2020-01-16 19:05:05,717 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1330 transitions. Word has length 22 [2020-01-16 19:05:05,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:05,717 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1330 transitions. [2020-01-16 19:05:05,718 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:05,718 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1330 transitions. [2020-01-16 19:05:05,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:05,718 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:05,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, 1, 1, 1] [2020-01-16 19:05:05,718 INFO L426 AbstractCegarLoop]: === Iteration 908 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:05,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:05,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1269261468, now seen corresponding path program 902 times [2020-01-16 19:05:05,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:05,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551825595] [2020-01-16 19:05:05,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:06,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-01-16 19:05:06,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551825595] [2020-01-16 19:05:06,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:06,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:06,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458885238] [2020-01-16 19:05:06,002 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:06,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:06,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:06,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:06,003 INFO L87 Difference]: Start difference. First operand 387 states and 1330 transitions. Second operand 9 states. [2020-01-16 19:05:06,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:06,116 INFO L93 Difference]: Finished difference Result 589 states and 1736 transitions. [2020-01-16 19:05:06,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:06,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:06,118 INFO L225 Difference]: With dead ends: 589 [2020-01-16 19:05:06,118 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:05:06,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:06,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:05:06,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 384. [2020-01-16 19:05:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:05:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-01-16 19:05:06,127 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-01-16 19:05:06,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:06,128 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-01-16 19:05:06,128 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-01-16 19:05:06,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:06,128 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:06,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, 1, 1, 1] [2020-01-16 19:05:06,128 INFO L426 AbstractCegarLoop]: === Iteration 909 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:06,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:06,129 INFO L82 PathProgramCache]: Analyzing trace with hash 66913938, now seen corresponding path program 903 times [2020-01-16 19:05:06,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:06,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515790461] [2020-01-16 19:05:06,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:06,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:06,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515790461] [2020-01-16 19:05:06,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:06,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:06,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087982316] [2020-01-16 19:05:06,414 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:06,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:06,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:06,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:06,415 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:05:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:06,500 INFO L93 Difference]: Finished difference Result 591 states and 1743 transitions. [2020-01-16 19:05:06,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:06,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:06,502 INFO L225 Difference]: With dead ends: 591 [2020-01-16 19:05:06,502 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:05:06,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:06,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:05:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 389. [2020-01-16 19:05:06,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:05:06,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1331 transitions. [2020-01-16 19:05:06,511 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1331 transitions. Word has length 22 [2020-01-16 19:05:06,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:06,512 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1331 transitions. [2020-01-16 19:05:06,512 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:06,512 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1331 transitions. [2020-01-16 19:05:06,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:06,512 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:06,512 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:06,512 INFO L426 AbstractCegarLoop]: === Iteration 910 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:06,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:06,513 INFO L82 PathProgramCache]: Analyzing trace with hash -41585508, now seen corresponding path program 904 times [2020-01-16 19:05:06,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:06,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978688579] [2020-01-16 19:05:06,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:06,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:06,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978688579] [2020-01-16 19:05:06,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:06,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:06,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185436989] [2020-01-16 19:05:06,825 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:06,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:06,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:06,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:06,826 INFO L87 Difference]: Start difference. First operand 389 states and 1331 transitions. Second operand 9 states. [2020-01-16 19:05:06,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:06,958 INFO L93 Difference]: Finished difference Result 578 states and 1723 transitions. [2020-01-16 19:05:06,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:06,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:06,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:06,960 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:05:06,960 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:05:06,960 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:06,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:05:06,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 384. [2020-01-16 19:05:06,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:05:06,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1320 transitions. [2020-01-16 19:05:06,969 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1320 transitions. Word has length 22 [2020-01-16 19:05:06,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:06,969 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1320 transitions. [2020-01-16 19:05:06,969 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1320 transitions. [2020-01-16 19:05:06,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:06,970 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:06,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, 1, 1, 1] [2020-01-16 19:05:06,970 INFO L426 AbstractCegarLoop]: === Iteration 911 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:06,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:06,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1952620448, now seen corresponding path program 905 times [2020-01-16 19:05:06,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:06,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137785487] [2020-01-16 19:05:06,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:07,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:07,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137785487] [2020-01-16 19:05:07,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:07,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:07,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128526793] [2020-01-16 19:05:07,242 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:07,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:07,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:07,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:07,243 INFO L87 Difference]: Start difference. First operand 384 states and 1320 transitions. Second operand 9 states. [2020-01-16 19:05:07,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:07,359 INFO L93 Difference]: Finished difference Result 582 states and 1721 transitions. [2020-01-16 19:05:07,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:07,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:07,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:07,361 INFO L225 Difference]: With dead ends: 582 [2020-01-16 19:05:07,361 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:05:07,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:07,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:05:07,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 386. [2020-01-16 19:05:07,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:05:07,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1323 transitions. [2020-01-16 19:05:07,371 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1323 transitions. Word has length 22 [2020-01-16 19:05:07,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:07,371 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1323 transitions. [2020-01-16 19:05:07,371 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:07,371 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1323 transitions. [2020-01-16 19:05:07,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:07,372 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:07,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, 1, 1, 1] [2020-01-16 19:05:07,372 INFO L426 AbstractCegarLoop]: === Iteration 912 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:07,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:07,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2125868140, now seen corresponding path program 906 times [2020-01-16 19:05:07,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:07,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685096541] [2020-01-16 19:05:07,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:07,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685096541] [2020-01-16 19:05:07,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:07,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:07,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072293805] [2020-01-16 19:05:07,651 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:07,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:07,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:07,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:07,652 INFO L87 Difference]: Start difference. First operand 386 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:05:07,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:07,774 INFO L93 Difference]: Finished difference Result 575 states and 1715 transitions. [2020-01-16 19:05:07,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:07,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:07,776 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:05:07,776 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:05:07,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:07,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:05:07,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 381. [2020-01-16 19:05:07,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:05:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1313 transitions. [2020-01-16 19:05:07,785 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1313 transitions. Word has length 22 [2020-01-16 19:05:07,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:07,785 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1313 transitions. [2020-01-16 19:05:07,785 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:07,785 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1313 transitions. [2020-01-16 19:05:07,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:07,786 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:07,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, 1, 1, 1] [2020-01-16 19:05:07,786 INFO L426 AbstractCegarLoop]: === Iteration 913 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:07,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:07,786 INFO L82 PathProgramCache]: Analyzing trace with hash -51665112, now seen corresponding path program 907 times [2020-01-16 19:05:07,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:07,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105527589] [2020-01-16 19:05:07,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:08,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-01-16 19:05:08,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105527589] [2020-01-16 19:05:08,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:08,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:08,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707352139] [2020-01-16 19:05:08,069 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:08,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:08,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:08,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:08,070 INFO L87 Difference]: Start difference. First operand 381 states and 1313 transitions. Second operand 9 states. [2020-01-16 19:05:08,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:08,192 INFO L93 Difference]: Finished difference Result 576 states and 1710 transitions. [2020-01-16 19:05:08,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:08,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:08,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:08,194 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:05:08,194 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:05:08,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:08,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:05:08,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 385. [2020-01-16 19:05:08,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:05:08,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1323 transitions. [2020-01-16 19:05:08,203 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1323 transitions. Word has length 22 [2020-01-16 19:05:08,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:08,203 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1323 transitions. [2020-01-16 19:05:08,203 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:08,203 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1323 transitions. [2020-01-16 19:05:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:08,204 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:08,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, 1, 1, 1] [2020-01-16 19:05:08,204 INFO L426 AbstractCegarLoop]: === Iteration 914 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:08,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:08,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1290267676, now seen corresponding path program 908 times [2020-01-16 19:05:08,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:08,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936565340] [2020-01-16 19:05:08,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:08,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-01-16 19:05:08,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936565340] [2020-01-16 19:05:08,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:08,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:08,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912470970] [2020-01-16 19:05:08,497 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:08,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:08,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:08,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:08,498 INFO L87 Difference]: Start difference. First operand 385 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:05:08,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:08,611 INFO L93 Difference]: Finished difference Result 575 states and 1706 transitions. [2020-01-16 19:05:08,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:08,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:08,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:08,613 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:05:08,613 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:05:08,613 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:08,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:05:08,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 383. [2020-01-16 19:05:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:05:08,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-01-16 19:05:08,622 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-01-16 19:05:08,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:08,622 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-01-16 19:05:08,622 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:08,622 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-01-16 19:05:08,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:08,622 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:08,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, 1, 1, 1] [2020-01-16 19:05:08,623 INFO L426 AbstractCegarLoop]: === Iteration 915 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:08,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:08,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1127376268, now seen corresponding path program 909 times [2020-01-16 19:05:08,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:08,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63596056] [2020-01-16 19:05:08,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:08,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63596056] [2020-01-16 19:05:08,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:08,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:08,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112166387] [2020-01-16 19:05:08,907 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:08,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:08,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:08,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:08,907 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:05:09,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:09,020 INFO L93 Difference]: Finished difference Result 576 states and 1710 transitions. [2020-01-16 19:05:09,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:09,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:09,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:09,021 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:05:09,021 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:05:09,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:09,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:05:09,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 386. [2020-01-16 19:05:09,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:05:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1323 transitions. [2020-01-16 19:05:09,031 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1323 transitions. Word has length 22 [2020-01-16 19:05:09,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:09,032 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1323 transitions. [2020-01-16 19:05:09,032 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:09,032 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1323 transitions. [2020-01-16 19:05:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:09,032 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:09,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, 1, 1, 1] [2020-01-16 19:05:09,032 INFO L426 AbstractCegarLoop]: === Iteration 916 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:09,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1339192868, now seen corresponding path program 910 times [2020-01-16 19:05:09,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:09,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064901487] [2020-01-16 19:05:09,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:09,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064901487] [2020-01-16 19:05:09,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:09,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:09,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224625460] [2020-01-16 19:05:09,337 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:09,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:09,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:09,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:09,337 INFO L87 Difference]: Start difference. First operand 386 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:05:09,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:09,450 INFO L93 Difference]: Finished difference Result 568 states and 1701 transitions. [2020-01-16 19:05:09,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:09,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:09,452 INFO L225 Difference]: With dead ends: 568 [2020-01-16 19:05:09,452 INFO L226 Difference]: Without dead ends: 553 [2020-01-16 19:05:09,452 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:09,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-01-16 19:05:09,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 383. [2020-01-16 19:05:09,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:05:09,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1316 transitions. [2020-01-16 19:05:09,462 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1316 transitions. Word has length 22 [2020-01-16 19:05:09,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:09,462 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1316 transitions. [2020-01-16 19:05:09,462 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1316 transitions. [2020-01-16 19:05:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:09,462 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:09,463 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:09,463 INFO L426 AbstractCegarLoop]: === Iteration 917 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:09,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:09,463 INFO L82 PathProgramCache]: Analyzing trace with hash -858528860, now seen corresponding path program 911 times [2020-01-16 19:05:09,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:09,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554665716] [2020-01-16 19:05:09,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:09,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554665716] [2020-01-16 19:05:09,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:09,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:09,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025551287] [2020-01-16 19:05:09,743 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:09,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:09,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:09,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:09,743 INFO L87 Difference]: Start difference. First operand 383 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:05:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:09,853 INFO L93 Difference]: Finished difference Result 574 states and 1703 transitions. [2020-01-16 19:05:09,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:09,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:09,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:09,855 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:05:09,855 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 19:05:09,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:09,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 19:05:09,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 385. [2020-01-16 19:05:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:05:09,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1319 transitions. [2020-01-16 19:05:09,864 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1319 transitions. Word has length 22 [2020-01-16 19:05:09,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:09,865 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1319 transitions. [2020-01-16 19:05:09,865 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1319 transitions. [2020-01-16 19:05:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:09,865 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:09,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, 1, 1, 1] [2020-01-16 19:05:09,865 INFO L426 AbstractCegarLoop]: === Iteration 918 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:09,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:09,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1031776552, now seen corresponding path program 912 times [2020-01-16 19:05:09,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:09,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032359523] [2020-01-16 19:05:09,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:10,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032359523] [2020-01-16 19:05:10,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:10,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:10,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683859594] [2020-01-16 19:05:10,155 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:10,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:10,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:10,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:10,155 INFO L87 Difference]: Start difference. First operand 385 states and 1319 transitions. Second operand 9 states. [2020-01-16 19:05:10,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:10,280 INFO L93 Difference]: Finished difference Result 567 states and 1697 transitions. [2020-01-16 19:05:10,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:10,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:10,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:10,282 INFO L225 Difference]: With dead ends: 567 [2020-01-16 19:05:10,282 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:05:10,282 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:10,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:05:10,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 378. [2020-01-16 19:05:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:05:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1307 transitions. [2020-01-16 19:05:10,292 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1307 transitions. Word has length 22 [2020-01-16 19:05:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:10,292 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1307 transitions. [2020-01-16 19:05:10,292 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1307 transitions. [2020-01-16 19:05:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:10,292 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:10,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, 1, 1, 1] [2020-01-16 19:05:10,292 INFO L426 AbstractCegarLoop]: === Iteration 919 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:10,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:10,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1272520550, now seen corresponding path program 913 times [2020-01-16 19:05:10,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:10,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284799913] [2020-01-16 19:05:10,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:10,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-01-16 19:05:10,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284799913] [2020-01-16 19:05:10,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:10,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:10,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42826847] [2020-01-16 19:05:10,567 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:10,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:10,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:10,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:10,568 INFO L87 Difference]: Start difference. First operand 378 states and 1307 transitions. Second operand 9 states. [2020-01-16 19:05:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:10,650 INFO L93 Difference]: Finished difference Result 577 states and 1698 transitions. [2020-01-16 19:05:10,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:10,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:10,652 INFO L225 Difference]: With dead ends: 577 [2020-01-16 19:05:10,652 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:05:10,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:05:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 384. [2020-01-16 19:05:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:05:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-01-16 19:05:10,662 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-01-16 19:05:10,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:10,662 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-01-16 19:05:10,662 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:10,662 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-01-16 19:05:10,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:10,662 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:10,662 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:10,662 INFO L426 AbstractCegarLoop]: === Iteration 920 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:10,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:10,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1833589042, now seen corresponding path program 914 times [2020-01-16 19:05:10,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:10,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29330076] [2020-01-16 19:05:10,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:10,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29330076] [2020-01-16 19:05:10,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:10,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:10,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549121486] [2020-01-16 19:05:10,933 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:10,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:10,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:10,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:10,933 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:05:11,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:11,018 INFO L93 Difference]: Finished difference Result 570 states and 1683 transitions. [2020-01-16 19:05:11,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:11,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:11,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:11,020 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:05:11,020 INFO L226 Difference]: Without dead ends: 559 [2020-01-16 19:05:11,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:11,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-01-16 19:05:11,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 382. [2020-01-16 19:05:11,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:05:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1319 transitions. [2020-01-16 19:05:11,036 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1319 transitions. Word has length 22 [2020-01-16 19:05:11,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:11,036 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1319 transitions. [2020-01-16 19:05:11,036 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:11,036 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1319 transitions. [2020-01-16 19:05:11,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:11,037 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:11,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, 1, 1, 1] [2020-01-16 19:05:11,037 INFO L426 AbstractCegarLoop]: === Iteration 921 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:11,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:11,037 INFO L82 PathProgramCache]: Analyzing trace with hash -327917304, now seen corresponding path program 915 times [2020-01-16 19:05:11,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:11,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314088431] [2020-01-16 19:05:11,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:11,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314088431] [2020-01-16 19:05:11,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:11,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:11,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939969739] [2020-01-16 19:05:11,307 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:11,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:11,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:11,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:11,308 INFO L87 Difference]: Start difference. First operand 382 states and 1319 transitions. Second operand 9 states. [2020-01-16 19:05:11,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:11,404 INFO L93 Difference]: Finished difference Result 579 states and 1701 transitions. [2020-01-16 19:05:11,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:11,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:11,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:11,406 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:05:11,406 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:05:11,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:11,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:05:11,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 385. [2020-01-16 19:05:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:05:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1323 transitions. [2020-01-16 19:05:11,415 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1323 transitions. Word has length 22 [2020-01-16 19:05:11,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:11,415 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1323 transitions. [2020-01-16 19:05:11,415 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:11,415 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1323 transitions. [2020-01-16 19:05:11,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:11,416 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:11,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, 1, 1, 1] [2020-01-16 19:05:11,416 INFO L426 AbstractCegarLoop]: === Iteration 922 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:11,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:11,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1290120966, now seen corresponding path program 916 times [2020-01-16 19:05:11,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:11,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870315529] [2020-01-16 19:05:11,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:11,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870315529] [2020-01-16 19:05:11,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:11,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:11,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460918466] [2020-01-16 19:05:11,689 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:11,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:11,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:11,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:11,689 INFO L87 Difference]: Start difference. First operand 385 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:05:11,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:11,800 INFO L93 Difference]: Finished difference Result 573 states and 1687 transitions. [2020-01-16 19:05:11,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:11,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:11,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:11,802 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:05:11,802 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:05:11,802 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:11,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:05:11,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-01-16 19:05:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:05:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1317 transitions. [2020-01-16 19:05:11,811 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1317 transitions. Word has length 22 [2020-01-16 19:05:11,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:11,811 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1317 transitions. [2020-01-16 19:05:11,811 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1317 transitions. [2020-01-16 19:05:11,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:11,812 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:11,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, 1, 1, 1] [2020-01-16 19:05:11,812 INFO L426 AbstractCegarLoop]: === Iteration 923 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:11,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:11,812 INFO L82 PathProgramCache]: Analyzing trace with hash -273195078, now seen corresponding path program 917 times [2020-01-16 19:05:11,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:11,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116206540] [2020-01-16 19:05:11,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:12,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-01-16 19:05:12,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116206540] [2020-01-16 19:05:12,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:12,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:12,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264000753] [2020-01-16 19:05:12,107 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:12,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:12,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:12,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:12,107 INFO L87 Difference]: Start difference. First operand 382 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:05:12,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:12,194 INFO L93 Difference]: Finished difference Result 563 states and 1668 transitions. [2020-01-16 19:05:12,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:12,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:12,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:12,196 INFO L225 Difference]: With dead ends: 563 [2020-01-16 19:05:12,196 INFO L226 Difference]: Without dead ends: 554 [2020-01-16 19:05:12,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:12,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-01-16 19:05:12,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 383. [2020-01-16 19:05:12,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:05:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-01-16 19:05:12,205 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-01-16 19:05:12,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:12,205 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-01-16 19:05:12,205 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:12,206 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-01-16 19:05:12,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:12,206 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:12,206 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:12,206 INFO L426 AbstractCegarLoop]: === Iteration 924 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:12,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:12,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1337745880, now seen corresponding path program 918 times [2020-01-16 19:05:12,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:12,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989685714] [2020-01-16 19:05:12,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:12,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-01-16 19:05:12,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989685714] [2020-01-16 19:05:12,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:12,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:12,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176671181] [2020-01-16 19:05:12,494 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:12,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:12,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:12,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:12,494 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:05:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:12,605 INFO L93 Difference]: Finished difference Result 564 states and 1669 transitions. [2020-01-16 19:05:12,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:12,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:12,607 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:05:12,607 INFO L226 Difference]: Without dead ends: 551 [2020-01-16 19:05:12,607 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:12,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-01-16 19:05:12,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 380. [2020-01-16 19:05:12,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:05:12,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1313 transitions. [2020-01-16 19:05:12,616 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1313 transitions. Word has length 22 [2020-01-16 19:05:12,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:12,616 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1313 transitions. [2020-01-16 19:05:12,616 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1313 transitions. [2020-01-16 19:05:12,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:12,617 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:12,617 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:12,617 INFO L426 AbstractCegarLoop]: === Iteration 925 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:12,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:12,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1693749326, now seen corresponding path program 919 times [2020-01-16 19:05:12,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:12,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745672522] [2020-01-16 19:05:12,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:12,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745672522] [2020-01-16 19:05:12,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:12,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:12,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264509541] [2020-01-16 19:05:12,888 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:12,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:12,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:12,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:12,889 INFO L87 Difference]: Start difference. First operand 380 states and 1313 transitions. Second operand 9 states. [2020-01-16 19:05:12,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:12,996 INFO L93 Difference]: Finished difference Result 579 states and 1702 transitions. [2020-01-16 19:05:12,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:12,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:12,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:12,998 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:05:12,998 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:05:12,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:13,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:05:13,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 384. [2020-01-16 19:05:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:05:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1321 transitions. [2020-01-16 19:05:13,006 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1321 transitions. Word has length 22 [2020-01-16 19:05:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:13,006 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1321 transitions. [2020-01-16 19:05:13,006 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:13,006 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1321 transitions. [2020-01-16 19:05:13,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:13,007 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:13,007 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:13,007 INFO L426 AbstractCegarLoop]: === Iteration 926 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:13,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:13,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1132680834, now seen corresponding path program 920 times [2020-01-16 19:05:13,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:13,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150370437] [2020-01-16 19:05:13,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:13,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-01-16 19:05:13,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150370437] [2020-01-16 19:05:13,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:13,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:13,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892288223] [2020-01-16 19:05:13,287 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:13,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:13,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:13,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:13,288 INFO L87 Difference]: Start difference. First operand 384 states and 1321 transitions. Second operand 9 states. [2020-01-16 19:05:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:13,374 INFO L93 Difference]: Finished difference Result 572 states and 1687 transitions. [2020-01-16 19:05:13,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:13,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:13,376 INFO L225 Difference]: With dead ends: 572 [2020-01-16 19:05:13,376 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:05:13,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:13,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:05:13,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 382. [2020-01-16 19:05:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:05:13,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1317 transitions. [2020-01-16 19:05:13,385 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1317 transitions. Word has length 22 [2020-01-16 19:05:13,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:13,385 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1317 transitions. [2020-01-16 19:05:13,385 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:13,385 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1317 transitions. [2020-01-16 19:05:13,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:13,386 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:13,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, 1, 1, 1] [2020-01-16 19:05:13,386 INFO L426 AbstractCegarLoop]: === Iteration 927 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:13,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:13,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2013472648, now seen corresponding path program 921 times [2020-01-16 19:05:13,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:13,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90350860] [2020-01-16 19:05:13,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:13,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-01-16 19:05:13,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90350860] [2020-01-16 19:05:13,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:13,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:13,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893622179] [2020-01-16 19:05:13,679 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:13,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:13,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:13,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:13,679 INFO L87 Difference]: Start difference. First operand 382 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:05:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:13,757 INFO L93 Difference]: Finished difference Result 577 states and 1701 transitions. [2020-01-16 19:05:13,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:13,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:13,759 INFO L225 Difference]: With dead ends: 577 [2020-01-16 19:05:13,759 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:05:13,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:13,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:05:13,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 387. [2020-01-16 19:05:13,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:05:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1325 transitions. [2020-01-16 19:05:13,768 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1325 transitions. Word has length 22 [2020-01-16 19:05:13,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:13,768 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1325 transitions. [2020-01-16 19:05:13,768 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:13,768 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1325 transitions. [2020-01-16 19:05:13,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:13,769 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:13,769 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:13,769 INFO L426 AbstractCegarLoop]: === Iteration 928 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:13,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:13,769 INFO L82 PathProgramCache]: Analyzing trace with hash -259577990, now seen corresponding path program 922 times [2020-01-16 19:05:13,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:13,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458164279] [2020-01-16 19:05:13,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:14,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-01-16 19:05:14,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458164279] [2020-01-16 19:05:14,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:14,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:14,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274552281] [2020-01-16 19:05:14,047 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:14,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:14,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:14,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:14,047 INFO L87 Difference]: Start difference. First operand 387 states and 1325 transitions. Second operand 9 states. [2020-01-16 19:05:14,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:14,160 INFO L93 Difference]: Finished difference Result 564 states and 1681 transitions. [2020-01-16 19:05:14,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:14,161 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:14,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:14,162 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:05:14,162 INFO L226 Difference]: Without dead ends: 547 [2020-01-16 19:05:14,162 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:14,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-01-16 19:05:14,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 382. [2020-01-16 19:05:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:05:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-01-16 19:05:14,171 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-01-16 19:05:14,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:14,171 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-01-16 19:05:14,171 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-01-16 19:05:14,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:14,171 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:14,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, 1, 1, 1] [2020-01-16 19:05:14,171 INFO L426 AbstractCegarLoop]: === Iteration 929 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:14,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:14,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2068194874, now seen corresponding path program 923 times [2020-01-16 19:05:14,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:14,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87402743] [2020-01-16 19:05:14,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:14,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-01-16 19:05:14,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87402743] [2020-01-16 19:05:14,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:14,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:14,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231836832] [2020-01-16 19:05:14,449 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:14,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:14,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:14,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:14,450 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:05:14,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:14,541 INFO L93 Difference]: Finished difference Result 566 states and 1675 transitions. [2020-01-16 19:05:14,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:14,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:14,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:14,542 INFO L225 Difference]: With dead ends: 566 [2020-01-16 19:05:14,543 INFO L226 Difference]: Without dead ends: 557 [2020-01-16 19:05:14,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:14,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-01-16 19:05:14,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 383. [2020-01-16 19:05:14,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:05:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1316 transitions. [2020-01-16 19:05:14,551 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1316 transitions. Word has length 22 [2020-01-16 19:05:14,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:14,551 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1316 transitions. [2020-01-16 19:05:14,551 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:14,551 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1316 transitions. [2020-01-16 19:05:14,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:14,552 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:14,552 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:14,552 INFO L426 AbstractCegarLoop]: === Iteration 930 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:14,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:14,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1691542620, now seen corresponding path program 924 times [2020-01-16 19:05:14,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:14,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810870825] [2020-01-16 19:05:14,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:14,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810870825] [2020-01-16 19:05:14,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:14,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:14,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480345364] [2020-01-16 19:05:14,827 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:14,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:14,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:14,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:14,827 INFO L87 Difference]: Start difference. First operand 383 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:05:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:14,927 INFO L93 Difference]: Finished difference Result 560 states and 1672 transitions. [2020-01-16 19:05:14,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:14,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:14,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:14,928 INFO L225 Difference]: With dead ends: 560 [2020-01-16 19:05:14,928 INFO L226 Difference]: Without dead ends: 545 [2020-01-16 19:05:14,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-01-16 19:05:14,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 380. [2020-01-16 19:05:14,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:05:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1311 transitions. [2020-01-16 19:05:14,937 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1311 transitions. Word has length 22 [2020-01-16 19:05:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:14,937 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1311 transitions. [2020-01-16 19:05:14,937 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1311 transitions. [2020-01-16 19:05:14,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:14,938 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:14,938 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:14,938 INFO L426 AbstractCegarLoop]: === Iteration 931 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:14,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:14,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1368153102, now seen corresponding path program 925 times [2020-01-16 19:05:14,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:14,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434246689] [2020-01-16 19:05:14,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:15,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-01-16 19:05:15,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434246689] [2020-01-16 19:05:15,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:15,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:15,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026136536] [2020-01-16 19:05:15,220 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:15,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:15,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:15,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:15,221 INFO L87 Difference]: Start difference. First operand 380 states and 1311 transitions. Second operand 9 states. [2020-01-16 19:05:15,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:15,302 INFO L93 Difference]: Finished difference Result 584 states and 1714 transitions. [2020-01-16 19:05:15,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:15,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:15,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:15,304 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:05:15,304 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:05:15,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:15,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:05:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 386. [2020-01-16 19:05:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:05:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1325 transitions. [2020-01-16 19:05:15,314 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1325 transitions. Word has length 22 [2020-01-16 19:05:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:15,314 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1325 transitions. [2020-01-16 19:05:15,314 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1325 transitions. [2020-01-16 19:05:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:15,315 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:15,315 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:15,315 INFO L426 AbstractCegarLoop]: === Iteration 932 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:15,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:15,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1964610532, now seen corresponding path program 926 times [2020-01-16 19:05:15,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:15,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116666170] [2020-01-16 19:05:15,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:15,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-01-16 19:05:15,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116666170] [2020-01-16 19:05:15,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:15,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:15,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442659190] [2020-01-16 19:05:15,581 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:15,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:15,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:15,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:15,582 INFO L87 Difference]: Start difference. First operand 386 states and 1325 transitions. Second operand 9 states. [2020-01-16 19:05:15,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:15,678 INFO L93 Difference]: Finished difference Result 578 states and 1700 transitions. [2020-01-16 19:05:15,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:15,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:15,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:15,680 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:05:15,680 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:05:15,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:15,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:05:15,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 383. [2020-01-16 19:05:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:05:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-01-16 19:05:15,689 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-01-16 19:05:15,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:15,690 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-01-16 19:05:15,690 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-01-16 19:05:15,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:15,690 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:15,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, 1, 1, 1] [2020-01-16 19:05:15,690 INFO L426 AbstractCegarLoop]: === Iteration 933 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:15,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:15,691 INFO L82 PathProgramCache]: Analyzing trace with hash -355460570, now seen corresponding path program 927 times [2020-01-16 19:05:15,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:15,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115730823] [2020-01-16 19:05:15,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:15,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-01-16 19:05:15,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115730823] [2020-01-16 19:05:15,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:15,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:15,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865868687] [2020-01-16 19:05:15,972 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:15,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:15,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:15,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:15,973 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:05:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:16,069 INFO L93 Difference]: Finished difference Result 580 states and 1707 transitions. [2020-01-16 19:05:16,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:16,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:16,070 INFO L225 Difference]: With dead ends: 580 [2020-01-16 19:05:16,071 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 19:05:16,071 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 19:05:16,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 388. [2020-01-16 19:05:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:05:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1326 transitions. [2020-01-16 19:05:16,080 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1326 transitions. Word has length 22 [2020-01-16 19:05:16,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:16,081 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1326 transitions. [2020-01-16 19:05:16,081 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1326 transitions. [2020-01-16 19:05:16,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:16,081 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:16,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, 1, 1, 1] [2020-01-16 19:05:16,082 INFO L426 AbstractCegarLoop]: === Iteration 934 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:16,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:16,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1666456088, now seen corresponding path program 928 times [2020-01-16 19:05:16,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:16,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513463153] [2020-01-16 19:05:16,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:16,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513463153] [2020-01-16 19:05:16,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:16,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:16,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041527460] [2020-01-16 19:05:16,356 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:16,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:16,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:16,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:16,356 INFO L87 Difference]: Start difference. First operand 388 states and 1326 transitions. Second operand 9 states. [2020-01-16 19:05:16,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:16,456 INFO L93 Difference]: Finished difference Result 567 states and 1687 transitions. [2020-01-16 19:05:16,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:16,457 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:16,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:16,458 INFO L225 Difference]: With dead ends: 567 [2020-01-16 19:05:16,458 INFO L226 Difference]: Without dead ends: 550 [2020-01-16 19:05:16,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-01-16 19:05:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 383. [2020-01-16 19:05:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:05:16,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1315 transitions. [2020-01-16 19:05:16,468 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1315 transitions. Word has length 22 [2020-01-16 19:05:16,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:16,468 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1315 transitions. [2020-01-16 19:05:16,468 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:16,468 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1315 transitions. [2020-01-16 19:05:16,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:16,468 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:16,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, 1, 1, 1] [2020-01-16 19:05:16,469 INFO L426 AbstractCegarLoop]: === Iteration 935 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:16,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:16,469 INFO L82 PathProgramCache]: Analyzing trace with hash 361118400, now seen corresponding path program 929 times [2020-01-16 19:05:16,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:16,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355668070] [2020-01-16 19:05:16,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:16,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:16,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355668070] [2020-01-16 19:05:16,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:16,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:16,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933697416] [2020-01-16 19:05:16,742 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:16,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:16,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:16,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:16,743 INFO L87 Difference]: Start difference. First operand 383 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:05:16,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:16,842 INFO L93 Difference]: Finished difference Result 571 states and 1685 transitions. [2020-01-16 19:05:16,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:16,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:16,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:16,844 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:05:16,844 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:05:16,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:16,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:05:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 385. [2020-01-16 19:05:16,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:05:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1318 transitions. [2020-01-16 19:05:16,853 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1318 transitions. Word has length 22 [2020-01-16 19:05:16,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:16,853 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1318 transitions. [2020-01-16 19:05:16,853 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:16,853 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1318 transitions. [2020-01-16 19:05:16,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:16,854 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:16,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, 1, 1, 1] [2020-01-16 19:05:16,854 INFO L426 AbstractCegarLoop]: === Iteration 936 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:16,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:16,854 INFO L82 PathProgramCache]: Analyzing trace with hash 187870708, now seen corresponding path program 930 times [2020-01-16 19:05:16,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:16,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274769751] [2020-01-16 19:05:16,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:17,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274769751] [2020-01-16 19:05:17,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:17,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:17,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022426477] [2020-01-16 19:05:17,133 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:17,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:17,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:17,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:17,134 INFO L87 Difference]: Start difference. First operand 385 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:05:17,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:17,238 INFO L93 Difference]: Finished difference Result 564 states and 1679 transitions. [2020-01-16 19:05:17,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:17,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:17,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:17,239 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:05:17,240 INFO L226 Difference]: Without dead ends: 547 [2020-01-16 19:05:17,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:17,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-01-16 19:05:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 380. [2020-01-16 19:05:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:05:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1309 transitions. [2020-01-16 19:05:17,248 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1309 transitions. Word has length 22 [2020-01-16 19:05:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:17,248 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1309 transitions. [2020-01-16 19:05:17,248 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1309 transitions. [2020-01-16 19:05:17,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:17,249 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:17,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, 1, 1, 1] [2020-01-16 19:05:17,249 INFO L426 AbstractCegarLoop]: === Iteration 937 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:17,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:17,249 INFO L82 PathProgramCache]: Analyzing trace with hash 169704062, now seen corresponding path program 931 times [2020-01-16 19:05:17,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:17,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737104681] [2020-01-16 19:05:17,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:17,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737104681] [2020-01-16 19:05:17,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:17,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:17,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065746487] [2020-01-16 19:05:17,544 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:17,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:17,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:17,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:17,545 INFO L87 Difference]: Start difference. First operand 380 states and 1309 transitions. Second operand 9 states. [2020-01-16 19:05:17,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:17,622 INFO L93 Difference]: Finished difference Result 555 states and 1650 transitions. [2020-01-16 19:05:17,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:17,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:17,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:17,624 INFO L225 Difference]: With dead ends: 555 [2020-01-16 19:05:17,624 INFO L226 Difference]: Without dead ends: 546 [2020-01-16 19:05:17,624 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:17,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-01-16 19:05:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 382. [2020-01-16 19:05:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:05:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1313 transitions. [2020-01-16 19:05:17,634 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1313 transitions. Word has length 22 [2020-01-16 19:05:17,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:17,634 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1313 transitions. [2020-01-16 19:05:17,634 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:17,634 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1313 transitions. [2020-01-16 19:05:17,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:17,635 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:17,635 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:17,635 INFO L426 AbstractCegarLoop]: === Iteration 938 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:17,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:17,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1780645020, now seen corresponding path program 932 times [2020-01-16 19:05:17,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:17,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612729490] [2020-01-16 19:05:17,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:17,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-01-16 19:05:17,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612729490] [2020-01-16 19:05:17,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:17,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:17,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991131657] [2020-01-16 19:05:17,932 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:17,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:17,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:17,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:17,932 INFO L87 Difference]: Start difference. First operand 382 states and 1313 transitions. Second operand 9 states. [2020-01-16 19:05:18,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:18,047 INFO L93 Difference]: Finished difference Result 556 states and 1651 transitions. [2020-01-16 19:05:18,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:18,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:18,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:18,048 INFO L225 Difference]: With dead ends: 556 [2020-01-16 19:05:18,049 INFO L226 Difference]: Without dead ends: 545 [2020-01-16 19:05:18,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-01-16 19:05:18,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 381. [2020-01-16 19:05:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:05:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1311 transitions. [2020-01-16 19:05:18,058 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1311 transitions. Word has length 22 [2020-01-16 19:05:18,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:18,058 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1311 transitions. [2020-01-16 19:05:18,058 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:18,058 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1311 transitions. [2020-01-16 19:05:18,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:18,058 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:18,058 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:18,058 INFO L426 AbstractCegarLoop]: === Iteration 939 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:18,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:18,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1182396594, now seen corresponding path program 933 times [2020-01-16 19:05:18,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:18,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053691579] [2020-01-16 19:05:18,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:18,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:18,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053691579] [2020-01-16 19:05:18,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:18,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:18,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943862367] [2020-01-16 19:05:18,348 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:18,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:18,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:18,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:18,348 INFO L87 Difference]: Start difference. First operand 381 states and 1311 transitions. Second operand 9 states. [2020-01-16 19:05:18,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:18,438 INFO L93 Difference]: Finished difference Result 556 states and 1652 transitions. [2020-01-16 19:05:18,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:18,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:18,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:18,440 INFO L225 Difference]: With dead ends: 556 [2020-01-16 19:05:18,440 INFO L226 Difference]: Without dead ends: 547 [2020-01-16 19:05:18,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-01-16 19:05:18,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 382. [2020-01-16 19:05:18,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:05:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1312 transitions. [2020-01-16 19:05:18,449 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1312 transitions. Word has length 22 [2020-01-16 19:05:18,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:18,450 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1312 transitions. [2020-01-16 19:05:18,450 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:18,450 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1312 transitions. [2020-01-16 19:05:18,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:18,450 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:18,450 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:18,450 INFO L426 AbstractCegarLoop]: === Iteration 940 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:18,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:18,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1717626396, now seen corresponding path program 934 times [2020-01-16 19:05:18,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:18,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680817217] [2020-01-16 19:05:18,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:18,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-01-16 19:05:18,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680817217] [2020-01-16 19:05:18,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:18,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:18,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966087041] [2020-01-16 19:05:18,740 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:18,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:18,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:18,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:18,741 INFO L87 Difference]: Start difference. First operand 382 states and 1312 transitions. Second operand 9 states. [2020-01-16 19:05:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:18,858 INFO L93 Difference]: Finished difference Result 550 states and 1649 transitions. [2020-01-16 19:05:18,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:18,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:18,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:18,859 INFO L225 Difference]: With dead ends: 550 [2020-01-16 19:05:18,859 INFO L226 Difference]: Without dead ends: 537 [2020-01-16 19:05:18,860 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:18,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-01-16 19:05:18,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 381. [2020-01-16 19:05:18,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:05:18,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1310 transitions. [2020-01-16 19:05:18,868 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1310 transitions. Word has length 22 [2020-01-16 19:05:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:18,868 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1310 transitions. [2020-01-16 19:05:18,868 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:18,868 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1310 transitions. [2020-01-16 19:05:18,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:18,869 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:18,869 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:18,869 INFO L426 AbstractCegarLoop]: === Iteration 941 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:18,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:18,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1192899698, now seen corresponding path program 935 times [2020-01-16 19:05:18,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:18,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834534729] [2020-01-16 19:05:18,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:19,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-01-16 19:05:19,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834534729] [2020-01-16 19:05:19,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:19,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:19,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750716143] [2020-01-16 19:05:19,151 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:19,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:19,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:19,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:19,151 INFO L87 Difference]: Start difference. First operand 381 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:05:19,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:19,250 INFO L93 Difference]: Finished difference Result 558 states and 1656 transitions. [2020-01-16 19:05:19,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:19,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:19,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:19,252 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:05:19,252 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:05:19,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:19,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:05:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 383. [2020-01-16 19:05:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:05:19,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1313 transitions. [2020-01-16 19:05:19,262 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1313 transitions. Word has length 22 [2020-01-16 19:05:19,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:19,262 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1313 transitions. [2020-01-16 19:05:19,262 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1313 transitions. [2020-01-16 19:05:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:19,263 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:19,263 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:19,263 INFO L426 AbstractCegarLoop]: === Iteration 942 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:19,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:19,263 INFO L82 PathProgramCache]: Analyzing trace with hash 117188542, now seen corresponding path program 936 times [2020-01-16 19:05:19,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:19,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501385156] [2020-01-16 19:05:19,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:19,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-01-16 19:05:19,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501385156] [2020-01-16 19:05:19,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:19,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:19,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997523829] [2020-01-16 19:05:19,539 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:19,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:19,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:19,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:19,539 INFO L87 Difference]: Start difference. First operand 383 states and 1313 transitions. Second operand 9 states. [2020-01-16 19:05:19,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:19,659 INFO L93 Difference]: Finished difference Result 551 states and 1650 transitions. [2020-01-16 19:05:19,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:19,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:19,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:19,661 INFO L225 Difference]: With dead ends: 551 [2020-01-16 19:05:19,661 INFO L226 Difference]: Without dead ends: 534 [2020-01-16 19:05:19,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:19,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-01-16 19:05:19,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 378. [2020-01-16 19:05:19,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:05:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1305 transitions. [2020-01-16 19:05:19,670 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1305 transitions. Word has length 22 [2020-01-16 19:05:19,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:19,670 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1305 transitions. [2020-01-16 19:05:19,670 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:19,670 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1305 transitions. [2020-01-16 19:05:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:19,670 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:19,670 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:19,671 INFO L426 AbstractCegarLoop]: === Iteration 943 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:19,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:19,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1209640248, now seen corresponding path program 937 times [2020-01-16 19:05:19,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:19,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101742103] [2020-01-16 19:05:19,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:19,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101742103] [2020-01-16 19:05:19,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:19,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:19,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096299725] [2020-01-16 19:05:19,970 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:19,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:19,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:19,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:19,970 INFO L87 Difference]: Start difference. First operand 378 states and 1305 transitions. Second operand 9 states. [2020-01-16 19:05:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:20,070 INFO L93 Difference]: Finished difference Result 546 states and 1632 transitions. [2020-01-16 19:05:20,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:20,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:20,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:20,072 INFO L225 Difference]: With dead ends: 546 [2020-01-16 19:05:20,072 INFO L226 Difference]: Without dead ends: 535 [2020-01-16 19:05:20,072 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-01-16 19:05:20,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 381. [2020-01-16 19:05:20,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:05:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1313 transitions. [2020-01-16 19:05:20,081 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1313 transitions. Word has length 22 [2020-01-16 19:05:20,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:20,082 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1313 transitions. [2020-01-16 19:05:20,082 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1313 transitions. [2020-01-16 19:05:20,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:20,082 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:20,082 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:20,082 INFO L426 AbstractCegarLoop]: === Iteration 944 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:20,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:20,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1639810038, now seen corresponding path program 938 times [2020-01-16 19:05:20,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:20,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129807611] [2020-01-16 19:05:20,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:20,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129807611] [2020-01-16 19:05:20,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:20,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:20,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802150417] [2020-01-16 19:05:20,380 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:20,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:20,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:20,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:20,381 INFO L87 Difference]: Start difference. First operand 381 states and 1313 transitions. Second operand 9 states. [2020-01-16 19:05:20,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:20,463 INFO L93 Difference]: Finished difference Result 544 states and 1627 transitions. [2020-01-16 19:05:20,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:20,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:20,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:20,464 INFO L225 Difference]: With dead ends: 544 [2020-01-16 19:05:20,465 INFO L226 Difference]: Without dead ends: 534 [2020-01-16 19:05:20,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:20,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-01-16 19:05:20,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 380. [2020-01-16 19:05:20,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:05:20,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1311 transitions. [2020-01-16 19:05:20,472 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1311 transitions. Word has length 22 [2020-01-16 19:05:20,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:20,473 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1311 transitions. [2020-01-16 19:05:20,473 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:20,473 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1311 transitions. [2020-01-16 19:05:20,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:20,473 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:20,473 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:20,473 INFO L426 AbstractCegarLoop]: === Iteration 945 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:20,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:20,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1484889194, now seen corresponding path program 939 times [2020-01-16 19:05:20,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:20,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551262641] [2020-01-16 19:05:20,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:20,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-01-16 19:05:20,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551262641] [2020-01-16 19:05:20,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:20,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:20,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527871252] [2020-01-16 19:05:20,777 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:20,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:20,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:20,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:20,777 INFO L87 Difference]: Start difference. First operand 380 states and 1311 transitions. Second operand 9 states. [2020-01-16 19:05:20,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:20,882 INFO L93 Difference]: Finished difference Result 548 states and 1636 transitions. [2020-01-16 19:05:20,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:20,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:20,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:20,884 INFO L225 Difference]: With dead ends: 548 [2020-01-16 19:05:20,884 INFO L226 Difference]: Without dead ends: 537 [2020-01-16 19:05:20,884 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-01-16 19:05:20,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 382. [2020-01-16 19:05:20,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:05:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1314 transitions. [2020-01-16 19:05:20,894 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1314 transitions. Word has length 22 [2020-01-16 19:05:20,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:20,894 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1314 transitions. [2020-01-16 19:05:20,894 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:20,894 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1314 transitions. [2020-01-16 19:05:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:20,894 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:20,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, 1, 1, 1] [2020-01-16 19:05:20,895 INFO L426 AbstractCegarLoop]: === Iteration 946 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:20,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:20,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1737981946, now seen corresponding path program 940 times [2020-01-16 19:05:20,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:20,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906532674] [2020-01-16 19:05:20,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:21,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906532674] [2020-01-16 19:05:21,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:21,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:21,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820880374] [2020-01-16 19:05:21,188 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:21,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:21,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:21,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:21,188 INFO L87 Difference]: Start difference. First operand 382 states and 1314 transitions. Second operand 9 states. [2020-01-16 19:05:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:21,303 INFO L93 Difference]: Finished difference Result 547 states and 1632 transitions. [2020-01-16 19:05:21,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:21,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:21,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:21,305 INFO L225 Difference]: With dead ends: 547 [2020-01-16 19:05:21,305 INFO L226 Difference]: Without dead ends: 535 [2020-01-16 19:05:21,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:21,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-01-16 19:05:21,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 380. [2020-01-16 19:05:21,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:05:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1310 transitions. [2020-01-16 19:05:21,313 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1310 transitions. Word has length 22 [2020-01-16 19:05:21,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:21,314 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1310 transitions. [2020-01-16 19:05:21,314 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:21,314 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1310 transitions. [2020-01-16 19:05:21,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:21,314 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:21,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, 1, 1, 1] [2020-01-16 19:05:21,314 INFO L426 AbstractCegarLoop]: === Iteration 947 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:21,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:21,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1561065670, now seen corresponding path program 941 times [2020-01-16 19:05:21,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:21,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795533447] [2020-01-16 19:05:21,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:21,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795533447] [2020-01-16 19:05:21,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:21,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:21,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432953407] [2020-01-16 19:05:21,634 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:21,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:21,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:21,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:21,635 INFO L87 Difference]: Start difference. First operand 380 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:05:21,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:21,713 INFO L93 Difference]: Finished difference Result 543 states and 1624 transitions. [2020-01-16 19:05:21,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:21,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:21,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:21,715 INFO L225 Difference]: With dead ends: 543 [2020-01-16 19:05:21,715 INFO L226 Difference]: Without dead ends: 534 [2020-01-16 19:05:21,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:21,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-01-16 19:05:21,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 381. [2020-01-16 19:05:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:05:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1311 transitions. [2020-01-16 19:05:21,724 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1311 transitions. Word has length 22 [2020-01-16 19:05:21,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:21,725 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1311 transitions. [2020-01-16 19:05:21,725 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1311 transitions. [2020-01-16 19:05:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:21,725 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:21,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, 1, 1, 1] [2020-01-16 19:05:21,725 INFO L426 AbstractCegarLoop]: === Iteration 948 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:21,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:21,726 INFO L82 PathProgramCache]: Analyzing trace with hash 49875288, now seen corresponding path program 942 times [2020-01-16 19:05:21,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:21,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646594391] [2020-01-16 19:05:21,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:22,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-01-16 19:05:22,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646594391] [2020-01-16 19:05:22,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:22,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:22,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824613843] [2020-01-16 19:05:22,027 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:22,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:22,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:22,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:22,028 INFO L87 Difference]: Start difference. First operand 381 states and 1311 transitions. Second operand 9 states. [2020-01-16 19:05:22,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:22,132 INFO L93 Difference]: Finished difference Result 544 states and 1625 transitions. [2020-01-16 19:05:22,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:22,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:22,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:22,134 INFO L225 Difference]: With dead ends: 544 [2020-01-16 19:05:22,134 INFO L226 Difference]: Without dead ends: 532 [2020-01-16 19:05:22,134 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:22,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-01-16 19:05:22,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 379. [2020-01-16 19:05:22,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:05:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1308 transitions. [2020-01-16 19:05:22,143 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1308 transitions. Word has length 22 [2020-01-16 19:05:22,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:22,143 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1308 transitions. [2020-01-16 19:05:22,143 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:22,143 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1308 transitions. [2020-01-16 19:05:22,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:22,144 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:22,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, 1, 1, 1] [2020-01-16 19:05:22,144 INFO L426 AbstractCegarLoop]: === Iteration 949 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:22,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:22,144 INFO L82 PathProgramCache]: Analyzing trace with hash 119057172, now seen corresponding path program 943 times [2020-01-16 19:05:22,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:22,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355481881] [2020-01-16 19:05:22,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:22,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-01-16 19:05:22,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355481881] [2020-01-16 19:05:22,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:22,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:22,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679507643] [2020-01-16 19:05:22,434 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:22,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:22,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:22,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:22,434 INFO L87 Difference]: Start difference. First operand 379 states and 1308 transitions. Second operand 9 states. [2020-01-16 19:05:22,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:22,534 INFO L93 Difference]: Finished difference Result 548 states and 1636 transitions. [2020-01-16 19:05:22,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:22,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:22,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:22,535 INFO L225 Difference]: With dead ends: 548 [2020-01-16 19:05:22,536 INFO L226 Difference]: Without dead ends: 537 [2020-01-16 19:05:22,536 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:22,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-01-16 19:05:22,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 381. [2020-01-16 19:05:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:05:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1312 transitions. [2020-01-16 19:05:22,544 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1312 transitions. Word has length 22 [2020-01-16 19:05:22,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:22,544 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1312 transitions. [2020-01-16 19:05:22,544 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1312 transitions. [2020-01-16 19:05:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:22,544 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:22,544 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:22,544 INFO L426 AbstractCegarLoop]: === Iteration 950 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:22,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:22,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1326459838, now seen corresponding path program 944 times [2020-01-16 19:05:22,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:22,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297891618] [2020-01-16 19:05:22,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:22,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-01-16 19:05:22,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297891618] [2020-01-16 19:05:22,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:22,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:22,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334516279] [2020-01-16 19:05:22,848 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:22,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:22,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:22,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:22,849 INFO L87 Difference]: Start difference. First operand 381 states and 1312 transitions. Second operand 9 states. [2020-01-16 19:05:22,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:22,936 INFO L93 Difference]: Finished difference Result 546 states and 1631 transitions. [2020-01-16 19:05:22,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:22,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:22,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:22,938 INFO L225 Difference]: With dead ends: 546 [2020-01-16 19:05:22,938 INFO L226 Difference]: Without dead ends: 536 [2020-01-16 19:05:22,938 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:22,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-01-16 19:05:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 380. [2020-01-16 19:05:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:05:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1310 transitions. [2020-01-16 19:05:22,947 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1310 transitions. Word has length 22 [2020-01-16 19:05:22,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:22,947 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1310 transitions. [2020-01-16 19:05:22,947 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1310 transitions. [2020-01-16 19:05:22,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:22,947 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:22,947 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:22,948 INFO L426 AbstractCegarLoop]: === Iteration 951 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:22,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:22,948 INFO L82 PathProgramCache]: Analyzing trace with hash -468688150, now seen corresponding path program 945 times [2020-01-16 19:05:22,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:22,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075582918] [2020-01-16 19:05:22,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:23,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:23,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075582918] [2020-01-16 19:05:23,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:23,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:23,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337507556] [2020-01-16 19:05:23,237 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:23,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:23,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:23,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:23,237 INFO L87 Difference]: Start difference. First operand 380 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:05:23,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:23,342 INFO L93 Difference]: Finished difference Result 550 states and 1642 transitions. [2020-01-16 19:05:23,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:23,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:23,343 INFO L225 Difference]: With dead ends: 550 [2020-01-16 19:05:23,343 INFO L226 Difference]: Without dead ends: 539 [2020-01-16 19:05:23,344 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:23,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-01-16 19:05:23,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 383. [2020-01-16 19:05:23,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:05:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1315 transitions. [2020-01-16 19:05:23,352 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1315 transitions. Word has length 22 [2020-01-16 19:05:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:23,352 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1315 transitions. [2020-01-16 19:05:23,352 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1315 transitions. [2020-01-16 19:05:23,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:23,353 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:23,353 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:23,353 INFO L426 AbstractCegarLoop]: === Iteration 952 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:23,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:23,353 INFO L82 PathProgramCache]: Analyzing trace with hash -166670206, now seen corresponding path program 946 times [2020-01-16 19:05:23,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:23,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179399647] [2020-01-16 19:05:23,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:23,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-01-16 19:05:23,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179399647] [2020-01-16 19:05:23,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:23,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:23,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955707907] [2020-01-16 19:05:23,646 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:23,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:23,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:23,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:23,647 INFO L87 Difference]: Start difference. First operand 383 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:05:23,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:23,763 INFO L93 Difference]: Finished difference Result 542 states and 1633 transitions. [2020-01-16 19:05:23,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:23,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:23,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:23,765 INFO L225 Difference]: With dead ends: 542 [2020-01-16 19:05:23,765 INFO L226 Difference]: Without dead ends: 527 [2020-01-16 19:05:23,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2020-01-16 19:05:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 380. [2020-01-16 19:05:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:05:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1309 transitions. [2020-01-16 19:05:23,775 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1309 transitions. Word has length 22 [2020-01-16 19:05:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:23,775 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1309 transitions. [2020-01-16 19:05:23,775 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1309 transitions. [2020-01-16 19:05:23,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:23,775 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:23,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, 1, 1, 1] [2020-01-16 19:05:23,776 INFO L426 AbstractCegarLoop]: === Iteration 953 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:23,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:23,776 INFO L82 PathProgramCache]: Analyzing trace with hash 780324282, now seen corresponding path program 947 times [2020-01-16 19:05:23,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:23,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403406235] [2020-01-16 19:05:23,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:24,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403406235] [2020-01-16 19:05:24,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:24,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:24,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932969640] [2020-01-16 19:05:24,067 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:24,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:24,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:24,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:24,068 INFO L87 Difference]: Start difference. First operand 380 states and 1309 transitions. Second operand 9 states. [2020-01-16 19:05:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:24,150 INFO L93 Difference]: Finished difference Result 546 states and 1631 transitions. [2020-01-16 19:05:24,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:24,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:24,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:24,152 INFO L225 Difference]: With dead ends: 546 [2020-01-16 19:05:24,152 INFO L226 Difference]: Without dead ends: 537 [2020-01-16 19:05:24,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-01-16 19:05:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 381. [2020-01-16 19:05:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:05:24,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1310 transitions. [2020-01-16 19:05:24,161 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1310 transitions. Word has length 22 [2020-01-16 19:05:24,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:24,161 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1310 transitions. [2020-01-16 19:05:24,161 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:24,161 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1310 transitions. [2020-01-16 19:05:24,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:24,162 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:24,162 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:24,162 INFO L426 AbstractCegarLoop]: === Iteration 954 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:24,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:24,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1315554084, now seen corresponding path program 948 times [2020-01-16 19:05:24,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:24,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946816376] [2020-01-16 19:05:24,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:24,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:24,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946816376] [2020-01-16 19:05:24,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:24,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:24,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495416515] [2020-01-16 19:05:24,451 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:24,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:24,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:24,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:24,451 INFO L87 Difference]: Start difference. First operand 381 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:05:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:24,561 INFO L93 Difference]: Finished difference Result 540 states and 1628 transitions. [2020-01-16 19:05:24,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:24,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:24,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:24,563 INFO L225 Difference]: With dead ends: 540 [2020-01-16 19:05:24,563 INFO L226 Difference]: Without dead ends: 526 [2020-01-16 19:05:24,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:24,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-01-16 19:05:24,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 379. [2020-01-16 19:05:24,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:05:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1307 transitions. [2020-01-16 19:05:24,572 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1307 transitions. Word has length 22 [2020-01-16 19:05:24,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:24,572 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1307 transitions. [2020-01-16 19:05:24,573 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:24,573 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1307 transitions. [2020-01-16 19:05:24,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:24,573 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:24,573 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:24,573 INFO L426 AbstractCegarLoop]: === Iteration 955 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:24,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:24,573 INFO L82 PathProgramCache]: Analyzing trace with hash 444653396, now seen corresponding path program 949 times [2020-01-16 19:05:24,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:24,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207588813] [2020-01-16 19:05:24,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:24,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-01-16 19:05:24,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207588813] [2020-01-16 19:05:24,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:24,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:24,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327497910] [2020-01-16 19:05:24,860 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:24,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:24,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:24,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:24,867 INFO L87 Difference]: Start difference. First operand 379 states and 1307 transitions. Second operand 9 states. [2020-01-16 19:05:24,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:24,967 INFO L93 Difference]: Finished difference Result 553 states and 1649 transitions. [2020-01-16 19:05:24,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:24,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:24,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:24,969 INFO L225 Difference]: With dead ends: 553 [2020-01-16 19:05:24,969 INFO L226 Difference]: Without dead ends: 542 [2020-01-16 19:05:24,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:24,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-01-16 19:05:24,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 383. [2020-01-16 19:05:24,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:05:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1317 transitions. [2020-01-16 19:05:24,978 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1317 transitions. Word has length 22 [2020-01-16 19:05:24,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:24,978 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1317 transitions. [2020-01-16 19:05:24,978 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:24,979 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1317 transitions. [2020-01-16 19:05:24,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:24,979 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:24,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, 1, 1, 1] [2020-01-16 19:05:24,979 INFO L426 AbstractCegarLoop]: === Iteration 956 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:24,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:24,979 INFO L82 PathProgramCache]: Analyzing trace with hash 697746148, now seen corresponding path program 950 times [2020-01-16 19:05:24,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:24,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452545402] [2020-01-16 19:05:24,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:25,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-01-16 19:05:25,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452545402] [2020-01-16 19:05:25,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:25,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:25,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101046793] [2020-01-16 19:05:25,268 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:25,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:25,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:25,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:25,268 INFO L87 Difference]: Start difference. First operand 383 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:05:25,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:25,380 INFO L93 Difference]: Finished difference Result 552 states and 1645 transitions. [2020-01-16 19:05:25,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:25,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:25,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:25,382 INFO L225 Difference]: With dead ends: 552 [2020-01-16 19:05:25,382 INFO L226 Difference]: Without dead ends: 540 [2020-01-16 19:05:25,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:25,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-01-16 19:05:25,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 381. [2020-01-16 19:05:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:05:25,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1312 transitions. [2020-01-16 19:05:25,391 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1312 transitions. Word has length 22 [2020-01-16 19:05:25,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:25,391 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1312 transitions. [2020-01-16 19:05:25,391 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:25,391 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1312 transitions. [2020-01-16 19:05:25,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:25,392 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:25,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, 1, 1, 1] [2020-01-16 19:05:25,392 INFO L426 AbstractCegarLoop]: === Iteration 957 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:25,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:25,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1457345928, now seen corresponding path program 951 times [2020-01-16 19:05:25,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:25,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125556150] [2020-01-16 19:05:25,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:25,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125556150] [2020-01-16 19:05:25,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:25,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:25,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532785586] [2020-01-16 19:05:25,686 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:25,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:25,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:25,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:25,686 INFO L87 Difference]: Start difference. First operand 381 states and 1312 transitions. Second operand 9 states. [2020-01-16 19:05:25,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:25,786 INFO L93 Difference]: Finished difference Result 553 states and 1649 transitions. [2020-01-16 19:05:25,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:25,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:25,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:25,787 INFO L225 Difference]: With dead ends: 553 [2020-01-16 19:05:25,788 INFO L226 Difference]: Without dead ends: 542 [2020-01-16 19:05:25,788 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:25,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-01-16 19:05:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 384. [2020-01-16 19:05:25,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:05:25,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-01-16 19:05:25,796 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-01-16 19:05:25,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:25,796 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-01-16 19:05:25,796 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:25,796 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-01-16 19:05:25,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:25,797 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:25,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, 1, 1, 1] [2020-01-16 19:05:25,797 INFO L426 AbstractCegarLoop]: === Iteration 958 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:25,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:25,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1759363872, now seen corresponding path program 952 times [2020-01-16 19:05:25,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:25,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205553713] [2020-01-16 19:05:25,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:26,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:26,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205553713] [2020-01-16 19:05:26,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:26,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:26,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575587441] [2020-01-16 19:05:26,094 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:26,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:26,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:26,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:26,094 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:05:26,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:26,206 INFO L93 Difference]: Finished difference Result 545 states and 1640 transitions. [2020-01-16 19:05:26,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:26,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:26,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:26,208 INFO L225 Difference]: With dead ends: 545 [2020-01-16 19:05:26,208 INFO L226 Difference]: Without dead ends: 530 [2020-01-16 19:05:26,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:26,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-01-16 19:05:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 381. [2020-01-16 19:05:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:05:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1310 transitions. [2020-01-16 19:05:26,217 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1310 transitions. Word has length 22 [2020-01-16 19:05:26,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:26,217 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1310 transitions. [2020-01-16 19:05:26,217 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:26,217 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1310 transitions. [2020-01-16 19:05:26,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:26,218 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:26,218 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:26,218 INFO L426 AbstractCegarLoop]: === Iteration 959 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:26,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:26,218 INFO L82 PathProgramCache]: Analyzing trace with hash 167339396, now seen corresponding path program 953 times [2020-01-16 19:05:26,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:26,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173903807] [2020-01-16 19:05:26,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:26,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-01-16 19:05:26,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173903807] [2020-01-16 19:05:26,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:26,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:26,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005956523] [2020-01-16 19:05:26,499 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:26,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:26,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:26,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:26,500 INFO L87 Difference]: Start difference. First operand 381 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:05:26,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:26,602 INFO L93 Difference]: Finished difference Result 551 states and 1642 transitions. [2020-01-16 19:05:26,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:26,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:26,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:26,604 INFO L225 Difference]: With dead ends: 551 [2020-01-16 19:05:26,604 INFO L226 Difference]: Without dead ends: 541 [2020-01-16 19:05:26,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:26,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-01-16 19:05:26,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 383. [2020-01-16 19:05:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:05:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1313 transitions. [2020-01-16 19:05:26,613 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1313 transitions. Word has length 22 [2020-01-16 19:05:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:26,613 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1313 transitions. [2020-01-16 19:05:26,614 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:26,614 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1313 transitions. [2020-01-16 19:05:26,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:26,614 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:26,614 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:26,614 INFO L426 AbstractCegarLoop]: === Iteration 960 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:26,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:26,614 INFO L82 PathProgramCache]: Analyzing trace with hash -5908296, now seen corresponding path program 954 times [2020-01-16 19:05:26,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:26,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952392540] [2020-01-16 19:05:26,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:26,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-01-16 19:05:26,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952392540] [2020-01-16 19:05:26,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:26,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:26,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593377874] [2020-01-16 19:05:26,895 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:26,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:26,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:26,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:26,895 INFO L87 Difference]: Start difference. First operand 383 states and 1313 transitions. Second operand 9 states. [2020-01-16 19:05:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:27,001 INFO L93 Difference]: Finished difference Result 544 states and 1636 transitions. [2020-01-16 19:05:27,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:27,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:27,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:27,003 INFO L225 Difference]: With dead ends: 544 [2020-01-16 19:05:27,003 INFO L226 Difference]: Without dead ends: 528 [2020-01-16 19:05:27,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-01-16 19:05:27,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 379. [2020-01-16 19:05:27,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:05:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1306 transitions. [2020-01-16 19:05:27,012 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1306 transitions. Word has length 22 [2020-01-16 19:05:27,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:27,013 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1306 transitions. [2020-01-16 19:05:27,013 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:27,013 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1306 transitions. [2020-01-16 19:05:27,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:27,013 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:27,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, 1, 1, 1] [2020-01-16 19:05:27,013 INFO L426 AbstractCegarLoop]: === Iteration 961 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:27,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:27,013 INFO L82 PathProgramCache]: Analyzing trace with hash -675267390, now seen corresponding path program 955 times [2020-01-16 19:05:27,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:27,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913598640] [2020-01-16 19:05:27,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:27,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-01-16 19:05:27,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913598640] [2020-01-16 19:05:27,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:27,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:27,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056965764] [2020-01-16 19:05:27,323 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:27,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:27,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:27,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:27,323 INFO L87 Difference]: Start difference. First operand 379 states and 1306 transitions. Second operand 9 states. [2020-01-16 19:05:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:27,415 INFO L93 Difference]: Finished difference Result 543 states and 1623 transitions. [2020-01-16 19:05:27,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:27,415 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:27,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:27,416 INFO L225 Difference]: With dead ends: 543 [2020-01-16 19:05:27,417 INFO L226 Difference]: Without dead ends: 534 [2020-01-16 19:05:27,417 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-01-16 19:05:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 381. [2020-01-16 19:05:27,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:05:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1310 transitions. [2020-01-16 19:05:27,425 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1310 transitions. Word has length 22 [2020-01-16 19:05:27,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:27,425 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1310 transitions. [2020-01-16 19:05:27,425 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:27,425 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1310 transitions. [2020-01-16 19:05:27,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:27,425 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:27,425 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:27,426 INFO L426 AbstractCegarLoop]: === Iteration 962 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:27,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:27,426 INFO L82 PathProgramCache]: Analyzing trace with hash 935673568, now seen corresponding path program 956 times [2020-01-16 19:05:27,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:27,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833301826] [2020-01-16 19:05:27,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:27,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-01-16 19:05:27,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833301826] [2020-01-16 19:05:27,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:27,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:27,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348067235] [2020-01-16 19:05:27,722 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:27,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:27,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:27,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:27,723 INFO L87 Difference]: Start difference. First operand 381 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:05:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:27,824 INFO L93 Difference]: Finished difference Result 544 states and 1624 transitions. [2020-01-16 19:05:27,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:27,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:27,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:27,826 INFO L225 Difference]: With dead ends: 544 [2020-01-16 19:05:27,826 INFO L226 Difference]: Without dead ends: 533 [2020-01-16 19:05:27,826 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:27,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-01-16 19:05:27,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 380. [2020-01-16 19:05:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:05:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1308 transitions. [2020-01-16 19:05:27,834 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1308 transitions. Word has length 22 [2020-01-16 19:05:27,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:27,834 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1308 transitions. [2020-01-16 19:05:27,834 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:27,834 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1308 transitions. [2020-01-16 19:05:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:27,834 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:27,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, 1, 1, 1] [2020-01-16 19:05:27,835 INFO L426 AbstractCegarLoop]: === Iteration 963 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:27,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:27,835 INFO L82 PathProgramCache]: Analyzing trace with hash 337425142, now seen corresponding path program 957 times [2020-01-16 19:05:27,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:27,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361375703] [2020-01-16 19:05:27,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:28,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-01-16 19:05:28,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361375703] [2020-01-16 19:05:28,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:28,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:28,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887898199] [2020-01-16 19:05:28,124 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:28,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:28,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:28,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:28,125 INFO L87 Difference]: Start difference. First operand 380 states and 1308 transitions. Second operand 9 states. [2020-01-16 19:05:28,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:28,200 INFO L93 Difference]: Finished difference Result 544 states and 1625 transitions. [2020-01-16 19:05:28,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:28,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:28,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:28,201 INFO L225 Difference]: With dead ends: 544 [2020-01-16 19:05:28,201 INFO L226 Difference]: Without dead ends: 535 [2020-01-16 19:05:28,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:28,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-01-16 19:05:28,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 381. [2020-01-16 19:05:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:05:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1309 transitions. [2020-01-16 19:05:28,210 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1309 transitions. Word has length 22 [2020-01-16 19:05:28,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:28,210 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1309 transitions. [2020-01-16 19:05:28,210 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:28,210 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1309 transitions. [2020-01-16 19:05:28,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:28,211 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:28,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, 1, 1, 1] [2020-01-16 19:05:28,211 INFO L426 AbstractCegarLoop]: === Iteration 964 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:28,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:28,211 INFO L82 PathProgramCache]: Analyzing trace with hash 872654944, now seen corresponding path program 958 times [2020-01-16 19:05:28,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:28,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152153128] [2020-01-16 19:05:28,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:28,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152153128] [2020-01-16 19:05:28,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:28,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:28,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585202000] [2020-01-16 19:05:28,497 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:28,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:28,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:28,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:28,498 INFO L87 Difference]: Start difference. First operand 381 states and 1309 transitions. Second operand 9 states. [2020-01-16 19:05:28,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:28,618 INFO L93 Difference]: Finished difference Result 538 states and 1622 transitions. [2020-01-16 19:05:28,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:28,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:28,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:28,619 INFO L225 Difference]: With dead ends: 538 [2020-01-16 19:05:28,619 INFO L226 Difference]: Without dead ends: 525 [2020-01-16 19:05:28,620 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:28,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2020-01-16 19:05:28,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 380. [2020-01-16 19:05:28,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:05:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1307 transitions. [2020-01-16 19:05:28,627 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1307 transitions. Word has length 22 [2020-01-16 19:05:28,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:28,628 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1307 transitions. [2020-01-16 19:05:28,628 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1307 transitions. [2020-01-16 19:05:28,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:28,628 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:28,628 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:28,628 INFO L426 AbstractCegarLoop]: === Iteration 965 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:28,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:28,629 INFO L82 PathProgramCache]: Analyzing trace with hash 347928246, now seen corresponding path program 959 times [2020-01-16 19:05:28,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:28,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251331029] [2020-01-16 19:05:28,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:28,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-01-16 19:05:28,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251331029] [2020-01-16 19:05:28,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:28,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:28,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853080785] [2020-01-16 19:05:28,915 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:28,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:28,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:28,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:28,915 INFO L87 Difference]: Start difference. First operand 380 states and 1307 transitions. Second operand 9 states. [2020-01-16 19:05:29,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:29,026 INFO L93 Difference]: Finished difference Result 546 states and 1629 transitions. [2020-01-16 19:05:29,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:29,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:29,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:29,027 INFO L225 Difference]: With dead ends: 546 [2020-01-16 19:05:29,027 INFO L226 Difference]: Without dead ends: 536 [2020-01-16 19:05:29,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-01-16 19:05:29,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 382. [2020-01-16 19:05:29,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:05:29,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1310 transitions. [2020-01-16 19:05:29,036 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1310 transitions. Word has length 22 [2020-01-16 19:05:29,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:29,036 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1310 transitions. [2020-01-16 19:05:29,036 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:29,036 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1310 transitions. [2020-01-16 19:05:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:29,037 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:29,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, 1, 1, 1] [2020-01-16 19:05:29,037 INFO L426 AbstractCegarLoop]: === Iteration 966 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:29,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:29,037 INFO L82 PathProgramCache]: Analyzing trace with hash -727782910, now seen corresponding path program 960 times [2020-01-16 19:05:29,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:29,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644805436] [2020-01-16 19:05:29,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:29,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-01-16 19:05:29,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644805436] [2020-01-16 19:05:29,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:29,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:29,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248464807] [2020-01-16 19:05:29,318 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:29,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:29,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:29,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:29,319 INFO L87 Difference]: Start difference. First operand 382 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:05:29,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:29,426 INFO L93 Difference]: Finished difference Result 539 states and 1623 transitions. [2020-01-16 19:05:29,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:29,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:29,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:29,428 INFO L225 Difference]: With dead ends: 539 [2020-01-16 19:05:29,428 INFO L226 Difference]: Without dead ends: 521 [2020-01-16 19:05:29,428 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:29,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-01-16 19:05:29,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 376. [2020-01-16 19:05:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:05:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1301 transitions. [2020-01-16 19:05:29,436 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1301 transitions. Word has length 22 [2020-01-16 19:05:29,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:29,436 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1301 transitions. [2020-01-16 19:05:29,436 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:29,436 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1301 transitions. [2020-01-16 19:05:29,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:29,437 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:29,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, 1, 1, 1] [2020-01-16 19:05:29,437 INFO L426 AbstractCegarLoop]: === Iteration 967 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:29,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:29,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1280120566, now seen corresponding path program 961 times [2020-01-16 19:05:29,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:29,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883947180] [2020-01-16 19:05:29,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:29,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:29,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883947180] [2020-01-16 19:05:29,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:29,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:29,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192332756] [2020-01-16 19:05:29,708 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:29,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:29,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:29,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:29,708 INFO L87 Difference]: Start difference. First operand 376 states and 1301 transitions. Second operand 9 states. [2020-01-16 19:05:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:29,794 INFO L93 Difference]: Finished difference Result 620 states and 1820 transitions. [2020-01-16 19:05:29,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:29,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:29,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:29,796 INFO L225 Difference]: With dead ends: 620 [2020-01-16 19:05:29,796 INFO L226 Difference]: Without dead ends: 604 [2020-01-16 19:05:29,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:29,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-01-16 19:05:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 388. [2020-01-16 19:05:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:05:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1338 transitions. [2020-01-16 19:05:29,805 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1338 transitions. Word has length 22 [2020-01-16 19:05:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:29,805 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1338 transitions. [2020-01-16 19:05:29,805 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1338 transitions. [2020-01-16 19:05:29,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:29,806 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:29,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, 1, 1, 1] [2020-01-16 19:05:29,806 INFO L426 AbstractCegarLoop]: === Iteration 968 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:29,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:29,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1424580844, now seen corresponding path program 962 times [2020-01-16 19:05:29,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:29,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028604064] [2020-01-16 19:05:29,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:30,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-01-16 19:05:30,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028604064] [2020-01-16 19:05:30,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:30,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:30,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678138846] [2020-01-16 19:05:30,087 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:30,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:30,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:30,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:30,087 INFO L87 Difference]: Start difference. First operand 388 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:05:30,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:30,184 INFO L93 Difference]: Finished difference Result 615 states and 1807 transitions. [2020-01-16 19:05:30,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:30,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:30,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:30,186 INFO L225 Difference]: With dead ends: 615 [2020-01-16 19:05:30,186 INFO L226 Difference]: Without dead ends: 600 [2020-01-16 19:05:30,186 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:30,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-01-16 19:05:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 384. [2020-01-16 19:05:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:05:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1330 transitions. [2020-01-16 19:05:30,194 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1330 transitions. Word has length 22 [2020-01-16 19:05:30,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:30,194 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1330 transitions. [2020-01-16 19:05:30,194 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:30,194 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1330 transitions. [2020-01-16 19:05:30,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:30,195 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:30,195 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:30,195 INFO L426 AbstractCegarLoop]: === Iteration 969 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:30,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:30,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1662296410, now seen corresponding path program 963 times [2020-01-16 19:05:30,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:30,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021089187] [2020-01-16 19:05:30,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:30,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021089187] [2020-01-16 19:05:30,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:30,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:30,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077884972] [2020-01-16 19:05:30,463 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:30,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:30,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:30,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:30,464 INFO L87 Difference]: Start difference. First operand 384 states and 1330 transitions. Second operand 9 states. [2020-01-16 19:05:30,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:30,547 INFO L93 Difference]: Finished difference Result 616 states and 1808 transitions. [2020-01-16 19:05:30,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:30,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:30,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:30,548 INFO L225 Difference]: With dead ends: 616 [2020-01-16 19:05:30,548 INFO L226 Difference]: Without dead ends: 600 [2020-01-16 19:05:30,549 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:30,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-01-16 19:05:30,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 386. [2020-01-16 19:05:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:05:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1332 transitions. [2020-01-16 19:05:30,558 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1332 transitions. Word has length 22 [2020-01-16 19:05:30,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:30,558 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1332 transitions. [2020-01-16 19:05:30,558 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:30,558 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1332 transitions. [2020-01-16 19:05:30,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:30,558 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:30,558 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:30,559 INFO L426 AbstractCegarLoop]: === Iteration 970 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:30,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:30,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1101227918, now seen corresponding path program 964 times [2020-01-16 19:05:30,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:30,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918519978] [2020-01-16 19:05:30,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:30,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918519978] [2020-01-16 19:05:30,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:30,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:30,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819400474] [2020-01-16 19:05:30,824 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:30,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:30,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:30,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:30,825 INFO L87 Difference]: Start difference. First operand 386 states and 1332 transitions. Second operand 9 states. [2020-01-16 19:05:30,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:30,914 INFO L93 Difference]: Finished difference Result 609 states and 1793 transitions. [2020-01-16 19:05:30,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:30,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:30,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:30,916 INFO L225 Difference]: With dead ends: 609 [2020-01-16 19:05:30,916 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:05:30,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:30,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:05:30,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 384. [2020-01-16 19:05:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:05:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1328 transitions. [2020-01-16 19:05:30,926 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1328 transitions. Word has length 22 [2020-01-16 19:05:30,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:30,926 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1328 transitions. [2020-01-16 19:05:30,926 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:30,926 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1328 transitions. [2020-01-16 19:05:30,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:30,927 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:30,927 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:30,927 INFO L426 AbstractCegarLoop]: === Iteration 971 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:30,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:30,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1438380680, now seen corresponding path program 965 times [2020-01-16 19:05:30,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:30,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511371369] [2020-01-16 19:05:30,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:31,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511371369] [2020-01-16 19:05:31,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:31,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:31,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800342378] [2020-01-16 19:05:31,213 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:31,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:31,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:31,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:31,213 INFO L87 Difference]: Start difference. First operand 384 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:05:31,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:31,327 INFO L93 Difference]: Finished difference Result 605 states and 1786 transitions. [2020-01-16 19:05:31,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:31,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:31,329 INFO L225 Difference]: With dead ends: 605 [2020-01-16 19:05:31,329 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:05:31,329 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:31,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:05:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 385. [2020-01-16 19:05:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:05:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1329 transitions. [2020-01-16 19:05:31,338 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1329 transitions. Word has length 22 [2020-01-16 19:05:31,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:31,339 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1329 transitions. [2020-01-16 19:05:31,339 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1329 transitions. [2020-01-16 19:05:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:31,339 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:31,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:31,339 INFO L426 AbstractCegarLoop]: === Iteration 972 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:31,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:31,340 INFO L82 PathProgramCache]: Analyzing trace with hash -7136330, now seen corresponding path program 966 times [2020-01-16 19:05:31,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:31,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819011102] [2020-01-16 19:05:31,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:31,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:31,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819011102] [2020-01-16 19:05:31,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:31,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:31,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776608367] [2020-01-16 19:05:31,623 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:31,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:31,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:31,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:31,624 INFO L87 Difference]: Start difference. First operand 385 states and 1329 transitions. Second operand 9 states. [2020-01-16 19:05:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:31,703 INFO L93 Difference]: Finished difference Result 603 states and 1781 transitions. [2020-01-16 19:05:31,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:31,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:31,705 INFO L225 Difference]: With dead ends: 603 [2020-01-16 19:05:31,705 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 19:05:31,705 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:31,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 19:05:31,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 382. [2020-01-16 19:05:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:05:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1324 transitions. [2020-01-16 19:05:31,715 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1324 transitions. Word has length 22 [2020-01-16 19:05:31,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:31,715 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1324 transitions. [2020-01-16 19:05:31,715 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:31,715 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1324 transitions. [2020-01-16 19:05:31,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:31,716 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:31,716 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:31,716 INFO L426 AbstractCegarLoop]: === Iteration 973 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:31,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:31,716 INFO L82 PathProgramCache]: Analyzing trace with hash -479932374, now seen corresponding path program 967 times [2020-01-16 19:05:31,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:31,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050298370] [2020-01-16 19:05:31,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:31,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-01-16 19:05:31,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050298370] [2020-01-16 19:05:31,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:31,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:31,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32686250] [2020-01-16 19:05:31,993 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:31,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:31,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:31,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:31,994 INFO L87 Difference]: Start difference. First operand 382 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:05:32,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:32,075 INFO L93 Difference]: Finished difference Result 636 states and 1860 transitions. [2020-01-16 19:05:32,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:32,076 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:32,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:32,077 INFO L225 Difference]: With dead ends: 636 [2020-01-16 19:05:32,077 INFO L226 Difference]: Without dead ends: 620 [2020-01-16 19:05:32,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:32,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-01-16 19:05:32,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 391. [2020-01-16 19:05:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:05:32,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1346 transitions. [2020-01-16 19:05:32,087 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1346 transitions. Word has length 22 [2020-01-16 19:05:32,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:32,087 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1346 transitions. [2020-01-16 19:05:32,087 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:32,087 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1346 transitions. [2020-01-16 19:05:32,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:32,088 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:32,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, 1, 1, 1] [2020-01-16 19:05:32,088 INFO L426 AbstractCegarLoop]: === Iteration 974 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:32,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:32,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1110333512, now seen corresponding path program 968 times [2020-01-16 19:05:32,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:32,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978175122] [2020-01-16 19:05:32,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:32,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-01-16 19:05:32,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978175122] [2020-01-16 19:05:32,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:32,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:32,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421610573] [2020-01-16 19:05:32,374 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:32,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:32,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:32,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:32,374 INFO L87 Difference]: Start difference. First operand 391 states and 1346 transitions. Second operand 9 states. [2020-01-16 19:05:32,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:32,481 INFO L93 Difference]: Finished difference Result 631 states and 1847 transitions. [2020-01-16 19:05:32,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:32,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:32,482 INFO L225 Difference]: With dead ends: 631 [2020-01-16 19:05:32,483 INFO L226 Difference]: Without dead ends: 616 [2020-01-16 19:05:32,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:32,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-01-16 19:05:32,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 387. [2020-01-16 19:05:32,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:05:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1336 transitions. [2020-01-16 19:05:32,492 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1336 transitions. Word has length 22 [2020-01-16 19:05:32,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:32,492 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1336 transitions. [2020-01-16 19:05:32,492 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1336 transitions. [2020-01-16 19:05:32,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:32,493 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:32,493 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:32,493 INFO L426 AbstractCegarLoop]: === Iteration 975 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:32,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:32,493 INFO L82 PathProgramCache]: Analyzing trace with hash -214881510, now seen corresponding path program 969 times [2020-01-16 19:05:32,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:32,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268476056] [2020-01-16 19:05:32,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:32,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268476056] [2020-01-16 19:05:32,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:32,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:32,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076606306] [2020-01-16 19:05:32,781 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:32,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:32,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:32,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:32,782 INFO L87 Difference]: Start difference. First operand 387 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:05:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:32,860 INFO L93 Difference]: Finished difference Result 643 states and 1872 transitions. [2020-01-16 19:05:32,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:32,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:32,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:32,862 INFO L225 Difference]: With dead ends: 643 [2020-01-16 19:05:32,862 INFO L226 Difference]: Without dead ends: 627 [2020-01-16 19:05:32,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:32,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-01-16 19:05:32,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 395. [2020-01-16 19:05:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:05:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1349 transitions. [2020-01-16 19:05:32,872 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1349 transitions. Word has length 22 [2020-01-16 19:05:32,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:32,872 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1349 transitions. [2020-01-16 19:05:32,872 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:32,872 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1349 transitions. [2020-01-16 19:05:32,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:32,873 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:32,873 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:32,873 INFO L426 AbstractCegarLoop]: === Iteration 976 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:32,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:32,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1712453060, now seen corresponding path program 970 times [2020-01-16 19:05:32,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:32,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745164982] [2020-01-16 19:05:32,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:33,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745164982] [2020-01-16 19:05:33,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:33,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:33,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433022251] [2020-01-16 19:05:33,152 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:33,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:33,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:33,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:33,153 INFO L87 Difference]: Start difference. First operand 395 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:05:33,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:33,280 INFO L93 Difference]: Finished difference Result 641 states and 1862 transitions. [2020-01-16 19:05:33,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:33,280 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:33,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:33,282 INFO L225 Difference]: With dead ends: 641 [2020-01-16 19:05:33,282 INFO L226 Difference]: Without dead ends: 619 [2020-01-16 19:05:33,282 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:33,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-01-16 19:05:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 387. [2020-01-16 19:05:33,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:05:33,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1331 transitions. [2020-01-16 19:05:33,290 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1331 transitions. Word has length 22 [2020-01-16 19:05:33,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:33,290 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1331 transitions. [2020-01-16 19:05:33,290 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:33,290 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1331 transitions. [2020-01-16 19:05:33,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:33,291 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:33,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, 1, 1, 1] [2020-01-16 19:05:33,291 INFO L426 AbstractCegarLoop]: === Iteration 977 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:33,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:33,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1430177924, now seen corresponding path program 971 times [2020-01-16 19:05:33,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:33,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391364709] [2020-01-16 19:05:33,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:33,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391364709] [2020-01-16 19:05:33,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:33,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:33,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330737568] [2020-01-16 19:05:33,574 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:33,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:33,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:33,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:33,575 INFO L87 Difference]: Start difference. First operand 387 states and 1331 transitions. Second operand 9 states. [2020-01-16 19:05:33,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:33,686 INFO L93 Difference]: Finished difference Result 628 states and 1837 transitions. [2020-01-16 19:05:33,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:33,686 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:33,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:33,688 INFO L225 Difference]: With dead ends: 628 [2020-01-16 19:05:33,688 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 19:05:33,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:33,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 19:05:33,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 390. [2020-01-16 19:05:33,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:05:33,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1336 transitions. [2020-01-16 19:05:33,697 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1336 transitions. Word has length 22 [2020-01-16 19:05:33,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:33,697 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1336 transitions. [2020-01-16 19:05:33,697 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:33,697 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1336 transitions. [2020-01-16 19:05:33,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:33,697 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:33,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, 1, 1, 1] [2020-01-16 19:05:33,698 INFO L426 AbstractCegarLoop]: === Iteration 978 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:33,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:33,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1411743898, now seen corresponding path program 972 times [2020-01-16 19:05:33,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:33,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831096760] [2020-01-16 19:05:33,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:33,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-01-16 19:05:33,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831096760] [2020-01-16 19:05:33,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:33,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:33,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119340714] [2020-01-16 19:05:33,983 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:33,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:33,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:33,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:33,983 INFO L87 Difference]: Start difference. First operand 390 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:05:34,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:34,086 INFO L93 Difference]: Finished difference Result 631 states and 1840 transitions. [2020-01-16 19:05:34,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:34,087 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:34,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:34,088 INFO L225 Difference]: With dead ends: 631 [2020-01-16 19:05:34,088 INFO L226 Difference]: Without dead ends: 609 [2020-01-16 19:05:34,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:34,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-01-16 19:05:34,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 382. [2020-01-16 19:05:34,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:05:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1321 transitions. [2020-01-16 19:05:34,097 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1321 transitions. Word has length 22 [2020-01-16 19:05:34,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:34,098 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1321 transitions. [2020-01-16 19:05:34,098 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1321 transitions. [2020-01-16 19:05:34,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:34,098 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:34,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, 1, 1, 1] [2020-01-16 19:05:34,098 INFO L426 AbstractCegarLoop]: === Iteration 979 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:34,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:34,099 INFO L82 PathProgramCache]: Analyzing trace with hash 679179110, now seen corresponding path program 973 times [2020-01-16 19:05:34,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:34,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609662951] [2020-01-16 19:05:34,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:34,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609662951] [2020-01-16 19:05:34,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:34,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:34,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685597271] [2020-01-16 19:05:34,366 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:34,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:34,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:34,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:34,366 INFO L87 Difference]: Start difference. First operand 382 states and 1321 transitions. Second operand 9 states. [2020-01-16 19:05:34,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:34,444 INFO L93 Difference]: Finished difference Result 624 states and 1823 transitions. [2020-01-16 19:05:34,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:34,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:34,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:34,446 INFO L225 Difference]: With dead ends: 624 [2020-01-16 19:05:34,446 INFO L226 Difference]: Without dead ends: 608 [2020-01-16 19:05:34,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:34,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-01-16 19:05:34,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 387. [2020-01-16 19:05:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:05:34,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1331 transitions. [2020-01-16 19:05:34,456 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1331 transitions. Word has length 22 [2020-01-16 19:05:34,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:34,456 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1331 transitions. [2020-01-16 19:05:34,456 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:34,456 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1331 transitions. [2020-01-16 19:05:34,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:34,456 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:34,456 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:34,456 INFO L426 AbstractCegarLoop]: === Iteration 980 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:34,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:34,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1240247602, now seen corresponding path program 974 times [2020-01-16 19:05:34,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:34,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89895786] [2020-01-16 19:05:34,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:34,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:34,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89895786] [2020-01-16 19:05:34,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:34,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:34,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52329917] [2020-01-16 19:05:34,726 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:34,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:34,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:34,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:34,726 INFO L87 Difference]: Start difference. First operand 387 states and 1331 transitions. Second operand 9 states. [2020-01-16 19:05:34,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:34,804 INFO L93 Difference]: Finished difference Result 617 states and 1808 transitions. [2020-01-16 19:05:34,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:34,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:34,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:34,806 INFO L225 Difference]: With dead ends: 617 [2020-01-16 19:05:34,806 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 19:05:34,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:34,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 19:05:34,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 385. [2020-01-16 19:05:34,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:05:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1327 transitions. [2020-01-16 19:05:34,815 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1327 transitions. Word has length 22 [2020-01-16 19:05:34,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:34,815 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1327 transitions. [2020-01-16 19:05:34,815 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:34,815 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1327 transitions. [2020-01-16 19:05:34,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:34,816 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:34,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, 1, 1, 1] [2020-01-16 19:05:34,816 INFO L426 AbstractCegarLoop]: === Iteration 981 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:34,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:34,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1691871642, now seen corresponding path program 975 times [2020-01-16 19:05:34,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:34,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925511553] [2020-01-16 19:05:34,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:35,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-01-16 19:05:35,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925511553] [2020-01-16 19:05:35,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:35,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:35,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893025284] [2020-01-16 19:05:35,107 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:35,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:35,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:35,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:35,108 INFO L87 Difference]: Start difference. First operand 385 states and 1327 transitions. Second operand 9 states. [2020-01-16 19:05:35,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:35,191 INFO L93 Difference]: Finished difference Result 635 states and 1847 transitions. [2020-01-16 19:05:35,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:35,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:35,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:35,193 INFO L225 Difference]: With dead ends: 635 [2020-01-16 19:05:35,193 INFO L226 Difference]: Without dead ends: 619 [2020-01-16 19:05:35,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:35,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-01-16 19:05:35,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 393. [2020-01-16 19:05:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:05:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1340 transitions. [2020-01-16 19:05:35,203 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1340 transitions. Word has length 22 [2020-01-16 19:05:35,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:35,203 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1340 transitions. [2020-01-16 19:05:35,203 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:35,203 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1340 transitions. [2020-01-16 19:05:35,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:35,203 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:35,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, 1, 1, 1] [2020-01-16 19:05:35,203 INFO L426 AbstractCegarLoop]: === Iteration 982 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:35,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:35,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1561901196, now seen corresponding path program 976 times [2020-01-16 19:05:35,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:35,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344090554] [2020-01-16 19:05:35,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:35,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-01-16 19:05:35,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344090554] [2020-01-16 19:05:35,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:35,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:35,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145754490] [2020-01-16 19:05:35,479 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:35,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:35,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:35,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:35,479 INFO L87 Difference]: Start difference. First operand 393 states and 1340 transitions. Second operand 9 states. [2020-01-16 19:05:35,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:35,589 INFO L93 Difference]: Finished difference Result 633 states and 1837 transitions. [2020-01-16 19:05:35,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:35,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:35,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:35,590 INFO L225 Difference]: With dead ends: 633 [2020-01-16 19:05:35,591 INFO L226 Difference]: Without dead ends: 611 [2020-01-16 19:05:35,591 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:35,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-01-16 19:05:35,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 385. [2020-01-16 19:05:35,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:05:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1324 transitions. [2020-01-16 19:05:35,600 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1324 transitions. Word has length 22 [2020-01-16 19:05:35,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:35,601 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1324 transitions. [2020-01-16 19:05:35,601 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1324 transitions. [2020-01-16 19:05:35,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:35,601 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:35,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, 1, 1, 1] [2020-01-16 19:05:35,601 INFO L426 AbstractCegarLoop]: === Iteration 983 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:35,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:35,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1746593868, now seen corresponding path program 977 times [2020-01-16 19:05:35,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:35,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360490545] [2020-01-16 19:05:35,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:35,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:35,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360490545] [2020-01-16 19:05:35,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:35,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:35,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329493217] [2020-01-16 19:05:35,872 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:35,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:35,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:35,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:35,872 INFO L87 Difference]: Start difference. First operand 385 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:05:35,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:35,974 INFO L93 Difference]: Finished difference Result 614 states and 1800 transitions. [2020-01-16 19:05:35,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:35,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:35,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:35,976 INFO L225 Difference]: With dead ends: 614 [2020-01-16 19:05:35,976 INFO L226 Difference]: Without dead ends: 605 [2020-01-16 19:05:35,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:35,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-01-16 19:05:35,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 386. [2020-01-16 19:05:35,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:05:35,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1325 transitions. [2020-01-16 19:05:35,986 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1325 transitions. Word has length 22 [2020-01-16 19:05:35,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:35,986 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1325 transitions. [2020-01-16 19:05:35,986 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1325 transitions. [2020-01-16 19:05:35,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:35,987 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:35,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, 1, 1, 1] [2020-01-16 19:05:35,987 INFO L426 AbstractCegarLoop]: === Iteration 984 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:35,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:35,987 INFO L82 PathProgramCache]: Analyzing trace with hash 670882712, now seen corresponding path program 978 times [2020-01-16 19:05:35,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:35,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382616947] [2020-01-16 19:05:35,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:36,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382616947] [2020-01-16 19:05:36,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:36,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:36,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126673559] [2020-01-16 19:05:36,252 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:36,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:36,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:36,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:36,252 INFO L87 Difference]: Start difference. First operand 386 states and 1325 transitions. Second operand 9 states. [2020-01-16 19:05:36,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:36,377 INFO L93 Difference]: Finished difference Result 619 states and 1809 transitions. [2020-01-16 19:05:36,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:36,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:36,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:36,378 INFO L225 Difference]: With dead ends: 619 [2020-01-16 19:05:36,379 INFO L226 Difference]: Without dead ends: 601 [2020-01-16 19:05:36,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:36,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-01-16 19:05:36,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 382. [2020-01-16 19:05:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:05:36,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1318 transitions. [2020-01-16 19:05:36,387 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1318 transitions. Word has length 22 [2020-01-16 19:05:36,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:36,387 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1318 transitions. [2020-01-16 19:05:36,387 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:36,387 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1318 transitions. [2020-01-16 19:05:36,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:36,388 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:36,388 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:36,388 INFO L426 AbstractCegarLoop]: === Iteration 985 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:36,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:36,388 INFO L82 PathProgramCache]: Analyzing trace with hash -958010236, now seen corresponding path program 979 times [2020-01-16 19:05:36,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:36,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095018407] [2020-01-16 19:05:36,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:36,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-01-16 19:05:36,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095018407] [2020-01-16 19:05:36,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:36,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:36,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098076906] [2020-01-16 19:05:36,665 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:36,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:36,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:36,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:36,665 INFO L87 Difference]: Start difference. First operand 382 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:05:36,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:36,784 INFO L93 Difference]: Finished difference Result 600 states and 1772 transitions. [2020-01-16 19:05:36,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:36,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:36,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:36,786 INFO L225 Difference]: With dead ends: 600 [2020-01-16 19:05:36,786 INFO L226 Difference]: Without dead ends: 589 [2020-01-16 19:05:36,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:36,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-01-16 19:05:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 384. [2020-01-16 19:05:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:05:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1322 transitions. [2020-01-16 19:05:36,795 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1322 transitions. Word has length 22 [2020-01-16 19:05:36,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:36,796 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1322 transitions. [2020-01-16 19:05:36,796 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1322 transitions. [2020-01-16 19:05:36,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:36,796 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:36,796 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:36,796 INFO L426 AbstractCegarLoop]: === Iteration 986 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:36,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:36,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1891440050, now seen corresponding path program 980 times [2020-01-16 19:05:36,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:36,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866752998] [2020-01-16 19:05:36,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:37,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-01-16 19:05:37,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866752998] [2020-01-16 19:05:37,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:37,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:37,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039436544] [2020-01-16 19:05:37,078 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:37,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:37,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:37,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:37,078 INFO L87 Difference]: Start difference. First operand 384 states and 1322 transitions. Second operand 9 states. [2020-01-16 19:05:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:37,167 INFO L93 Difference]: Finished difference Result 598 states and 1767 transitions. [2020-01-16 19:05:37,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:37,167 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:37,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:37,169 INFO L225 Difference]: With dead ends: 598 [2020-01-16 19:05:37,169 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 19:05:37,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 19:05:37,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 383. [2020-01-16 19:05:37,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:05:37,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1320 transitions. [2020-01-16 19:05:37,177 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1320 transitions. Word has length 22 [2020-01-16 19:05:37,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:37,177 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1320 transitions. [2020-01-16 19:05:37,177 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:37,177 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1320 transitions. [2020-01-16 19:05:37,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:37,178 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:37,178 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:37,178 INFO L426 AbstractCegarLoop]: === Iteration 987 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:37,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:37,178 INFO L82 PathProgramCache]: Analyzing trace with hash 54682296, now seen corresponding path program 981 times [2020-01-16 19:05:37,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:37,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548966357] [2020-01-16 19:05:37,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:37,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548966357] [2020-01-16 19:05:37,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:37,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:37,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307704156] [2020-01-16 19:05:37,487 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:37,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:37,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:37,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:37,487 INFO L87 Difference]: Start difference. First operand 383 states and 1320 transitions. Second operand 9 states. [2020-01-16 19:05:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:37,601 INFO L93 Difference]: Finished difference Result 607 states and 1787 transitions. [2020-01-16 19:05:37,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:37,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:37,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:37,603 INFO L225 Difference]: With dead ends: 607 [2020-01-16 19:05:37,603 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 19:05:37,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 19:05:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 386. [2020-01-16 19:05:37,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:05:37,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1325 transitions. [2020-01-16 19:05:37,612 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1325 transitions. Word has length 22 [2020-01-16 19:05:37,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:37,612 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1325 transitions. [2020-01-16 19:05:37,612 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:37,612 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1325 transitions. [2020-01-16 19:05:37,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:37,613 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:37,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, 1, 1, 1] [2020-01-16 19:05:37,613 INFO L426 AbstractCegarLoop]: === Iteration 988 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:37,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:37,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1440717426, now seen corresponding path program 982 times [2020-01-16 19:05:37,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:37,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907937172] [2020-01-16 19:05:37,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:37,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-01-16 19:05:37,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907937172] [2020-01-16 19:05:37,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:37,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:37,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383804828] [2020-01-16 19:05:37,897 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:37,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:37,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:37,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:37,897 INFO L87 Difference]: Start difference. First operand 386 states and 1325 transitions. Second operand 9 states. [2020-01-16 19:05:38,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:38,018 INFO L93 Difference]: Finished difference Result 610 states and 1790 transitions. [2020-01-16 19:05:38,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:38,019 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:38,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:38,020 INFO L225 Difference]: With dead ends: 610 [2020-01-16 19:05:38,020 INFO L226 Difference]: Without dead ends: 593 [2020-01-16 19:05:38,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:38,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-01-16 19:05:38,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 383. [2020-01-16 19:05:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:05:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1319 transitions. [2020-01-16 19:05:38,029 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1319 transitions. Word has length 22 [2020-01-16 19:05:38,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:38,030 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1319 transitions. [2020-01-16 19:05:38,030 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1319 transitions. [2020-01-16 19:05:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:38,030 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:38,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, 1, 1, 1] [2020-01-16 19:05:38,030 INFO L426 AbstractCegarLoop]: === Iteration 989 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:38,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:38,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1303694728, now seen corresponding path program 983 times [2020-01-16 19:05:38,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:38,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810903290] [2020-01-16 19:05:38,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:38,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-01-16 19:05:38,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810903290] [2020-01-16 19:05:38,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:38,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:38,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13082644] [2020-01-16 19:05:38,301 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:38,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:38,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:38,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:38,302 INFO L87 Difference]: Start difference. First operand 383 states and 1319 transitions. Second operand 9 states. [2020-01-16 19:05:38,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:38,389 INFO L93 Difference]: Finished difference Result 601 states and 1772 transitions. [2020-01-16 19:05:38,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:38,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:38,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:38,391 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:05:38,391 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 19:05:38,391 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:38,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 19:05:38,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 384. [2020-01-16 19:05:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:05:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1320 transitions. [2020-01-16 19:05:38,400 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1320 transitions. Word has length 22 [2020-01-16 19:05:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:38,401 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1320 transitions. [2020-01-16 19:05:38,401 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1320 transitions. [2020-01-16 19:05:38,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:38,401 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:38,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, 1, 1, 1] [2020-01-16 19:05:38,402 INFO L426 AbstractCegarLoop]: === Iteration 990 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:38,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:38,402 INFO L82 PathProgramCache]: Analyzing trace with hash 227983572, now seen corresponding path program 984 times [2020-01-16 19:05:38,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:38,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093649167] [2020-01-16 19:05:38,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:38,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-01-16 19:05:38,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093649167] [2020-01-16 19:05:38,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:38,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:38,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959710389] [2020-01-16 19:05:38,671 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:38,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:38,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:38,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:38,671 INFO L87 Difference]: Start difference. First operand 384 states and 1320 transitions. Second operand 9 states. [2020-01-16 19:05:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:38,783 INFO L93 Difference]: Finished difference Result 606 states and 1781 transitions. [2020-01-16 19:05:38,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:38,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:38,785 INFO L225 Difference]: With dead ends: 606 [2020-01-16 19:05:38,785 INFO L226 Difference]: Without dead ends: 587 [2020-01-16 19:05:38,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:38,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-01-16 19:05:38,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 379. [2020-01-16 19:05:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:05:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1312 transitions. [2020-01-16 19:05:38,794 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1312 transitions. Word has length 22 [2020-01-16 19:05:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:38,794 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1312 transitions. [2020-01-16 19:05:38,794 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1312 transitions. [2020-01-16 19:05:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:38,794 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:38,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, 1, 1, 1] [2020-01-16 19:05:38,795 INFO L426 AbstractCegarLoop]: === Iteration 991 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:38,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:38,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1067964948, now seen corresponding path program 985 times [2020-01-16 19:05:38,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:38,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690388158] [2020-01-16 19:05:38,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:39,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690388158] [2020-01-16 19:05:39,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:39,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:39,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398136060] [2020-01-16 19:05:39,068 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:39,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:39,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:39,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:39,068 INFO L87 Difference]: Start difference. First operand 379 states and 1312 transitions. Second operand 9 states. [2020-01-16 19:05:39,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:39,173 INFO L93 Difference]: Finished difference Result 610 states and 1793 transitions. [2020-01-16 19:05:39,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:39,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:39,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:39,174 INFO L225 Difference]: With dead ends: 610 [2020-01-16 19:05:39,174 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:05:39,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:39,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:05:39,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 387. [2020-01-16 19:05:39,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:05:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1332 transitions. [2020-01-16 19:05:39,183 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1332 transitions. Word has length 22 [2020-01-16 19:05:39,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:39,183 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1332 transitions. [2020-01-16 19:05:39,183 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:39,183 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1332 transitions. [2020-01-16 19:05:39,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:39,184 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:39,184 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:39,184 INFO L426 AbstractCegarLoop]: === Iteration 992 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:39,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:39,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1636736462, now seen corresponding path program 986 times [2020-01-16 19:05:39,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:39,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005262373] [2020-01-16 19:05:39,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:39,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-01-16 19:05:39,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005262373] [2020-01-16 19:05:39,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:39,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:39,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739630120] [2020-01-16 19:05:39,452 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:39,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:39,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:39,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:39,452 INFO L87 Difference]: Start difference. First operand 387 states and 1332 transitions. Second operand 9 states. [2020-01-16 19:05:39,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:39,576 INFO L93 Difference]: Finished difference Result 605 states and 1780 transitions. [2020-01-16 19:05:39,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:39,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:39,577 INFO L225 Difference]: With dead ends: 605 [2020-01-16 19:05:39,578 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 19:05:39,578 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:39,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 19:05:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 383. [2020-01-16 19:05:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:05:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1324 transitions. [2020-01-16 19:05:39,587 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1324 transitions. Word has length 22 [2020-01-16 19:05:39,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:39,587 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1324 transitions. [2020-01-16 19:05:39,587 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:39,587 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1324 transitions. [2020-01-16 19:05:39,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:39,588 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:39,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, 1, 1, 1] [2020-01-16 19:05:39,588 INFO L426 AbstractCegarLoop]: === Iteration 993 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:39,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:39,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1874452028, now seen corresponding path program 987 times [2020-01-16 19:05:39,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:39,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572388473] [2020-01-16 19:05:39,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:39,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572388473] [2020-01-16 19:05:39,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:39,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:39,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174299878] [2020-01-16 19:05:39,847 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:39,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:39,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:39,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:39,847 INFO L87 Difference]: Start difference. First operand 383 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:05:39,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:39,925 INFO L93 Difference]: Finished difference Result 606 states and 1781 transitions. [2020-01-16 19:05:39,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:39,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:39,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:39,927 INFO L225 Difference]: With dead ends: 606 [2020-01-16 19:05:39,927 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 19:05:39,927 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 19:05:39,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 385. [2020-01-16 19:05:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:05:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1326 transitions. [2020-01-16 19:05:39,937 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1326 transitions. Word has length 22 [2020-01-16 19:05:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:39,937 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1326 transitions. [2020-01-16 19:05:39,937 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1326 transitions. [2020-01-16 19:05:39,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:39,938 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:39,938 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:39,938 INFO L426 AbstractCegarLoop]: === Iteration 994 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:39,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:39,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1313383536, now seen corresponding path program 988 times [2020-01-16 19:05:39,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:39,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722382912] [2020-01-16 19:05:39,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:40,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-01-16 19:05:40,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722382912] [2020-01-16 19:05:40,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:40,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:40,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870092140] [2020-01-16 19:05:40,203 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:40,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:40,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:40,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:40,203 INFO L87 Difference]: Start difference. First operand 385 states and 1326 transitions. Second operand 9 states. [2020-01-16 19:05:40,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:40,297 INFO L93 Difference]: Finished difference Result 599 states and 1766 transitions. [2020-01-16 19:05:40,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:40,298 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:40,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:40,299 INFO L225 Difference]: With dead ends: 599 [2020-01-16 19:05:40,299 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 19:05:40,300 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:40,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 19:05:40,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 383. [2020-01-16 19:05:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:05:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1322 transitions. [2020-01-16 19:05:40,309 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1322 transitions. Word has length 22 [2020-01-16 19:05:40,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:40,309 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1322 transitions. [2020-01-16 19:05:40,309 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:40,309 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1322 transitions. [2020-01-16 19:05:40,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:40,309 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:40,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, 1, 1, 1] [2020-01-16 19:05:40,310 INFO L426 AbstractCegarLoop]: === Iteration 995 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:40,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:40,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1226225062, now seen corresponding path program 989 times [2020-01-16 19:05:40,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:40,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120161100] [2020-01-16 19:05:40,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:40,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-01-16 19:05:40,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120161100] [2020-01-16 19:05:40,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:40,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:40,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017936684] [2020-01-16 19:05:40,598 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:40,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:40,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:40,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:40,598 INFO L87 Difference]: Start difference. First operand 383 states and 1322 transitions. Second operand 9 states. [2020-01-16 19:05:40,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:40,713 INFO L93 Difference]: Finished difference Result 595 states and 1759 transitions. [2020-01-16 19:05:40,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:40,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:40,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:40,714 INFO L225 Difference]: With dead ends: 595 [2020-01-16 19:05:40,714 INFO L226 Difference]: Without dead ends: 584 [2020-01-16 19:05:40,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:40,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-01-16 19:05:40,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 384. [2020-01-16 19:05:40,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:05:40,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-01-16 19:05:40,723 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-01-16 19:05:40,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:40,723 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-01-16 19:05:40,723 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-01-16 19:05:40,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:40,724 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:40,724 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:40,724 INFO L426 AbstractCegarLoop]: === Iteration 996 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:40,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:40,724 INFO L82 PathProgramCache]: Analyzing trace with hash -219291948, now seen corresponding path program 990 times [2020-01-16 19:05:40,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:40,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392859940] [2020-01-16 19:05:40,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:40,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-01-16 19:05:40,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392859940] [2020-01-16 19:05:40,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:40,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:40,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156336738] [2020-01-16 19:05:40,996 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:40,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:40,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:40,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:40,997 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:05:41,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:41,097 INFO L93 Difference]: Finished difference Result 593 states and 1754 transitions. [2020-01-16 19:05:41,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:41,097 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:41,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:41,099 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:05:41,099 INFO L226 Difference]: Without dead ends: 581 [2020-01-16 19:05:41,099 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:41,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-01-16 19:05:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 381. [2020-01-16 19:05:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:05:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1318 transitions. [2020-01-16 19:05:41,108 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1318 transitions. Word has length 22 [2020-01-16 19:05:41,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:41,108 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1318 transitions. [2020-01-16 19:05:41,108 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:41,108 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1318 transitions. [2020-01-16 19:05:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:41,109 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:41,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, 1, 1, 1] [2020-01-16 19:05:41,109 INFO L426 AbstractCegarLoop]: === Iteration 997 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:41,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:41,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1114573718, now seen corresponding path program 991 times [2020-01-16 19:05:41,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:41,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871456472] [2020-01-16 19:05:41,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:41,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-01-16 19:05:41,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871456472] [2020-01-16 19:05:41,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:41,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:41,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978589770] [2020-01-16 19:05:41,387 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:41,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:41,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:41,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:41,387 INFO L87 Difference]: Start difference. First operand 381 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:05:41,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:41,467 INFO L93 Difference]: Finished difference Result 616 states and 1810 transitions. [2020-01-16 19:05:41,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:41,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:41,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:41,469 INFO L225 Difference]: With dead ends: 616 [2020-01-16 19:05:41,469 INFO L226 Difference]: Without dead ends: 600 [2020-01-16 19:05:41,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:41,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-01-16 19:05:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 389. [2020-01-16 19:05:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:05:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1338 transitions. [2020-01-16 19:05:41,479 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1338 transitions. Word has length 22 [2020-01-16 19:05:41,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:41,479 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1338 transitions. [2020-01-16 19:05:41,479 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1338 transitions. [2020-01-16 19:05:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:41,480 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:41,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, 1, 1, 1] [2020-01-16 19:05:41,480 INFO L426 AbstractCegarLoop]: === Iteration 998 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:41,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:41,480 INFO L82 PathProgramCache]: Analyzing trace with hash 475692168, now seen corresponding path program 992 times [2020-01-16 19:05:41,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:41,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423873875] [2020-01-16 19:05:41,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:41,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-01-16 19:05:41,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423873875] [2020-01-16 19:05:41,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:41,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:41,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22969117] [2020-01-16 19:05:41,750 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:41,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:41,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:41,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:41,750 INFO L87 Difference]: Start difference. First operand 389 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:05:41,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:41,859 INFO L93 Difference]: Finished difference Result 611 states and 1797 transitions. [2020-01-16 19:05:41,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:41,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:41,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:41,861 INFO L225 Difference]: With dead ends: 611 [2020-01-16 19:05:41,861 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 19:05:41,861 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:41,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 19:05:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 385. [2020-01-16 19:05:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:05:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1328 transitions. [2020-01-16 19:05:41,870 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1328 transitions. Word has length 22 [2020-01-16 19:05:41,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:41,871 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1328 transitions. [2020-01-16 19:05:41,871 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:41,871 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1328 transitions. [2020-01-16 19:05:41,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:41,871 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:41,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, 1, 1, 1] [2020-01-16 19:05:41,871 INFO L426 AbstractCegarLoop]: === Iteration 999 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:41,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:41,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1831716826, now seen corresponding path program 993 times [2020-01-16 19:05:41,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:41,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982953114] [2020-01-16 19:05:41,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:42,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982953114] [2020-01-16 19:05:42,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:42,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:42,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705278708] [2020-01-16 19:05:42,169 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:42,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:42,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:42,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:42,169 INFO L87 Difference]: Start difference. First operand 385 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:05:42,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:42,256 INFO L93 Difference]: Finished difference Result 610 states and 1797 transitions. [2020-01-16 19:05:42,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:42,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:42,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:42,258 INFO L225 Difference]: With dead ends: 610 [2020-01-16 19:05:42,258 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:05:42,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:42,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:05:42,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 390. [2020-01-16 19:05:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:05:42,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1336 transitions. [2020-01-16 19:05:42,268 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1336 transitions. Word has length 22 [2020-01-16 19:05:42,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:42,268 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1336 transitions. [2020-01-16 19:05:42,268 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1336 transitions. [2020-01-16 19:05:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:42,269 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:42,269 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:42,269 INFO L426 AbstractCegarLoop]: === Iteration 1000 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:42,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:42,269 INFO L82 PathProgramCache]: Analyzing trace with hash 130388924, now seen corresponding path program 994 times [2020-01-16 19:05:42,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:42,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344317798] [2020-01-16 19:05:42,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:42,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-01-16 19:05:42,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344317798] [2020-01-16 19:05:42,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:42,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:42,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354862979] [2020-01-16 19:05:42,545 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:42,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:42,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:42,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:42,545 INFO L87 Difference]: Start difference. First operand 390 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:05:42,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:42,665 INFO L93 Difference]: Finished difference Result 597 states and 1777 transitions. [2020-01-16 19:05:42,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:42,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:42,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:42,666 INFO L225 Difference]: With dead ends: 597 [2020-01-16 19:05:42,666 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:05:42,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:42,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:05:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 385. [2020-01-16 19:05:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:05:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1324 transitions. [2020-01-16 19:05:42,675 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1324 transitions. Word has length 22 [2020-01-16 19:05:42,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:42,675 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1324 transitions. [2020-01-16 19:05:42,675 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:42,675 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1324 transitions. [2020-01-16 19:05:42,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:42,676 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:42,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, 1, 1, 1] [2020-01-16 19:05:42,676 INFO L426 AbstractCegarLoop]: === Iteration 1001 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:42,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:42,676 INFO L82 PathProgramCache]: Analyzing trace with hash 616420412, now seen corresponding path program 995 times [2020-01-16 19:05:42,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:42,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360914833] [2020-01-16 19:05:42,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:42,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-01-16 19:05:42,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360914833] [2020-01-16 19:05:42,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:42,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:42,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306518407] [2020-01-16 19:05:42,946 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:42,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:42,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:42,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:42,947 INFO L87 Difference]: Start difference. First operand 385 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:05:43,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:43,060 INFO L93 Difference]: Finished difference Result 603 states and 1779 transitions. [2020-01-16 19:05:43,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:43,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:43,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:43,062 INFO L225 Difference]: With dead ends: 603 [2020-01-16 19:05:43,062 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 19:05:43,062 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:43,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 19:05:43,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 388. [2020-01-16 19:05:43,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:05:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1329 transitions. [2020-01-16 19:05:43,072 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1329 transitions. Word has length 22 [2020-01-16 19:05:43,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:43,072 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1329 transitions. [2020-01-16 19:05:43,072 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:43,072 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1329 transitions. [2020-01-16 19:05:43,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:43,073 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:43,073 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:43,073 INFO L426 AbstractCegarLoop]: === Iteration 1002 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:43,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:43,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1490161092, now seen corresponding path program 996 times [2020-01-16 19:05:43,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:43,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682474365] [2020-01-16 19:05:43,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:43,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-01-16 19:05:43,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682474365] [2020-01-16 19:05:43,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:43,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:43,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340776416] [2020-01-16 19:05:43,346 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:43,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:43,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:43,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:43,347 INFO L87 Difference]: Start difference. First operand 388 states and 1329 transitions. Second operand 9 states. [2020-01-16 19:05:43,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:43,466 INFO L93 Difference]: Finished difference Result 595 states and 1770 transitions. [2020-01-16 19:05:43,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:43,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:43,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:43,468 INFO L225 Difference]: With dead ends: 595 [2020-01-16 19:05:43,468 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:05:43,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:43,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:05:43,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 381. [2020-01-16 19:05:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:05:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1316 transitions. [2020-01-16 19:05:43,477 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1316 transitions. Word has length 22 [2020-01-16 19:05:43,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:43,478 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1316 transitions. [2020-01-16 19:05:43,478 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1316 transitions. [2020-01-16 19:05:43,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:43,478 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:43,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, 1, 1, 1] [2020-01-16 19:05:43,478 INFO L426 AbstractCegarLoop]: === Iteration 1003 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:43,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:43,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1970571844, now seen corresponding path program 997 times [2020-01-16 19:05:43,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:43,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489182561] [2020-01-16 19:05:43,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:43,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-01-16 19:05:43,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489182561] [2020-01-16 19:05:43,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:43,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:43,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606401216] [2020-01-16 19:05:43,759 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:43,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:43,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:43,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:43,760 INFO L87 Difference]: Start difference. First operand 381 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:05:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:43,837 INFO L93 Difference]: Finished difference Result 606 states and 1780 transitions. [2020-01-16 19:05:43,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:43,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:43,839 INFO L225 Difference]: With dead ends: 606 [2020-01-16 19:05:43,839 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 19:05:43,839 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:43,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 19:05:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 385. [2020-01-16 19:05:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:05:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1324 transitions. [2020-01-16 19:05:43,848 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1324 transitions. Word has length 22 [2020-01-16 19:05:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:43,849 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1324 transitions. [2020-01-16 19:05:43,849 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1324 transitions. [2020-01-16 19:05:43,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:43,849 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:43,849 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:43,849 INFO L426 AbstractCegarLoop]: === Iteration 1004 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:43,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:43,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1763326960, now seen corresponding path program 998 times [2020-01-16 19:05:43,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:43,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843564343] [2020-01-16 19:05:43,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:44,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843564343] [2020-01-16 19:05:44,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:44,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:44,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111446512] [2020-01-16 19:05:44,116 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:44,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:44,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:44,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:44,117 INFO L87 Difference]: Start difference. First operand 385 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:05:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:44,203 INFO L93 Difference]: Finished difference Result 599 states and 1765 transitions. [2020-01-16 19:05:44,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:44,203 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:44,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:44,204 INFO L225 Difference]: With dead ends: 599 [2020-01-16 19:05:44,204 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 19:05:44,205 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:44,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 19:05:44,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 383. [2020-01-16 19:05:44,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:05:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1320 transitions. [2020-01-16 19:05:44,213 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1320 transitions. Word has length 22 [2020-01-16 19:05:44,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:44,213 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1320 transitions. [2020-01-16 19:05:44,213 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:44,213 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1320 transitions. [2020-01-16 19:05:44,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:44,214 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:44,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, 1, 1, 1] [2020-01-16 19:05:44,214 INFO L426 AbstractCegarLoop]: === Iteration 1005 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:44,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:44,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1382826522, now seen corresponding path program 999 times [2020-01-16 19:05:44,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:44,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410789845] [2020-01-16 19:05:44,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:44,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410789845] [2020-01-16 19:05:44,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:44,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:44,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869403918] [2020-01-16 19:05:44,492 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:44,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:44,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:44,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:44,493 INFO L87 Difference]: Start difference. First operand 383 states and 1320 transitions. Second operand 9 states. [2020-01-16 19:05:44,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:44,578 INFO L93 Difference]: Finished difference Result 604 states and 1779 transitions. [2020-01-16 19:05:44,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:44,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:44,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:44,580 INFO L225 Difference]: With dead ends: 604 [2020-01-16 19:05:44,580 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 19:05:44,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:44,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 19:05:44,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 388. [2020-01-16 19:05:44,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:05:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1328 transitions. [2020-01-16 19:05:44,589 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1328 transitions. Word has length 22 [2020-01-16 19:05:44,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:44,589 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1328 transitions. [2020-01-16 19:05:44,589 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:44,589 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1328 transitions. [2020-01-16 19:05:44,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:44,590 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:44,590 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:44,590 INFO L426 AbstractCegarLoop]: === Iteration 1006 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:44,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:44,590 INFO L82 PathProgramCache]: Analyzing trace with hash -890224116, now seen corresponding path program 1000 times [2020-01-16 19:05:44,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:44,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83533107] [2020-01-16 19:05:44,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:44,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-01-16 19:05:44,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83533107] [2020-01-16 19:05:44,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:44,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:44,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939999648] [2020-01-16 19:05:44,861 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:44,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:44,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:44,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:44,862 INFO L87 Difference]: Start difference. First operand 388 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:05:44,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:44,975 INFO L93 Difference]: Finished difference Result 591 states and 1759 transitions. [2020-01-16 19:05:44,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:44,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:44,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:44,977 INFO L225 Difference]: With dead ends: 591 [2020-01-16 19:05:44,977 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:05:44,977 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:44,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:05:44,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 383. [2020-01-16 19:05:44,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:05:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-01-16 19:05:44,985 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-01-16 19:05:44,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:44,985 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-01-16 19:05:44,986 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-01-16 19:05:44,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:44,986 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:44,986 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:44,986 INFO L426 AbstractCegarLoop]: === Iteration 1007 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:44,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:44,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1437548748, now seen corresponding path program 1001 times [2020-01-16 19:05:44,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:44,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558116651] [2020-01-16 19:05:44,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:45,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558116651] [2020-01-16 19:05:45,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:45,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:45,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445230221] [2020-01-16 19:05:45,273 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:45,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:45,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:45,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:45,273 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:05:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:45,355 INFO L93 Difference]: Finished difference Result 593 states and 1753 transitions. [2020-01-16 19:05:45,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:45,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:45,356 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:05:45,356 INFO L226 Difference]: Without dead ends: 584 [2020-01-16 19:05:45,357 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:45,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-01-16 19:05:45,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 384. [2020-01-16 19:05:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:05:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1319 transitions. [2020-01-16 19:05:45,365 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1319 transitions. Word has length 22 [2020-01-16 19:05:45,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:45,365 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1319 transitions. [2020-01-16 19:05:45,365 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1319 transitions. [2020-01-16 19:05:45,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:45,366 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:45,366 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:45,366 INFO L426 AbstractCegarLoop]: === Iteration 1008 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:45,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:45,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1972778550, now seen corresponding path program 1002 times [2020-01-16 19:05:45,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:45,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512726407] [2020-01-16 19:05:45,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:45,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512726407] [2020-01-16 19:05:45,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:45,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:45,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209490048] [2020-01-16 19:05:45,634 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:45,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:45,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:45,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:45,634 INFO L87 Difference]: Start difference. First operand 384 states and 1319 transitions. Second operand 9 states. [2020-01-16 19:05:45,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:45,750 INFO L93 Difference]: Finished difference Result 587 states and 1750 transitions. [2020-01-16 19:05:45,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:45,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:45,751 INFO L225 Difference]: With dead ends: 587 [2020-01-16 19:05:45,752 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:05:45,752 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:45,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:05:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 381. [2020-01-16 19:05:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:05:45,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1314 transitions. [2020-01-16 19:05:45,760 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1314 transitions. Word has length 22 [2020-01-16 19:05:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:45,760 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1314 transitions. [2020-01-16 19:05:45,760 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:45,760 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1314 transitions. [2020-01-16 19:05:45,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:45,761 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:45,761 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:45,761 INFO L426 AbstractCegarLoop]: === Iteration 1009 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:45,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:45,761 INFO L82 PathProgramCache]: Analyzing trace with hash 333382498, now seen corresponding path program 1003 times [2020-01-16 19:05:45,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:45,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083778038] [2020-01-16 19:05:45,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:46,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-01-16 19:05:46,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083778038] [2020-01-16 19:05:46,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:46,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:46,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448934264] [2020-01-16 19:05:46,038 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:46,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:46,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:46,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:46,038 INFO L87 Difference]: Start difference. First operand 381 states and 1314 transitions. Second operand 9 states. [2020-01-16 19:05:46,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:46,155 INFO L93 Difference]: Finished difference Result 587 states and 1741 transitions. [2020-01-16 19:05:46,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:46,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:46,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:46,157 INFO L225 Difference]: With dead ends: 587 [2020-01-16 19:05:46,157 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:05:46,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:46,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:05:46,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 383. [2020-01-16 19:05:46,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:05:46,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-01-16 19:05:46,167 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-01-16 19:05:46,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:46,167 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-01-16 19:05:46,167 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-01-16 19:05:46,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:46,168 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:46,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, 1, 1, 1] [2020-01-16 19:05:46,168 INFO L426 AbstractCegarLoop]: === Iteration 1010 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:46,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:46,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1112134512, now seen corresponding path program 1004 times [2020-01-16 19:05:46,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:46,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060846848] [2020-01-16 19:05:46,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:46,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060846848] [2020-01-16 19:05:46,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:46,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:46,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466513345] [2020-01-16 19:05:46,454 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:46,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:46,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:46,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:46,454 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:05:46,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:46,537 INFO L93 Difference]: Finished difference Result 585 states and 1736 transitions. [2020-01-16 19:05:46,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:46,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:46,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:46,539 INFO L225 Difference]: With dead ends: 585 [2020-01-16 19:05:46,539 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:05:46,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:46,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:05:46,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 382. [2020-01-16 19:05:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:05:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1316 transitions. [2020-01-16 19:05:46,548 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1316 transitions. Word has length 22 [2020-01-16 19:05:46,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:46,548 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1316 transitions. [2020-01-16 19:05:46,548 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1316 transitions. [2020-01-16 19:05:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:46,549 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:46,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, 1, 1, 1] [2020-01-16 19:05:46,549 INFO L426 AbstractCegarLoop]: === Iteration 1011 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:46,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:46,549 INFO L82 PathProgramCache]: Analyzing trace with hash -254362824, now seen corresponding path program 1005 times [2020-01-16 19:05:46,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:46,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248725381] [2020-01-16 19:05:46,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:46,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248725381] [2020-01-16 19:05:46,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:46,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:46,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893343769] [2020-01-16 19:05:46,837 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:46,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:46,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:46,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:46,837 INFO L87 Difference]: Start difference. First operand 382 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:05:46,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:46,938 INFO L93 Difference]: Finished difference Result 589 states and 1747 transitions. [2020-01-16 19:05:46,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:46,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:46,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:46,940 INFO L225 Difference]: With dead ends: 589 [2020-01-16 19:05:46,940 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:05:46,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:46,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:05:46,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 385. [2020-01-16 19:05:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:05:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1321 transitions. [2020-01-16 19:05:46,949 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1321 transitions. Word has length 22 [2020-01-16 19:05:46,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:46,950 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1321 transitions. [2020-01-16 19:05:46,950 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:46,950 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1321 transitions. [2020-01-16 19:05:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:46,950 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:46,950 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:46,951 INFO L426 AbstractCegarLoop]: === Iteration 1012 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:46,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:46,951 INFO L82 PathProgramCache]: Analyzing trace with hash 47655120, now seen corresponding path program 1006 times [2020-01-16 19:05:46,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:46,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066530115] [2020-01-16 19:05:46,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:47,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-01-16 19:05:47,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066530115] [2020-01-16 19:05:47,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:47,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:47,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767304277] [2020-01-16 19:05:47,222 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:47,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:47,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:47,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:47,223 INFO L87 Difference]: Start difference. First operand 385 states and 1321 transitions. Second operand 9 states. [2020-01-16 19:05:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:47,344 INFO L93 Difference]: Finished difference Result 581 states and 1738 transitions. [2020-01-16 19:05:47,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:47,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:47,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:47,346 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:05:47,346 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:05:47,346 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:05:47,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 382. [2020-01-16 19:05:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:05:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-01-16 19:05:47,355 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-01-16 19:05:47,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:47,355 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-01-16 19:05:47,355 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:47,355 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-01-16 19:05:47,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:47,356 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:47,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, 1, 1, 1] [2020-01-16 19:05:47,356 INFO L426 AbstractCegarLoop]: === Iteration 1013 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:47,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:47,356 INFO L82 PathProgramCache]: Analyzing trace with hash 994649608, now seen corresponding path program 1007 times [2020-01-16 19:05:47,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:47,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206559561] [2020-01-16 19:05:47,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:47,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:47,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206559561] [2020-01-16 19:05:47,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:47,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:47,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135379218] [2020-01-16 19:05:47,632 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:47,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:47,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:47,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:47,633 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:05:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:47,730 INFO L93 Difference]: Finished difference Result 585 states and 1736 transitions. [2020-01-16 19:05:47,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:47,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:47,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:47,732 INFO L225 Difference]: With dead ends: 585 [2020-01-16 19:05:47,732 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:05:47,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:47,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:05:47,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 383. [2020-01-16 19:05:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:05:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1316 transitions. [2020-01-16 19:05:47,742 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1316 transitions. Word has length 22 [2020-01-16 19:05:47,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:47,742 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1316 transitions. [2020-01-16 19:05:47,742 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:47,742 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1316 transitions. [2020-01-16 19:05:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:47,742 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:47,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, 1, 1, 1] [2020-01-16 19:05:47,743 INFO L426 AbstractCegarLoop]: === Iteration 1014 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:47,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:47,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1529879410, now seen corresponding path program 1008 times [2020-01-16 19:05:47,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:47,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44098314] [2020-01-16 19:05:47,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:48,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44098314] [2020-01-16 19:05:48,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:48,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:48,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346193488] [2020-01-16 19:05:48,016 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:48,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:48,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:48,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:48,016 INFO L87 Difference]: Start difference. First operand 383 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:05:48,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:48,130 INFO L93 Difference]: Finished difference Result 579 states and 1733 transitions. [2020-01-16 19:05:48,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:48,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:48,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:48,132 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:05:48,132 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:05:48,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:48,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:05:48,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 379. [2020-01-16 19:05:48,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:05:48,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1310 transitions. [2020-01-16 19:05:48,141 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1310 transitions. Word has length 22 [2020-01-16 19:05:48,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:48,142 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1310 transitions. [2020-01-16 19:05:48,142 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1310 transitions. [2020-01-16 19:05:48,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:48,142 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:48,142 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:48,142 INFO L426 AbstractCegarLoop]: === Iteration 1015 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:48,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:48,143 INFO L82 PathProgramCache]: Analyzing trace with hash 580845716, now seen corresponding path program 1009 times [2020-01-16 19:05:48,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:48,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560108138] [2020-01-16 19:05:48,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:48,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-01-16 19:05:48,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560108138] [2020-01-16 19:05:48,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:48,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:48,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969600129] [2020-01-16 19:05:48,430 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:48,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:48,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:48,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:48,430 INFO L87 Difference]: Start difference. First operand 379 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:05:48,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:48,520 INFO L93 Difference]: Finished difference Result 651 states and 1909 transitions. [2020-01-16 19:05:48,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:48,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:48,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:48,522 INFO L225 Difference]: With dead ends: 651 [2020-01-16 19:05:48,522 INFO L226 Difference]: Without dead ends: 635 [2020-01-16 19:05:48,522 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:48,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-01-16 19:05:48,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 393. [2020-01-16 19:05:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:05:48,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1353 transitions. [2020-01-16 19:05:48,531 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1353 transitions. Word has length 22 [2020-01-16 19:05:48,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:48,531 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1353 transitions. [2020-01-16 19:05:48,531 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:48,531 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1353 transitions. [2020-01-16 19:05:48,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:48,531 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:48,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, 1, 1, 1] [2020-01-16 19:05:48,532 INFO L426 AbstractCegarLoop]: === Iteration 1016 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:48,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:48,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2123855694, now seen corresponding path program 1010 times [2020-01-16 19:05:48,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:48,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178741289] [2020-01-16 19:05:48,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:48,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-01-16 19:05:48,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178741289] [2020-01-16 19:05:48,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:48,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:48,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844243757] [2020-01-16 19:05:48,800 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:48,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:48,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:48,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:48,800 INFO L87 Difference]: Start difference. First operand 393 states and 1353 transitions. Second operand 9 states. [2020-01-16 19:05:48,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:48,913 INFO L93 Difference]: Finished difference Result 646 states and 1896 transitions. [2020-01-16 19:05:48,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:48,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:48,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:48,915 INFO L225 Difference]: With dead ends: 646 [2020-01-16 19:05:48,915 INFO L226 Difference]: Without dead ends: 631 [2020-01-16 19:05:48,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:48,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-01-16 19:05:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 389. [2020-01-16 19:05:48,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:05:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1343 transitions. [2020-01-16 19:05:48,925 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1343 transitions. Word has length 22 [2020-01-16 19:05:48,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:48,926 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1343 transitions. [2020-01-16 19:05:48,926 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:48,926 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1343 transitions. [2020-01-16 19:05:48,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:48,926 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:48,926 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:48,926 INFO L426 AbstractCegarLoop]: === Iteration 1017 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:48,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:48,927 INFO L82 PathProgramCache]: Analyzing trace with hash 845896580, now seen corresponding path program 1011 times [2020-01-16 19:05:48,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:48,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535124762] [2020-01-16 19:05:48,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:49,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:49,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535124762] [2020-01-16 19:05:49,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:49,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:49,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48982712] [2020-01-16 19:05:49,213 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:49,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:49,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:49,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:49,213 INFO L87 Difference]: Start difference. First operand 389 states and 1343 transitions. Second operand 9 states. [2020-01-16 19:05:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:49,293 INFO L93 Difference]: Finished difference Result 658 states and 1921 transitions. [2020-01-16 19:05:49,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:49,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:49,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:49,295 INFO L225 Difference]: With dead ends: 658 [2020-01-16 19:05:49,295 INFO L226 Difference]: Without dead ends: 642 [2020-01-16 19:05:49,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:49,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-01-16 19:05:49,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 397. [2020-01-16 19:05:49,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:05:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1356 transitions. [2020-01-16 19:05:49,305 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1356 transitions. Word has length 22 [2020-01-16 19:05:49,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:49,305 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1356 transitions. [2020-01-16 19:05:49,305 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:49,305 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1356 transitions. [2020-01-16 19:05:49,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:49,306 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:49,306 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:49,306 INFO L426 AbstractCegarLoop]: === Iteration 1018 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:49,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:49,306 INFO L82 PathProgramCache]: Analyzing trace with hash -651674970, now seen corresponding path program 1012 times [2020-01-16 19:05:49,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:49,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154334529] [2020-01-16 19:05:49,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:49,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-01-16 19:05:49,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154334529] [2020-01-16 19:05:49,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:49,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:49,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741084916] [2020-01-16 19:05:49,589 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:49,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:49,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:49,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:49,589 INFO L87 Difference]: Start difference. First operand 397 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:05:49,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:49,708 INFO L93 Difference]: Finished difference Result 656 states and 1911 transitions. [2020-01-16 19:05:49,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:49,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:49,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:49,710 INFO L225 Difference]: With dead ends: 656 [2020-01-16 19:05:49,710 INFO L226 Difference]: Without dead ends: 634 [2020-01-16 19:05:49,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:49,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-01-16 19:05:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 389. [2020-01-16 19:05:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:05:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1338 transitions. [2020-01-16 19:05:49,719 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1338 transitions. Word has length 22 [2020-01-16 19:05:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:49,720 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1338 transitions. [2020-01-16 19:05:49,720 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1338 transitions. [2020-01-16 19:05:49,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:49,720 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:49,720 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:49,720 INFO L426 AbstractCegarLoop]: === Iteration 1019 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:49,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:49,721 INFO L82 PathProgramCache]: Analyzing trace with hash -369399834, now seen corresponding path program 1013 times [2020-01-16 19:05:49,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:49,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111435631] [2020-01-16 19:05:49,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:50,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-01-16 19:05:50,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111435631] [2020-01-16 19:05:50,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:50,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:50,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039724275] [2020-01-16 19:05:50,013 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:50,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:50,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:50,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:50,014 INFO L87 Difference]: Start difference. First operand 389 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:05:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:50,139 INFO L93 Difference]: Finished difference Result 643 states and 1886 transitions. [2020-01-16 19:05:50,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:50,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:50,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:50,141 INFO L225 Difference]: With dead ends: 643 [2020-01-16 19:05:50,141 INFO L226 Difference]: Without dead ends: 632 [2020-01-16 19:05:50,141 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:50,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-01-16 19:05:50,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 392. [2020-01-16 19:05:50,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:05:50,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1343 transitions. [2020-01-16 19:05:50,150 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1343 transitions. Word has length 22 [2020-01-16 19:05:50,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:50,150 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1343 transitions. [2020-01-16 19:05:50,150 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:50,150 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1343 transitions. [2020-01-16 19:05:50,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:50,151 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:50,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, 1, 1, 1] [2020-01-16 19:05:50,151 INFO L426 AbstractCegarLoop]: === Iteration 1020 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:50,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:50,151 INFO L82 PathProgramCache]: Analyzing trace with hash -350965808, now seen corresponding path program 1014 times [2020-01-16 19:05:50,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:50,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633984434] [2020-01-16 19:05:50,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:50,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633984434] [2020-01-16 19:05:50,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:50,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:50,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810388111] [2020-01-16 19:05:50,424 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:50,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:50,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:50,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:50,425 INFO L87 Difference]: Start difference. First operand 392 states and 1343 transitions. Second operand 9 states. [2020-01-16 19:05:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:50,535 INFO L93 Difference]: Finished difference Result 646 states and 1889 transitions. [2020-01-16 19:05:50,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:50,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:50,537 INFO L225 Difference]: With dead ends: 646 [2020-01-16 19:05:50,537 INFO L226 Difference]: Without dead ends: 624 [2020-01-16 19:05:50,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:50,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-01-16 19:05:50,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 384. [2020-01-16 19:05:50,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:05:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1326 transitions. [2020-01-16 19:05:50,546 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1326 transitions. Word has length 22 [2020-01-16 19:05:50,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:50,547 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1326 transitions. [2020-01-16 19:05:50,547 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:50,547 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1326 transitions. [2020-01-16 19:05:50,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:50,547 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:50,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, 1, 1, 1] [2020-01-16 19:05:50,547 INFO L426 AbstractCegarLoop]: === Iteration 1021 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:50,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:50,547 INFO L82 PathProgramCache]: Analyzing trace with hash 158359990, now seen corresponding path program 1015 times [2020-01-16 19:05:50,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:50,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624730150] [2020-01-16 19:05:50,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:50,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-01-16 19:05:50,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624730150] [2020-01-16 19:05:50,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:50,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:50,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666650762] [2020-01-16 19:05:50,820 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:50,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:50,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:50,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:50,821 INFO L87 Difference]: Start difference. First operand 384 states and 1326 transitions. Second operand 9 states. [2020-01-16 19:05:50,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:50,919 INFO L93 Difference]: Finished difference Result 641 states and 1881 transitions. [2020-01-16 19:05:50,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:50,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:50,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:50,920 INFO L225 Difference]: With dead ends: 641 [2020-01-16 19:05:50,921 INFO L226 Difference]: Without dead ends: 625 [2020-01-16 19:05:50,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:50,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-01-16 19:05:50,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 392. [2020-01-16 19:05:50,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:05:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1346 transitions. [2020-01-16 19:05:50,930 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1346 transitions. Word has length 22 [2020-01-16 19:05:50,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:50,930 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1346 transitions. [2020-01-16 19:05:50,930 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:50,930 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1346 transitions. [2020-01-16 19:05:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:50,930 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:50,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, 1, 1, 1] [2020-01-16 19:05:50,931 INFO L426 AbstractCegarLoop]: === Iteration 1022 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:50,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:50,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1748625876, now seen corresponding path program 1016 times [2020-01-16 19:05:50,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:50,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816481685] [2020-01-16 19:05:50,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:51,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-01-16 19:05:51,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816481685] [2020-01-16 19:05:51,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:51,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:51,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085880977] [2020-01-16 19:05:51,206 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:51,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:51,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:51,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:51,206 INFO L87 Difference]: Start difference. First operand 392 states and 1346 transitions. Second operand 9 states. [2020-01-16 19:05:51,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:51,328 INFO L93 Difference]: Finished difference Result 636 states and 1868 transitions. [2020-01-16 19:05:51,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:51,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:51,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:51,330 INFO L225 Difference]: With dead ends: 636 [2020-01-16 19:05:51,330 INFO L226 Difference]: Without dead ends: 621 [2020-01-16 19:05:51,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:51,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-01-16 19:05:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 388. [2020-01-16 19:05:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:05:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1336 transitions. [2020-01-16 19:05:51,338 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1336 transitions. Word has length 22 [2020-01-16 19:05:51,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:51,338 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1336 transitions. [2020-01-16 19:05:51,338 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1336 transitions. [2020-01-16 19:05:51,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:51,339 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:51,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:51,339 INFO L426 AbstractCegarLoop]: === Iteration 1023 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:51,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:51,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1190316762, now seen corresponding path program 1017 times [2020-01-16 19:05:51,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:51,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969835566] [2020-01-16 19:05:51,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:51,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-01-16 19:05:51,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969835566] [2020-01-16 19:05:51,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:51,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:51,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020999757] [2020-01-16 19:05:51,622 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:51,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:51,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:51,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:51,622 INFO L87 Difference]: Start difference. First operand 388 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:05:51,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:51,723 INFO L93 Difference]: Finished difference Result 635 states and 1868 transitions. [2020-01-16 19:05:51,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:51,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:51,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:51,725 INFO L225 Difference]: With dead ends: 635 [2020-01-16 19:05:51,725 INFO L226 Difference]: Without dead ends: 619 [2020-01-16 19:05:51,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:51,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-01-16 19:05:51,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 393. [2020-01-16 19:05:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:05:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1344 transitions. [2020-01-16 19:05:51,735 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1344 transitions. Word has length 22 [2020-01-16 19:05:51,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:51,735 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1344 transitions. [2020-01-16 19:05:51,735 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1344 transitions. [2020-01-16 19:05:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:51,736 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:51,736 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:51,736 INFO L426 AbstractCegarLoop]: === Iteration 1024 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:51,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:51,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1403322632, now seen corresponding path program 1018 times [2020-01-16 19:05:51,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:51,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919321875] [2020-01-16 19:05:51,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:52,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:52,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919321875] [2020-01-16 19:05:52,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:52,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:52,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379876000] [2020-01-16 19:05:52,019 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:52,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:52,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:52,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:52,019 INFO L87 Difference]: Start difference. First operand 393 states and 1344 transitions. Second operand 9 states. [2020-01-16 19:05:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:52,131 INFO L93 Difference]: Finished difference Result 622 states and 1848 transitions. [2020-01-16 19:05:52,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:52,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:52,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:52,133 INFO L225 Difference]: With dead ends: 622 [2020-01-16 19:05:52,133 INFO L226 Difference]: Without dead ends: 605 [2020-01-16 19:05:52,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:52,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-01-16 19:05:52,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 388. [2020-01-16 19:05:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:05:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1332 transitions. [2020-01-16 19:05:52,141 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1332 transitions. Word has length 22 [2020-01-16 19:05:52,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:52,142 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1332 transitions. [2020-01-16 19:05:52,142 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1332 transitions. [2020-01-16 19:05:52,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:52,142 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:52,142 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:52,142 INFO L426 AbstractCegarLoop]: === Iteration 1025 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:52,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:52,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1889354120, now seen corresponding path program 1019 times [2020-01-16 19:05:52,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:52,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381897247] [2020-01-16 19:05:52,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:52,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381897247] [2020-01-16 19:05:52,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:52,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:52,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155702148] [2020-01-16 19:05:52,421 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:52,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:52,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:52,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:52,422 INFO L87 Difference]: Start difference. First operand 388 states and 1332 transitions. Second operand 9 states. [2020-01-16 19:05:52,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:52,527 INFO L93 Difference]: Finished difference Result 628 states and 1850 transitions. [2020-01-16 19:05:52,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:52,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:52,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:52,529 INFO L225 Difference]: With dead ends: 628 [2020-01-16 19:05:52,529 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 19:05:52,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:52,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 19:05:52,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 391. [2020-01-16 19:05:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:05:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1337 transitions. [2020-01-16 19:05:52,539 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1337 transitions. Word has length 22 [2020-01-16 19:05:52,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:52,539 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1337 transitions. [2020-01-16 19:05:52,539 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:52,539 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1337 transitions. [2020-01-16 19:05:52,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:52,539 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:52,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, 1, 1, 1] [2020-01-16 19:05:52,540 INFO L426 AbstractCegarLoop]: === Iteration 1026 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:52,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:52,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1531872496, now seen corresponding path program 1020 times [2020-01-16 19:05:52,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:52,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164884118] [2020-01-16 19:05:52,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:52,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-01-16 19:05:52,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164884118] [2020-01-16 19:05:52,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:52,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:52,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276258133] [2020-01-16 19:05:52,813 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:52,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:52,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:52,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:52,814 INFO L87 Difference]: Start difference. First operand 391 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:05:52,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:52,924 INFO L93 Difference]: Finished difference Result 620 states and 1841 transitions. [2020-01-16 19:05:52,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:52,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:52,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:52,926 INFO L225 Difference]: With dead ends: 620 [2020-01-16 19:05:52,926 INFO L226 Difference]: Without dead ends: 601 [2020-01-16 19:05:52,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-01-16 19:05:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 384. [2020-01-16 19:05:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:05:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1322 transitions. [2020-01-16 19:05:52,936 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1322 transitions. Word has length 22 [2020-01-16 19:05:52,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:52,936 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1322 transitions. [2020-01-16 19:05:52,936 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:52,936 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1322 transitions. [2020-01-16 19:05:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:52,936 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:52,936 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:52,936 INFO L426 AbstractCegarLoop]: === Iteration 1027 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:52,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:52,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1986590228, now seen corresponding path program 1021 times [2020-01-16 19:05:52,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:52,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689586882] [2020-01-16 19:05:52,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:53,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-01-16 19:05:53,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689586882] [2020-01-16 19:05:53,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:53,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:53,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229248776] [2020-01-16 19:05:53,221 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:53,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:53,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:53,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:53,221 INFO L87 Difference]: Start difference. First operand 384 states and 1322 transitions. Second operand 9 states. [2020-01-16 19:05:53,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:53,313 INFO L93 Difference]: Finished difference Result 654 states and 1908 transitions. [2020-01-16 19:05:53,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:53,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:53,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:53,315 INFO L225 Difference]: With dead ends: 654 [2020-01-16 19:05:53,315 INFO L226 Difference]: Without dead ends: 638 [2020-01-16 19:05:53,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:53,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-01-16 19:05:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 398. [2020-01-16 19:05:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 19:05:53,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1355 transitions. [2020-01-16 19:05:53,324 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1355 transitions. Word has length 22 [2020-01-16 19:05:53,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:53,324 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1355 transitions. [2020-01-16 19:05:53,324 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1355 transitions. [2020-01-16 19:05:53,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:53,325 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:53,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, 1, 1, 1] [2020-01-16 19:05:53,325 INFO L426 AbstractCegarLoop]: === Iteration 1028 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:53,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:53,325 INFO L82 PathProgramCache]: Analyzing trace with hash 489018678, now seen corresponding path program 1022 times [2020-01-16 19:05:53,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:53,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923944098] [2020-01-16 19:05:53,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:53,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:53,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923944098] [2020-01-16 19:05:53,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:53,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:53,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382772251] [2020-01-16 19:05:53,622 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:53,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:53,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:53,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:53,623 INFO L87 Difference]: Start difference. First operand 398 states and 1355 transitions. Second operand 9 states. [2020-01-16 19:05:53,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:53,737 INFO L93 Difference]: Finished difference Result 652 states and 1898 transitions. [2020-01-16 19:05:53,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:53,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:53,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:53,739 INFO L225 Difference]: With dead ends: 652 [2020-01-16 19:05:53,739 INFO L226 Difference]: Without dead ends: 630 [2020-01-16 19:05:53,739 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:53,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-01-16 19:05:53,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 390. [2020-01-16 19:05:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:05:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1336 transitions. [2020-01-16 19:05:53,748 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1336 transitions. Word has length 22 [2020-01-16 19:05:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:53,749 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1336 transitions. [2020-01-16 19:05:53,749 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1336 transitions. [2020-01-16 19:05:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:53,749 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:53,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, 1, 1, 1] [2020-01-16 19:05:53,749 INFO L426 AbstractCegarLoop]: === Iteration 1029 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:53,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:53,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1563674570, now seen corresponding path program 1023 times [2020-01-16 19:05:53,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:53,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474167137] [2020-01-16 19:05:53,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:54,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474167137] [2020-01-16 19:05:54,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:54,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:54,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226749451] [2020-01-16 19:05:54,029 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:54,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:54,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:54,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:54,029 INFO L87 Difference]: Start difference. First operand 390 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:05:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:54,128 INFO L93 Difference]: Finished difference Result 641 states and 1877 transitions. [2020-01-16 19:05:54,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:54,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:54,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:54,129 INFO L225 Difference]: With dead ends: 641 [2020-01-16 19:05:54,130 INFO L226 Difference]: Without dead ends: 625 [2020-01-16 19:05:54,130 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-01-16 19:05:54,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 395. [2020-01-16 19:05:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:05:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1344 transitions. [2020-01-16 19:05:54,139 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1344 transitions. Word has length 22 [2020-01-16 19:05:54,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:54,139 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1344 transitions. [2020-01-16 19:05:54,139 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:54,139 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1344 transitions. [2020-01-16 19:05:54,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:54,139 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:54,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, 1, 1, 1] [2020-01-16 19:05:54,139 INFO L426 AbstractCegarLoop]: === Iteration 1030 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:54,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:54,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1029964824, now seen corresponding path program 1024 times [2020-01-16 19:05:54,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:54,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356294550] [2020-01-16 19:05:54,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:54,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356294550] [2020-01-16 19:05:54,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:54,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:54,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934832323] [2020-01-16 19:05:54,415 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:54,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:54,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:54,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:54,415 INFO L87 Difference]: Start difference. First operand 395 states and 1344 transitions. Second operand 9 states. [2020-01-16 19:05:54,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:54,537 INFO L93 Difference]: Finished difference Result 628 states and 1857 transitions. [2020-01-16 19:05:54,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:54,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:54,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:54,538 INFO L225 Difference]: With dead ends: 628 [2020-01-16 19:05:54,538 INFO L226 Difference]: Without dead ends: 611 [2020-01-16 19:05:54,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:54,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-01-16 19:05:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 390. [2020-01-16 19:05:54,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:05:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1331 transitions. [2020-01-16 19:05:54,548 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1331 transitions. Word has length 22 [2020-01-16 19:05:54,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:54,548 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1331 transitions. [2020-01-16 19:05:54,548 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:54,548 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1331 transitions. [2020-01-16 19:05:54,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:54,549 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:54,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, 1, 1, 1] [2020-01-16 19:05:54,549 INFO L426 AbstractCegarLoop]: === Iteration 1031 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:54,549 INFO L82 PathProgramCache]: Analyzing trace with hash 115948978, now seen corresponding path program 1025 times [2020-01-16 19:05:54,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:54,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583945119] [2020-01-16 19:05:54,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:54,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-01-16 19:05:54,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583945119] [2020-01-16 19:05:54,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:54,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:54,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090868309] [2020-01-16 19:05:54,821 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:54,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:54,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:54,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:54,822 INFO L87 Difference]: Start difference. First operand 390 states and 1331 transitions. Second operand 9 states. [2020-01-16 19:05:54,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:54,935 INFO L93 Difference]: Finished difference Result 638 states and 1867 transitions. [2020-01-16 19:05:54,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:54,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:54,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:54,937 INFO L225 Difference]: With dead ends: 638 [2020-01-16 19:05:54,937 INFO L226 Difference]: Without dead ends: 624 [2020-01-16 19:05:54,937 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:54,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-01-16 19:05:54,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 394. [2020-01-16 19:05:54,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:05:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1338 transitions. [2020-01-16 19:05:54,946 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1338 transitions. Word has length 22 [2020-01-16 19:05:54,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:54,946 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1338 transitions. [2020-01-16 19:05:54,947 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1338 transitions. [2020-01-16 19:05:54,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:54,947 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:54,947 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:54,947 INFO L426 AbstractCegarLoop]: === Iteration 1032 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:54,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:54,947 INFO L82 PathProgramCache]: Analyzing trace with hash 974823508, now seen corresponding path program 1026 times [2020-01-16 19:05:54,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:54,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137900831] [2020-01-16 19:05:54,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:55,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:55,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137900831] [2020-01-16 19:05:55,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:55,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:55,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581656640] [2020-01-16 19:05:55,227 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:55,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:55,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:55,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:55,227 INFO L87 Difference]: Start difference. First operand 394 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:05:55,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:55,353 INFO L93 Difference]: Finished difference Result 627 states and 1851 transitions. [2020-01-16 19:05:55,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:55,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:55,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:55,355 INFO L225 Difference]: With dead ends: 627 [2020-01-16 19:05:55,355 INFO L226 Difference]: Without dead ends: 605 [2020-01-16 19:05:55,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:55,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-01-16 19:05:55,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 384. [2020-01-16 19:05:55,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:05:55,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-01-16 19:05:55,363 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-01-16 19:05:55,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:55,363 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-01-16 19:05:55,363 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:55,364 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-01-16 19:05:55,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:55,364 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:55,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:55,364 INFO L426 AbstractCegarLoop]: === Iteration 1033 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:55,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:55,364 INFO L82 PathProgramCache]: Analyzing trace with hash -301791566, now seen corresponding path program 1027 times [2020-01-16 19:05:55,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:55,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846001912] [2020-01-16 19:05:55,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:55,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846001912] [2020-01-16 19:05:55,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:55,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:55,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854941317] [2020-01-16 19:05:55,631 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:55,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:55,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:55,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:55,632 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:05:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:55,750 INFO L93 Difference]: Finished difference Result 629 states and 1850 transitions. [2020-01-16 19:05:55,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:55,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:55,752 INFO L225 Difference]: With dead ends: 629 [2020-01-16 19:05:55,752 INFO L226 Difference]: Without dead ends: 618 [2020-01-16 19:05:55,752 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:55,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-01-16 19:05:55,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 390. [2020-01-16 19:05:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:05:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1333 transitions. [2020-01-16 19:05:55,762 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1333 transitions. Word has length 22 [2020-01-16 19:05:55,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:55,762 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1333 transitions. [2020-01-16 19:05:55,762 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1333 transitions. [2020-01-16 19:05:55,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:55,763 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:55,763 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:55,763 INFO L426 AbstractCegarLoop]: === Iteration 1034 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:55,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:55,763 INFO L82 PathProgramCache]: Analyzing trace with hash -283357540, now seen corresponding path program 1028 times [2020-01-16 19:05:55,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:55,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885038947] [2020-01-16 19:05:55,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:56,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885038947] [2020-01-16 19:05:56,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:56,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:56,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684673697] [2020-01-16 19:05:56,030 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:56,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:56,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:56,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:56,030 INFO L87 Difference]: Start difference. First operand 390 states and 1333 transitions. Second operand 9 states. [2020-01-16 19:05:56,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:56,137 INFO L93 Difference]: Finished difference Result 632 states and 1853 transitions. [2020-01-16 19:05:56,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:56,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:56,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:56,139 INFO L225 Difference]: With dead ends: 632 [2020-01-16 19:05:56,139 INFO L226 Difference]: Without dead ends: 615 [2020-01-16 19:05:56,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-01-16 19:05:56,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 387. [2020-01-16 19:05:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:05:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1325 transitions. [2020-01-16 19:05:56,149 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1325 transitions. Word has length 22 [2020-01-16 19:05:56,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:56,149 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1325 transitions. [2020-01-16 19:05:56,149 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1325 transitions. [2020-01-16 19:05:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:56,150 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:56,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, 1, 1, 1] [2020-01-16 19:05:56,150 INFO L426 AbstractCegarLoop]: === Iteration 1035 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:56,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:56,150 INFO L82 PathProgramCache]: Analyzing trace with hash 442910932, now seen corresponding path program 1029 times [2020-01-16 19:05:56,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:56,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224014082] [2020-01-16 19:05:56,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:56,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-01-16 19:05:56,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224014082] [2020-01-16 19:05:56,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:56,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:56,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268851871] [2020-01-16 19:05:56,426 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:56,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:56,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:56,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:56,426 INFO L87 Difference]: Start difference. First operand 387 states and 1325 transitions. Second operand 9 states. [2020-01-16 19:05:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:56,539 INFO L93 Difference]: Finished difference Result 624 states and 1838 transitions. [2020-01-16 19:05:56,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:56,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:56,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:56,541 INFO L225 Difference]: With dead ends: 624 [2020-01-16 19:05:56,541 INFO L226 Difference]: Without dead ends: 613 [2020-01-16 19:05:56,541 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:56,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-01-16 19:05:56,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 390. [2020-01-16 19:05:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:05:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1330 transitions. [2020-01-16 19:05:56,550 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1330 transitions. Word has length 22 [2020-01-16 19:05:56,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:56,551 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1330 transitions. [2020-01-16 19:05:56,551 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1330 transitions. [2020-01-16 19:05:56,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:56,551 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:56,551 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:56,551 INFO L426 AbstractCegarLoop]: === Iteration 1036 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:56,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:56,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1316651612, now seen corresponding path program 1030 times [2020-01-16 19:05:56,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:56,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766856985] [2020-01-16 19:05:56,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:56,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766856985] [2020-01-16 19:05:56,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:56,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:56,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092220414] [2020-01-16 19:05:56,825 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:56,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:56,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:56,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:56,826 INFO L87 Difference]: Start difference. First operand 390 states and 1330 transitions. Second operand 9 states. [2020-01-16 19:05:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:56,933 INFO L93 Difference]: Finished difference Result 616 states and 1829 transitions. [2020-01-16 19:05:56,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:56,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:56,935 INFO L225 Difference]: With dead ends: 616 [2020-01-16 19:05:56,935 INFO L226 Difference]: Without dead ends: 601 [2020-01-16 19:05:56,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:56,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-01-16 19:05:56,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 387. [2020-01-16 19:05:56,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:05:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1322 transitions. [2020-01-16 19:05:56,944 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1322 transitions. Word has length 22 [2020-01-16 19:05:56,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:56,944 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1322 transitions. [2020-01-16 19:05:56,944 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:56,945 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1322 transitions. [2020-01-16 19:05:56,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:56,945 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:56,945 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:56,945 INFO L426 AbstractCegarLoop]: === Iteration 1037 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:56,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:56,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1032799764, now seen corresponding path program 1031 times [2020-01-16 19:05:56,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:56,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819284575] [2020-01-16 19:05:56,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:57,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819284575] [2020-01-16 19:05:57,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:57,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:57,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120471581] [2020-01-16 19:05:57,231 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:57,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:57,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:57,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:57,232 INFO L87 Difference]: Start difference. First operand 387 states and 1322 transitions. Second operand 9 states. [2020-01-16 19:05:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:57,340 INFO L93 Difference]: Finished difference Result 628 states and 1844 transitions. [2020-01-16 19:05:57,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:57,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:57,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:57,342 INFO L225 Difference]: With dead ends: 628 [2020-01-16 19:05:57,342 INFO L226 Difference]: Without dead ends: 614 [2020-01-16 19:05:57,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-01-16 19:05:57,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 391. [2020-01-16 19:05:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:05:57,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1329 transitions. [2020-01-16 19:05:57,351 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1329 transitions. Word has length 22 [2020-01-16 19:05:57,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:57,351 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1329 transitions. [2020-01-16 19:05:57,351 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:57,351 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1329 transitions. [2020-01-16 19:05:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:57,352 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:57,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, 1, 1, 1] [2020-01-16 19:05:57,352 INFO L426 AbstractCegarLoop]: === Iteration 1038 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:57,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:57,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1888106418, now seen corresponding path program 1032 times [2020-01-16 19:05:57,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:57,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351106614] [2020-01-16 19:05:57,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:57,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-01-16 19:05:57,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351106614] [2020-01-16 19:05:57,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:57,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:57,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510355002] [2020-01-16 19:05:57,612 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:57,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:57,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:57,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:57,613 INFO L87 Difference]: Start difference. First operand 391 states and 1329 transitions. Second operand 9 states. [2020-01-16 19:05:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:57,738 INFO L93 Difference]: Finished difference Result 617 states and 1828 transitions. [2020-01-16 19:05:57,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:57,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:57,740 INFO L225 Difference]: With dead ends: 617 [2020-01-16 19:05:57,740 INFO L226 Difference]: Without dead ends: 593 [2020-01-16 19:05:57,740 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-01-16 19:05:57,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 379. [2020-01-16 19:05:57,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:05:57,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1307 transitions. [2020-01-16 19:05:57,749 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1307 transitions. Word has length 22 [2020-01-16 19:05:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:57,749 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1307 transitions. [2020-01-16 19:05:57,749 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:57,749 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1307 transitions. [2020-01-16 19:05:57,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:57,750 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:57,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, 1, 1, 1] [2020-01-16 19:05:57,750 INFO L426 AbstractCegarLoop]: === Iteration 1039 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:57,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:57,750 INFO L82 PathProgramCache]: Analyzing trace with hash -384165146, now seen corresponding path program 1033 times [2020-01-16 19:05:57,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:57,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062173378] [2020-01-16 19:05:57,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:58,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:58,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062173378] [2020-01-16 19:05:58,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:58,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:58,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867148776] [2020-01-16 19:05:58,007 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:58,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:58,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:58,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:58,008 INFO L87 Difference]: Start difference. First operand 379 states and 1307 transitions. Second operand 9 states. [2020-01-16 19:05:58,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:58,089 INFO L93 Difference]: Finished difference Result 625 states and 1824 transitions. [2020-01-16 19:05:58,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:58,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:58,091 INFO L225 Difference]: With dead ends: 625 [2020-01-16 19:05:58,091 INFO L226 Difference]: Without dead ends: 609 [2020-01-16 19:05:58,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:58,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-01-16 19:05:58,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 387. [2020-01-16 19:05:58,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:05:58,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1328 transitions. [2020-01-16 19:05:58,100 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1328 transitions. Word has length 22 [2020-01-16 19:05:58,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:58,100 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1328 transitions. [2020-01-16 19:05:58,101 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1328 transitions. [2020-01-16 19:05:58,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:58,101 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:58,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, 1, 1, 1] [2020-01-16 19:05:58,101 INFO L426 AbstractCegarLoop]: === Iteration 1040 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:58,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:58,102 INFO L82 PathProgramCache]: Analyzing trace with hash 176903346, now seen corresponding path program 1034 times [2020-01-16 19:05:58,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:58,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522065094] [2020-01-16 19:05:58,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:58,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-01-16 19:05:58,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522065094] [2020-01-16 19:05:58,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:58,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:58,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870986120] [2020-01-16 19:05:58,359 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:58,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:58,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:58,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:58,360 INFO L87 Difference]: Start difference. First operand 387 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:05:58,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:58,440 INFO L93 Difference]: Finished difference Result 618 states and 1809 transitions. [2020-01-16 19:05:58,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:58,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:58,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:58,442 INFO L225 Difference]: With dead ends: 618 [2020-01-16 19:05:58,442 INFO L226 Difference]: Without dead ends: 607 [2020-01-16 19:05:58,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:58,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-01-16 19:05:58,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 385. [2020-01-16 19:05:58,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:05:58,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1324 transitions. [2020-01-16 19:05:58,452 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1324 transitions. Word has length 22 [2020-01-16 19:05:58,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:58,452 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1324 transitions. [2020-01-16 19:05:58,452 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:58,452 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1324 transitions. [2020-01-16 19:05:58,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:58,453 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:58,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, 1, 1, 1] [2020-01-16 19:05:58,453 INFO L426 AbstractCegarLoop]: === Iteration 1041 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:58,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:58,453 INFO L82 PathProgramCache]: Analyzing trace with hash 628527386, now seen corresponding path program 1035 times [2020-01-16 19:05:58,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:58,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689858934] [2020-01-16 19:05:58,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:58,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-01-16 19:05:58,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689858934] [2020-01-16 19:05:58,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:58,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:58,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859040327] [2020-01-16 19:05:58,731 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:58,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:58,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:58,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:58,732 INFO L87 Difference]: Start difference. First operand 385 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:05:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:58,817 INFO L93 Difference]: Finished difference Result 636 states and 1848 transitions. [2020-01-16 19:05:58,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:58,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:58,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:58,819 INFO L225 Difference]: With dead ends: 636 [2020-01-16 19:05:58,819 INFO L226 Difference]: Without dead ends: 620 [2020-01-16 19:05:58,819 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-01-16 19:05:58,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 393. [2020-01-16 19:05:58,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:05:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1337 transitions. [2020-01-16 19:05:58,840 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1337 transitions. Word has length 22 [2020-01-16 19:05:58,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:58,840 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1337 transitions. [2020-01-16 19:05:58,840 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1337 transitions. [2020-01-16 19:05:58,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:58,841 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:58,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, 1, 1, 1] [2020-01-16 19:05:58,841 INFO L426 AbstractCegarLoop]: === Iteration 1042 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:58,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:58,841 INFO L82 PathProgramCache]: Analyzing trace with hash 498556940, now seen corresponding path program 1036 times [2020-01-16 19:05:58,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:58,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083865756] [2020-01-16 19:05:58,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:59,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-01-16 19:05:59,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083865756] [2020-01-16 19:05:59,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:59,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:59,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749878740] [2020-01-16 19:05:59,115 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:59,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:59,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:59,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:59,115 INFO L87 Difference]: Start difference. First operand 393 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:05:59,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:59,220 INFO L93 Difference]: Finished difference Result 634 states and 1838 transitions. [2020-01-16 19:05:59,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:59,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:59,221 INFO L225 Difference]: With dead ends: 634 [2020-01-16 19:05:59,222 INFO L226 Difference]: Without dead ends: 612 [2020-01-16 19:05:59,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:59,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-01-16 19:05:59,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 385. [2020-01-16 19:05:59,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:05:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1321 transitions. [2020-01-16 19:05:59,230 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1321 transitions. Word has length 22 [2020-01-16 19:05:59,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:59,230 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1321 transitions. [2020-01-16 19:05:59,230 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1321 transitions. [2020-01-16 19:05:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:59,231 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:59,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, 1, 1, 1] [2020-01-16 19:05:59,231 INFO L426 AbstractCegarLoop]: === Iteration 1043 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:59,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:59,231 INFO L82 PathProgramCache]: Analyzing trace with hash 683249612, now seen corresponding path program 1037 times [2020-01-16 19:05:59,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:59,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340431549] [2020-01-16 19:05:59,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:59,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:59,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340431549] [2020-01-16 19:05:59,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:59,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:59,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558717657] [2020-01-16 19:05:59,492 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:59,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:59,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:59,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:59,493 INFO L87 Difference]: Start difference. First operand 385 states and 1321 transitions. Second operand 9 states. [2020-01-16 19:05:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:59,578 INFO L93 Difference]: Finished difference Result 615 states and 1801 transitions. [2020-01-16 19:05:59,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:59,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:59,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:59,579 INFO L225 Difference]: With dead ends: 615 [2020-01-16 19:05:59,579 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 19:05:59,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:59,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 19:05:59,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 386. [2020-01-16 19:05:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:05:59,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1322 transitions. [2020-01-16 19:05:59,588 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1322 transitions. Word has length 22 [2020-01-16 19:05:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:59,589 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1322 transitions. [2020-01-16 19:05:59,589 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:59,589 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1322 transitions. [2020-01-16 19:05:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:59,589 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:59,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, 1, 1, 1] [2020-01-16 19:05:59,589 INFO L426 AbstractCegarLoop]: === Iteration 1044 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:59,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:59,590 INFO L82 PathProgramCache]: Analyzing trace with hash -392461544, now seen corresponding path program 1038 times [2020-01-16 19:05:59,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:59,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723763547] [2020-01-16 19:05:59,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:05:59,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:05:59,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723763547] [2020-01-16 19:05:59,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:05:59,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:05:59,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475108418] [2020-01-16 19:05:59,846 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:05:59,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:05:59,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:05:59,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:05:59,846 INFO L87 Difference]: Start difference. First operand 386 states and 1322 transitions. Second operand 9 states. [2020-01-16 19:05:59,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:05:59,957 INFO L93 Difference]: Finished difference Result 620 states and 1810 transitions. [2020-01-16 19:05:59,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:05:59,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:05:59,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:05:59,958 INFO L225 Difference]: With dead ends: 620 [2020-01-16 19:05:59,959 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:05:59,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:05:59,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:05:59,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 382. [2020-01-16 19:05:59,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:05:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-01-16 19:05:59,967 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-01-16 19:05:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:05:59,968 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-01-16 19:05:59,968 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:05:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-01-16 19:05:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:05:59,968 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:05:59,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:05:59,968 INFO L426 AbstractCegarLoop]: === Iteration 1045 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:05:59,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:05:59,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1541868932, now seen corresponding path program 1039 times [2020-01-16 19:05:59,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:05:59,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010472215] [2020-01-16 19:05:59,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:05:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:00,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010472215] [2020-01-16 19:06:00,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:00,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:00,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697182014] [2020-01-16 19:06:00,231 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:00,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:00,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:00,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:00,231 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:06:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:00,313 INFO L93 Difference]: Finished difference Result 617 states and 1804 transitions. [2020-01-16 19:06:00,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:00,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:00,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:00,315 INFO L225 Difference]: With dead ends: 617 [2020-01-16 19:06:00,315 INFO L226 Difference]: Without dead ends: 601 [2020-01-16 19:06:00,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-01-16 19:06:00,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 386. [2020-01-16 19:06:00,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:06:00,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1323 transitions. [2020-01-16 19:06:00,325 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1323 transitions. Word has length 22 [2020-01-16 19:06:00,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:00,325 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1323 transitions. [2020-01-16 19:06:00,325 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1323 transitions. [2020-01-16 19:06:00,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:00,326 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:00,326 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:00,326 INFO L426 AbstractCegarLoop]: === Iteration 1046 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:00,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:00,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2102937424, now seen corresponding path program 1040 times [2020-01-16 19:06:00,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:00,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633817061] [2020-01-16 19:06:00,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:00,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-01-16 19:06:00,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633817061] [2020-01-16 19:06:00,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:00,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:00,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905608798] [2020-01-16 19:06:00,595 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:00,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:00,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:00,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:00,596 INFO L87 Difference]: Start difference. First operand 386 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:06:00,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:00,696 INFO L93 Difference]: Finished difference Result 610 states and 1789 transitions. [2020-01-16 19:06:00,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:00,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:00,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:00,698 INFO L225 Difference]: With dead ends: 610 [2020-01-16 19:06:00,698 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 19:06:00,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:00,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 19:06:00,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 384. [2020-01-16 19:06:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:06:00,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1319 transitions. [2020-01-16 19:06:00,707 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1319 transitions. Word has length 22 [2020-01-16 19:06:00,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:00,707 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1319 transitions. [2020-01-16 19:06:00,707 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:00,707 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1319 transitions. [2020-01-16 19:06:00,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:00,708 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:00,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, 1, 1, 1] [2020-01-16 19:06:00,708 INFO L426 AbstractCegarLoop]: === Iteration 1047 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:00,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:00,708 INFO L82 PathProgramCache]: Analyzing trace with hash 954123610, now seen corresponding path program 1041 times [2020-01-16 19:06:00,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:00,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953243154] [2020-01-16 19:06:00,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:00,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953243154] [2020-01-16 19:06:00,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:00,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:00,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280965768] [2020-01-16 19:06:00,980 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:00,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:00,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:00,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:00,980 INFO L87 Difference]: Start difference. First operand 384 states and 1319 transitions. Second operand 9 states. [2020-01-16 19:06:01,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:01,065 INFO L93 Difference]: Finished difference Result 615 states and 1803 transitions. [2020-01-16 19:06:01,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:01,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:01,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:01,067 INFO L225 Difference]: With dead ends: 615 [2020-01-16 19:06:01,067 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 19:06:01,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:01,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 19:06:01,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 389. [2020-01-16 19:06:01,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:06:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1327 transitions. [2020-01-16 19:06:01,077 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1327 transitions. Word has length 22 [2020-01-16 19:06:01,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:01,077 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1327 transitions. [2020-01-16 19:06:01,077 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1327 transitions. [2020-01-16 19:06:01,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:01,078 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:01,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, 1, 1, 1] [2020-01-16 19:06:01,078 INFO L426 AbstractCegarLoop]: === Iteration 1048 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:01,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:01,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1318927028, now seen corresponding path program 1042 times [2020-01-16 19:06:01,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:01,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240116374] [2020-01-16 19:06:01,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:01,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240116374] [2020-01-16 19:06:01,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:01,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:01,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743387349] [2020-01-16 19:06:01,345 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:01,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:01,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:01,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:01,345 INFO L87 Difference]: Start difference. First operand 389 states and 1327 transitions. Second operand 9 states. [2020-01-16 19:06:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:01,446 INFO L93 Difference]: Finished difference Result 602 states and 1783 transitions. [2020-01-16 19:06:01,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:01,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:01,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:01,447 INFO L225 Difference]: With dead ends: 602 [2020-01-16 19:06:01,448 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 19:06:01,448 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:01,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 19:06:01,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 384. [2020-01-16 19:06:01,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:06:01,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-01-16 19:06:01,456 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-01-16 19:06:01,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:01,456 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-01-16 19:06:01,457 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:01,457 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-01-16 19:06:01,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:01,457 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:01,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, 1, 1, 1] [2020-01-16 19:06:01,457 INFO L426 AbstractCegarLoop]: === Iteration 1049 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:01,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:01,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1008845836, now seen corresponding path program 1043 times [2020-01-16 19:06:01,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:01,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56379934] [2020-01-16 19:06:01,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:01,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56379934] [2020-01-16 19:06:01,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:01,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:01,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612802111] [2020-01-16 19:06:01,724 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:01,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:01,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:01,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:01,724 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:06:01,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:01,821 INFO L93 Difference]: Finished difference Result 604 states and 1777 transitions. [2020-01-16 19:06:01,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:01,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:01,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:01,822 INFO L225 Difference]: With dead ends: 604 [2020-01-16 19:06:01,822 INFO L226 Difference]: Without dead ends: 595 [2020-01-16 19:06:01,823 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:01,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-01-16 19:06:01,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 385. [2020-01-16 19:06:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:06:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1318 transitions. [2020-01-16 19:06:01,831 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1318 transitions. Word has length 22 [2020-01-16 19:06:01,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:01,832 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1318 transitions. [2020-01-16 19:06:01,832 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:01,832 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1318 transitions. [2020-01-16 19:06:01,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:01,832 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:01,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, 1, 1, 1] [2020-01-16 19:06:01,832 INFO L426 AbstractCegarLoop]: === Iteration 1050 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:01,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:01,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1544075638, now seen corresponding path program 1044 times [2020-01-16 19:06:01,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:01,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306901058] [2020-01-16 19:06:01,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:02,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:02,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306901058] [2020-01-16 19:06:02,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:02,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:02,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135557198] [2020-01-16 19:06:02,100 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:02,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:02,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:02,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:02,101 INFO L87 Difference]: Start difference. First operand 385 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:06:02,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:02,203 INFO L93 Difference]: Finished difference Result 598 states and 1774 transitions. [2020-01-16 19:06:02,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:02,203 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:02,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:02,204 INFO L225 Difference]: With dead ends: 598 [2020-01-16 19:06:02,204 INFO L226 Difference]: Without dead ends: 583 [2020-01-16 19:06:02,205 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:02,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-01-16 19:06:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 382. [2020-01-16 19:06:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:06:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1313 transitions. [2020-01-16 19:06:02,222 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1313 transitions. Word has length 22 [2020-01-16 19:06:02,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:02,222 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1313 transitions. [2020-01-16 19:06:02,222 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1313 transitions. [2020-01-16 19:06:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:02,223 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:02,223 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:02,223 INFO L426 AbstractCegarLoop]: === Iteration 1051 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:02,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:02,223 INFO L82 PathProgramCache]: Analyzing trace with hash -411708412, now seen corresponding path program 1045 times [2020-01-16 19:06:02,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:02,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569285656] [2020-01-16 19:06:02,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:02,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-01-16 19:06:02,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569285656] [2020-01-16 19:06:02,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:02,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:02,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570651861] [2020-01-16 19:06:02,507 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:02,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:02,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:02,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:02,508 INFO L87 Difference]: Start difference. First operand 382 states and 1313 transitions. Second operand 9 states. [2020-01-16 19:06:02,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:02,604 INFO L93 Difference]: Finished difference Result 640 states and 1861 transitions. [2020-01-16 19:06:02,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:02,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:02,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:02,606 INFO L225 Difference]: With dead ends: 640 [2020-01-16 19:06:02,606 INFO L226 Difference]: Without dead ends: 624 [2020-01-16 19:06:02,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-01-16 19:06:02,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 396. [2020-01-16 19:06:02,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:06:02,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1346 transitions. [2020-01-16 19:06:02,615 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1346 transitions. Word has length 22 [2020-01-16 19:06:02,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:02,616 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1346 transitions. [2020-01-16 19:06:02,616 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:02,616 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1346 transitions. [2020-01-16 19:06:02,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:02,616 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:02,616 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:02,616 INFO L426 AbstractCegarLoop]: === Iteration 1052 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:02,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:02,617 INFO L82 PathProgramCache]: Analyzing trace with hash -541678858, now seen corresponding path program 1046 times [2020-01-16 19:06:02,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:02,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708499775] [2020-01-16 19:06:02,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:02,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-01-16 19:06:02,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708499775] [2020-01-16 19:06:02,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:02,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:02,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503045254] [2020-01-16 19:06:02,898 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:02,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:02,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:02,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:02,898 INFO L87 Difference]: Start difference. First operand 396 states and 1346 transitions. Second operand 9 states. [2020-01-16 19:06:02,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:02,999 INFO L93 Difference]: Finished difference Result 638 states and 1851 transitions. [2020-01-16 19:06:02,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:02,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:03,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:03,001 INFO L225 Difference]: With dead ends: 638 [2020-01-16 19:06:03,001 INFO L226 Difference]: Without dead ends: 616 [2020-01-16 19:06:03,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:03,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-01-16 19:06:03,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 388. [2020-01-16 19:06:03,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:06:03,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1327 transitions. [2020-01-16 19:06:03,011 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1327 transitions. Word has length 22 [2020-01-16 19:06:03,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:03,011 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1327 transitions. [2020-01-16 19:06:03,011 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:03,011 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1327 transitions. [2020-01-16 19:06:03,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:03,012 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:03,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, 1, 1, 1] [2020-01-16 19:06:03,012 INFO L426 AbstractCegarLoop]: === Iteration 1053 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:03,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:03,012 INFO L82 PathProgramCache]: Analyzing trace with hash -2012146266, now seen corresponding path program 1047 times [2020-01-16 19:06:03,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:03,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322773361] [2020-01-16 19:06:03,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:03,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-01-16 19:06:03,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322773361] [2020-01-16 19:06:03,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:03,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:03,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065021225] [2020-01-16 19:06:03,288 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:03,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:03,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:03,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:03,288 INFO L87 Difference]: Start difference. First operand 388 states and 1327 transitions. Second operand 9 states. [2020-01-16 19:06:03,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:03,365 INFO L93 Difference]: Finished difference Result 627 states and 1830 transitions. [2020-01-16 19:06:03,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:03,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:03,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:03,367 INFO L225 Difference]: With dead ends: 627 [2020-01-16 19:06:03,367 INFO L226 Difference]: Without dead ends: 611 [2020-01-16 19:06:03,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:03,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-01-16 19:06:03,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 393. [2020-01-16 19:06:03,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:06:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1335 transitions. [2020-01-16 19:06:03,377 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1335 transitions. Word has length 22 [2020-01-16 19:06:03,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:03,377 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1335 transitions. [2020-01-16 19:06:03,377 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:03,377 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1335 transitions. [2020-01-16 19:06:03,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:03,378 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:03,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, 1, 1, 1] [2020-01-16 19:06:03,378 INFO L426 AbstractCegarLoop]: === Iteration 1054 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:03,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:03,378 INFO L82 PathProgramCache]: Analyzing trace with hash 9770392, now seen corresponding path program 1048 times [2020-01-16 19:06:03,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:03,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807555963] [2020-01-16 19:06:03,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:03,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:03,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807555963] [2020-01-16 19:06:03,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:03,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:03,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462525247] [2020-01-16 19:06:03,650 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:03,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:03,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:03,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:03,651 INFO L87 Difference]: Start difference. First operand 393 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:06:03,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:03,754 INFO L93 Difference]: Finished difference Result 614 states and 1810 transitions. [2020-01-16 19:06:03,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:03,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:03,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:03,756 INFO L225 Difference]: With dead ends: 614 [2020-01-16 19:06:03,756 INFO L226 Difference]: Without dead ends: 597 [2020-01-16 19:06:03,756 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:03,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-01-16 19:06:03,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 388. [2020-01-16 19:06:03,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:06:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1322 transitions. [2020-01-16 19:06:03,765 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1322 transitions. Word has length 22 [2020-01-16 19:06:03,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:03,766 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1322 transitions. [2020-01-16 19:06:03,766 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:03,766 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1322 transitions. [2020-01-16 19:06:03,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:03,766 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:03,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, 1, 1, 1] [2020-01-16 19:06:03,766 INFO L426 AbstractCegarLoop]: === Iteration 1055 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:03,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:03,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1458284190, now seen corresponding path program 1049 times [2020-01-16 19:06:03,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:03,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919883498] [2020-01-16 19:06:03,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:04,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-01-16 19:06:04,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919883498] [2020-01-16 19:06:04,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:04,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:04,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520698835] [2020-01-16 19:06:04,042 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:04,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:04,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:04,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:04,042 INFO L87 Difference]: Start difference. First operand 388 states and 1322 transitions. Second operand 9 states. [2020-01-16 19:06:04,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:04,153 INFO L93 Difference]: Finished difference Result 624 states and 1820 transitions. [2020-01-16 19:06:04,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:04,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:04,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:04,154 INFO L225 Difference]: With dead ends: 624 [2020-01-16 19:06:04,155 INFO L226 Difference]: Without dead ends: 610 [2020-01-16 19:06:04,155 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:04,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-01-16 19:06:04,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 392. [2020-01-16 19:06:04,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:06:04,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1329 transitions. [2020-01-16 19:06:04,164 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1329 transitions. Word has length 22 [2020-01-16 19:06:04,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:04,164 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1329 transitions. [2020-01-16 19:06:04,164 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1329 transitions. [2020-01-16 19:06:04,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:04,165 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:04,165 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:04,165 INFO L426 AbstractCegarLoop]: === Iteration 1056 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:04,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:04,165 INFO L82 PathProgramCache]: Analyzing trace with hash -599409660, now seen corresponding path program 1050 times [2020-01-16 19:06:04,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:04,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434723663] [2020-01-16 19:06:04,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:04,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-01-16 19:06:04,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434723663] [2020-01-16 19:06:04,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:04,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:04,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075583083] [2020-01-16 19:06:04,428 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:04,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:04,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:04,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:04,428 INFO L87 Difference]: Start difference. First operand 392 states and 1329 transitions. Second operand 9 states. [2020-01-16 19:06:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:04,549 INFO L93 Difference]: Finished difference Result 613 states and 1804 transitions. [2020-01-16 19:06:04,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:04,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:04,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:04,551 INFO L225 Difference]: With dead ends: 613 [2020-01-16 19:06:04,551 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 19:06:04,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:04,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 19:06:04,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 382. [2020-01-16 19:06:04,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:06:04,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1310 transitions. [2020-01-16 19:06:04,561 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1310 transitions. Word has length 22 [2020-01-16 19:06:04,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:04,561 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1310 transitions. [2020-01-16 19:06:04,561 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:04,561 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1310 transitions. [2020-01-16 19:06:04,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:04,562 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:04,562 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:04,562 INFO L426 AbstractCegarLoop]: === Iteration 1057 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:04,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:04,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1126148752, now seen corresponding path program 1051 times [2020-01-16 19:06:04,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:04,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250412517] [2020-01-16 19:06:04,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:04,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-01-16 19:06:04,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250412517] [2020-01-16 19:06:04,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:04,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:04,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244841946] [2020-01-16 19:06:04,822 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:04,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:04,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:04,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:04,822 INFO L87 Difference]: Start difference. First operand 382 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:06:04,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:04,909 INFO L93 Difference]: Finished difference Result 603 states and 1773 transitions. [2020-01-16 19:06:04,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:04,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:04,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:04,911 INFO L225 Difference]: With dead ends: 603 [2020-01-16 19:06:04,911 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:06:04,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:04,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:06:04,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 384. [2020-01-16 19:06:04,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:06:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1314 transitions. [2020-01-16 19:06:04,919 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1314 transitions. Word has length 22 [2020-01-16 19:06:04,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:04,919 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1314 transitions. [2020-01-16 19:06:04,919 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:04,919 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1314 transitions. [2020-01-16 19:06:04,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:04,920 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:04,920 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:04,920 INFO L426 AbstractCegarLoop]: === Iteration 1058 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:04,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:04,920 INFO L82 PathProgramCache]: Analyzing trace with hash 50437596, now seen corresponding path program 1052 times [2020-01-16 19:06:04,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:04,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220199187] [2020-01-16 19:06:04,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:05,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220199187] [2020-01-16 19:06:05,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:05,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:05,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327672607] [2020-01-16 19:06:05,174 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:05,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:05,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:05,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:05,175 INFO L87 Difference]: Start difference. First operand 384 states and 1314 transitions. Second operand 9 states. [2020-01-16 19:06:05,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:05,297 INFO L93 Difference]: Finished difference Result 608 states and 1782 transitions. [2020-01-16 19:06:05,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:05,298 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:05,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:05,299 INFO L225 Difference]: With dead ends: 608 [2020-01-16 19:06:05,299 INFO L226 Difference]: Without dead ends: 593 [2020-01-16 19:06:05,299 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:05,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-01-16 19:06:05,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 383. [2020-01-16 19:06:05,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:06:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1312 transitions. [2020-01-16 19:06:05,309 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1312 transitions. Word has length 22 [2020-01-16 19:06:05,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:05,309 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1312 transitions. [2020-01-16 19:06:05,309 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1312 transitions. [2020-01-16 19:06:05,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:05,309 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:05,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, 1, 1, 1] [2020-01-16 19:06:05,310 INFO L426 AbstractCegarLoop]: === Iteration 1059 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:05,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:05,310 INFO L82 PathProgramCache]: Analyzing trace with hash -474289102, now seen corresponding path program 1053 times [2020-01-16 19:06:05,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:05,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467908490] [2020-01-16 19:06:05,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:05,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-01-16 19:06:05,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467908490] [2020-01-16 19:06:05,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:05,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:05,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121326451] [2020-01-16 19:06:05,584 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:05,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:05,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:05,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:05,585 INFO L87 Difference]: Start difference. First operand 383 states and 1312 transitions. Second operand 9 states. [2020-01-16 19:06:05,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:05,665 INFO L93 Difference]: Finished difference Result 600 states and 1767 transitions. [2020-01-16 19:06:05,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:05,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:05,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:05,667 INFO L225 Difference]: With dead ends: 600 [2020-01-16 19:06:05,667 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 19:06:05,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:05,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 19:06:05,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 384. [2020-01-16 19:06:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:06:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1313 transitions. [2020-01-16 19:06:05,677 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1313 transitions. Word has length 22 [2020-01-16 19:06:05,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:05,677 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1313 transitions. [2020-01-16 19:06:05,677 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1313 transitions. [2020-01-16 19:06:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:05,677 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:05,677 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:05,678 INFO L426 AbstractCegarLoop]: === Iteration 1060 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:05,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:05,678 INFO L82 PathProgramCache]: Analyzing trace with hash 60940700, now seen corresponding path program 1054 times [2020-01-16 19:06:05,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:05,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018067497] [2020-01-16 19:06:05,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:05,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018067497] [2020-01-16 19:06:05,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:05,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:05,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241576513] [2020-01-16 19:06:05,937 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:05,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:05,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:05,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:05,937 INFO L87 Difference]: Start difference. First operand 384 states and 1313 transitions. Second operand 9 states. [2020-01-16 19:06:06,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:06,055 INFO L93 Difference]: Finished difference Result 594 states and 1764 transitions. [2020-01-16 19:06:06,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:06,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:06,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:06,056 INFO L225 Difference]: With dead ends: 594 [2020-01-16 19:06:06,056 INFO L226 Difference]: Without dead ends: 581 [2020-01-16 19:06:06,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:06,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-01-16 19:06:06,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 383. [2020-01-16 19:06:06,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:06:06,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1311 transitions. [2020-01-16 19:06:06,065 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1311 transitions. Word has length 22 [2020-01-16 19:06:06,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:06,066 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1311 transitions. [2020-01-16 19:06:06,066 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:06,066 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1311 transitions. [2020-01-16 19:06:06,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:06,066 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:06,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, 1, 1, 1] [2020-01-16 19:06:06,067 INFO L426 AbstractCegarLoop]: === Iteration 1061 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:06,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:06,067 INFO L82 PathProgramCache]: Analyzing trace with hash -537307726, now seen corresponding path program 1055 times [2020-01-16 19:06:06,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:06,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221325028] [2020-01-16 19:06:06,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:06,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-01-16 19:06:06,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221325028] [2020-01-16 19:06:06,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:06,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:06,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464617647] [2020-01-16 19:06:06,329 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:06,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:06,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:06,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:06,330 INFO L87 Difference]: Start difference. First operand 383 states and 1311 transitions. Second operand 9 states. [2020-01-16 19:06:06,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:06,437 INFO L93 Difference]: Finished difference Result 608 states and 1785 transitions. [2020-01-16 19:06:06,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:06,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:06,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:06,439 INFO L225 Difference]: With dead ends: 608 [2020-01-16 19:06:06,439 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:06:06,439 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:06:06,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 387. [2020-01-16 19:06:06,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:06:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1318 transitions. [2020-01-16 19:06:06,448 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1318 transitions. Word has length 22 [2020-01-16 19:06:06,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:06,448 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1318 transitions. [2020-01-16 19:06:06,448 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:06,449 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1318 transitions. [2020-01-16 19:06:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:06,449 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:06,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, 1, 1, 1] [2020-01-16 19:06:06,449 INFO L426 AbstractCegarLoop]: === Iteration 1062 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:06,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:06,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1073633232, now seen corresponding path program 1056 times [2020-01-16 19:06:06,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:06,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917677442] [2020-01-16 19:06:06,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:06,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:06,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917677442] [2020-01-16 19:06:06,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:06,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:06,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669765531] [2020-01-16 19:06:06,706 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:06,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:06,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:06,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:06,707 INFO L87 Difference]: Start difference. First operand 387 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:06:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:06,823 INFO L93 Difference]: Finished difference Result 597 states and 1769 transitions. [2020-01-16 19:06:06,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:06,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:06,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:06,824 INFO L225 Difference]: With dead ends: 597 [2020-01-16 19:06:06,824 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:06:06,825 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:06,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:06:06,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 379. [2020-01-16 19:06:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:06:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1304 transitions. [2020-01-16 19:06:06,834 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1304 transitions. Word has length 22 [2020-01-16 19:06:06,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:06,834 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1304 transitions. [2020-01-16 19:06:06,834 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:06,834 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1304 transitions. [2020-01-16 19:06:06,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:06,834 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:06,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, 1, 1, 1] [2020-01-16 19:06:06,835 INFO L426 AbstractCegarLoop]: === Iteration 1063 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:06,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:06,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1428641352, now seen corresponding path program 1057 times [2020-01-16 19:06:06,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:06,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955036135] [2020-01-16 19:06:06,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:07,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955036135] [2020-01-16 19:06:07,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:07,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:07,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014860233] [2020-01-16 19:06:07,090 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:07,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:07,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:07,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:07,091 INFO L87 Difference]: Start difference. First operand 379 states and 1304 transitions. Second operand 9 states. [2020-01-16 19:06:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:07,216 INFO L93 Difference]: Finished difference Result 582 states and 1726 transitions. [2020-01-16 19:06:07,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:07,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:07,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:07,218 INFO L225 Difference]: With dead ends: 582 [2020-01-16 19:06:07,218 INFO L226 Difference]: Without dead ends: 571 [2020-01-16 19:06:07,218 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-01-16 19:06:07,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 382. [2020-01-16 19:06:07,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:06:07,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1312 transitions. [2020-01-16 19:06:07,227 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1312 transitions. Word has length 22 [2020-01-16 19:06:07,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:07,228 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1312 transitions. [2020-01-16 19:06:07,228 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:07,228 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1312 transitions. [2020-01-16 19:06:07,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:07,228 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:07,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, 1, 1, 1] [2020-01-16 19:06:07,228 INFO L426 AbstractCegarLoop]: === Iteration 1064 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:07,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:07,229 INFO L82 PathProgramCache]: Analyzing trace with hash -16875658, now seen corresponding path program 1058 times [2020-01-16 19:06:07,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:07,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054264813] [2020-01-16 19:06:07,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:07,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-01-16 19:06:07,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054264813] [2020-01-16 19:06:07,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:07,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:07,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115340997] [2020-01-16 19:06:07,492 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:07,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:07,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:07,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:07,493 INFO L87 Difference]: Start difference. First operand 382 states and 1312 transitions. Second operand 9 states. [2020-01-16 19:06:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:07,575 INFO L93 Difference]: Finished difference Result 580 states and 1721 transitions. [2020-01-16 19:06:07,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:07,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:07,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:07,576 INFO L225 Difference]: With dead ends: 580 [2020-01-16 19:06:07,577 INFO L226 Difference]: Without dead ends: 570 [2020-01-16 19:06:07,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:07,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-01-16 19:06:07,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 381. [2020-01-16 19:06:07,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:06:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1310 transitions. [2020-01-16 19:06:07,585 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1310 transitions. Word has length 22 [2020-01-16 19:06:07,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:07,585 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1310 transitions. [2020-01-16 19:06:07,585 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1310 transitions. [2020-01-16 19:06:07,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:07,586 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:07,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, 1, 1, 1] [2020-01-16 19:06:07,586 INFO L426 AbstractCegarLoop]: === Iteration 1065 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:07,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:07,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1853633412, now seen corresponding path program 1059 times [2020-01-16 19:06:07,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:07,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63258067] [2020-01-16 19:06:07,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:07,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:07,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63258067] [2020-01-16 19:06:07,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:07,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:07,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058703226] [2020-01-16 19:06:07,842 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:07,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:07,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:07,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:07,843 INFO L87 Difference]: Start difference. First operand 381 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:06:07,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:07,965 INFO L93 Difference]: Finished difference Result 589 states and 1741 transitions. [2020-01-16 19:06:07,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:07,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:07,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:07,967 INFO L225 Difference]: With dead ends: 589 [2020-01-16 19:06:07,967 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:06:07,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:07,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:06:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 384. [2020-01-16 19:06:07,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:06:07,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1315 transitions. [2020-01-16 19:06:07,976 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1315 transitions. Word has length 22 [2020-01-16 19:06:07,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:07,976 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1315 transitions. [2020-01-16 19:06:07,976 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:07,976 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1315 transitions. [2020-01-16 19:06:07,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:07,977 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:07,977 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:07,977 INFO L426 AbstractCegarLoop]: === Iteration 1066 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:07,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:07,977 INFO L82 PathProgramCache]: Analyzing trace with hash -467598282, now seen corresponding path program 1060 times [2020-01-16 19:06:07,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:07,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303013373] [2020-01-16 19:06:07,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:08,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-01-16 19:06:08,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303013373] [2020-01-16 19:06:08,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:08,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:08,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558531355] [2020-01-16 19:06:08,239 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:08,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:08,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:08,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:08,239 INFO L87 Difference]: Start difference. First operand 384 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:06:08,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:08,357 INFO L93 Difference]: Finished difference Result 592 states and 1744 transitions. [2020-01-16 19:06:08,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:08,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:08,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:08,359 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:06:08,359 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:06:08,360 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:08,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:06:08,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 381. [2020-01-16 19:06:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:06:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1309 transitions. [2020-01-16 19:06:08,368 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1309 transitions. Word has length 22 [2020-01-16 19:06:08,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:08,368 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1309 transitions. [2020-01-16 19:06:08,368 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:08,369 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1309 transitions. [2020-01-16 19:06:08,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:08,369 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:08,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, 1, 1, 1] [2020-01-16 19:06:08,369 INFO L426 AbstractCegarLoop]: === Iteration 1067 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:08,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:08,369 INFO L82 PathProgramCache]: Analyzing trace with hash -604620980, now seen corresponding path program 1061 times [2020-01-16 19:06:08,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:08,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513784799] [2020-01-16 19:06:08,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:08,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513784799] [2020-01-16 19:06:08,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:08,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:08,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160795905] [2020-01-16 19:06:08,623 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:08,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:08,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:08,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:08,623 INFO L87 Difference]: Start difference. First operand 381 states and 1309 transitions. Second operand 9 states. [2020-01-16 19:06:08,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:08,710 INFO L93 Difference]: Finished difference Result 583 states and 1726 transitions. [2020-01-16 19:06:08,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:08,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:08,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:08,712 INFO L225 Difference]: With dead ends: 583 [2020-01-16 19:06:08,712 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:06:08,712 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:08,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:06:08,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 382. [2020-01-16 19:06:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:06:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1310 transitions. [2020-01-16 19:06:08,720 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1310 transitions. Word has length 22 [2020-01-16 19:06:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:08,720 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1310 transitions. [2020-01-16 19:06:08,720 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1310 transitions. [2020-01-16 19:06:08,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:08,721 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:08,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, 1, 1, 1] [2020-01-16 19:06:08,721 INFO L426 AbstractCegarLoop]: === Iteration 1068 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:08,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:08,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1680332136, now seen corresponding path program 1062 times [2020-01-16 19:06:08,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:08,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666472235] [2020-01-16 19:06:08,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:08,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-01-16 19:06:08,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666472235] [2020-01-16 19:06:08,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:08,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:08,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626952277] [2020-01-16 19:06:08,998 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:08,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:08,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:08,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:08,998 INFO L87 Difference]: Start difference. First operand 382 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:06:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:09,109 INFO L93 Difference]: Finished difference Result 588 states and 1735 transitions. [2020-01-16 19:06:09,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:09,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:09,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:09,110 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:06:09,110 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:06:09,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:09,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:06:09,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 380. [2020-01-16 19:06:09,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:06:09,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1307 transitions. [2020-01-16 19:06:09,119 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1307 transitions. Word has length 22 [2020-01-16 19:06:09,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:09,119 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1307 transitions. [2020-01-16 19:06:09,119 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:09,119 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1307 transitions. [2020-01-16 19:06:09,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:09,120 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:09,120 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:09,120 INFO L426 AbstractCegarLoop]: === Iteration 1069 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:09,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:09,120 INFO L82 PathProgramCache]: Analyzing trace with hash -940291866, now seen corresponding path program 1063 times [2020-01-16 19:06:09,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:09,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10253202] [2020-01-16 19:06:09,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:09,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-01-16 19:06:09,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10253202] [2020-01-16 19:06:09,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:09,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:09,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137980557] [2020-01-16 19:06:09,383 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:09,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:09,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:09,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:09,384 INFO L87 Difference]: Start difference. First operand 380 states and 1307 transitions. Second operand 9 states. [2020-01-16 19:06:09,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:09,519 INFO L93 Difference]: Finished difference Result 579 states and 1719 transitions. [2020-01-16 19:06:09,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:09,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:09,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:09,520 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:06:09,520 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:06:09,521 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:09,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:06:09,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 382. [2020-01-16 19:06:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:06:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1311 transitions. [2020-01-16 19:06:09,530 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1311 transitions. Word has length 22 [2020-01-16 19:06:09,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:09,530 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1311 transitions. [2020-01-16 19:06:09,530 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1311 transitions. [2020-01-16 19:06:09,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:09,530 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:09,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, 1, 1, 1] [2020-01-16 19:06:09,531 INFO L426 AbstractCegarLoop]: === Iteration 1070 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:09,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:09,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1909158420, now seen corresponding path program 1064 times [2020-01-16 19:06:09,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:09,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716076387] [2020-01-16 19:06:09,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:09,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-01-16 19:06:09,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716076387] [2020-01-16 19:06:09,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:09,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:09,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311838771] [2020-01-16 19:06:09,807 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:09,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:09,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:09,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:09,807 INFO L87 Difference]: Start difference. First operand 382 states and 1311 transitions. Second operand 9 states. [2020-01-16 19:06:09,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:09,905 INFO L93 Difference]: Finished difference Result 577 states and 1714 transitions. [2020-01-16 19:06:09,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:09,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:09,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:09,907 INFO L225 Difference]: With dead ends: 577 [2020-01-16 19:06:09,907 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 19:06:09,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:09,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 19:06:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 381. [2020-01-16 19:06:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:06:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1309 transitions. [2020-01-16 19:06:09,915 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1309 transitions. Word has length 22 [2020-01-16 19:06:09,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:09,915 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1309 transitions. [2020-01-16 19:06:09,915 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:09,915 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1309 transitions. [2020-01-16 19:06:09,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:09,916 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:09,916 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:09,916 INFO L426 AbstractCegarLoop]: === Iteration 1071 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:09,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:09,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1528037188, now seen corresponding path program 1065 times [2020-01-16 19:06:09,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:09,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785671270] [2020-01-16 19:06:09,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:10,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:10,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785671270] [2020-01-16 19:06:10,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:10,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:10,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808109247] [2020-01-16 19:06:10,177 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:10,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:10,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:10,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:10,177 INFO L87 Difference]: Start difference. First operand 381 states and 1309 transitions. Second operand 9 states. [2020-01-16 19:06:10,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:10,313 INFO L93 Difference]: Finished difference Result 581 states and 1725 transitions. [2020-01-16 19:06:10,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:10,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:10,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:10,315 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:06:10,315 INFO L226 Difference]: Without dead ends: 570 [2020-01-16 19:06:10,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:10,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-01-16 19:06:10,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 384. [2020-01-16 19:06:10,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:06:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1314 transitions. [2020-01-16 19:06:10,324 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1314 transitions. Word has length 22 [2020-01-16 19:06:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:10,324 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1314 transitions. [2020-01-16 19:06:10,324 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1314 transitions. [2020-01-16 19:06:10,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:10,325 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:10,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, 1, 1, 1] [2020-01-16 19:06:10,325 INFO L426 AbstractCegarLoop]: === Iteration 1072 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:10,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:10,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1226019244, now seen corresponding path program 1066 times [2020-01-16 19:06:10,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:10,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12183725] [2020-01-16 19:06:10,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:10,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12183725] [2020-01-16 19:06:10,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:10,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:10,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246146624] [2020-01-16 19:06:10,585 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:10,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:10,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:10,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:10,586 INFO L87 Difference]: Start difference. First operand 384 states and 1314 transitions. Second operand 9 states. [2020-01-16 19:06:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:10,722 INFO L93 Difference]: Finished difference Result 573 states and 1716 transitions. [2020-01-16 19:06:10,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:10,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:10,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:10,724 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:06:10,724 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:06:10,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:06:10,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 381. [2020-01-16 19:06:10,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:06:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1308 transitions. [2020-01-16 19:06:10,733 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1308 transitions. Word has length 22 [2020-01-16 19:06:10,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:10,733 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1308 transitions. [2020-01-16 19:06:10,733 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:10,733 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1308 transitions. [2020-01-16 19:06:10,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:10,734 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:10,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:10,734 INFO L426 AbstractCegarLoop]: === Iteration 1073 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:10,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:10,734 INFO L82 PathProgramCache]: Analyzing trace with hash -279024756, now seen corresponding path program 1067 times [2020-01-16 19:06:10,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:10,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147645075] [2020-01-16 19:06:10,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06: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-01-16 19:06:11,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147645075] [2020-01-16 19:06:11,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:11,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:11,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857354100] [2020-01-16 19:06:11,001 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:11,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:11,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:11,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:11,002 INFO L87 Difference]: Start difference. First operand 381 states and 1308 transitions. Second operand 9 states. [2020-01-16 19:06:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:11,111 INFO L93 Difference]: Finished difference Result 577 states and 1714 transitions. [2020-01-16 19:06:11,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:11,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:11,113 INFO L225 Difference]: With dead ends: 577 [2020-01-16 19:06:11,113 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:06:11,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:11,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:06:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 382. [2020-01-16 19:06:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:06:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1309 transitions. [2020-01-16 19:06:11,123 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1309 transitions. Word has length 22 [2020-01-16 19:06:11,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:11,123 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1309 transitions. [2020-01-16 19:06:11,123 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1309 transitions. [2020-01-16 19:06:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:11,124 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:11,124 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:11,124 INFO L426 AbstractCegarLoop]: === Iteration 1074 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:11,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:11,124 INFO L82 PathProgramCache]: Analyzing trace with hash 256205046, now seen corresponding path program 1068 times [2020-01-16 19:06:11,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:11,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091443360] [2020-01-16 19:06:11,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:11,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-01-16 19:06:11,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091443360] [2020-01-16 19:06:11,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:11,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:11,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529821385] [2020-01-16 19:06:11,401 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:11,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:11,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:11,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:11,401 INFO L87 Difference]: Start difference. First operand 382 states and 1309 transitions. Second operand 9 states. [2020-01-16 19:06:11,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:11,521 INFO L93 Difference]: Finished difference Result 571 states and 1711 transitions. [2020-01-16 19:06:11,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:11,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:11,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:11,523 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:06:11,523 INFO L226 Difference]: Without dead ends: 557 [2020-01-16 19:06:11,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:11,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-01-16 19:06:11,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 380. [2020-01-16 19:06:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:06:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1306 transitions. [2020-01-16 19:06:11,532 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1306 transitions. Word has length 22 [2020-01-16 19:06:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:11,532 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1306 transitions. [2020-01-16 19:06:11,532 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:11,532 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1306 transitions. [2020-01-16 19:06:11,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:11,533 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:11,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, 1, 1, 1] [2020-01-16 19:06:11,533 INFO L426 AbstractCegarLoop]: === Iteration 1075 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:11,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:11,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1401098086, now seen corresponding path program 1069 times [2020-01-16 19:06:11,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:11,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58199137] [2020-01-16 19:06:11,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:11,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58199137] [2020-01-16 19:06:11,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:11,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:11,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418679613] [2020-01-16 19:06:11,791 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:11,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:11,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:11,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:11,791 INFO L87 Difference]: Start difference. First operand 380 states and 1306 transitions. Second operand 9 states. [2020-01-16 19:06:11,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:11,925 INFO L93 Difference]: Finished difference Result 596 states and 1761 transitions. [2020-01-16 19:06:11,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:11,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:11,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:11,927 INFO L225 Difference]: With dead ends: 596 [2020-01-16 19:06:11,927 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 19:06:11,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 19:06:11,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 386. [2020-01-16 19:06:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:06:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1322 transitions. [2020-01-16 19:06:11,937 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1322 transitions. Word has length 22 [2020-01-16 19:06:11,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:11,937 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1322 transitions. [2020-01-16 19:06:11,937 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1322 transitions. [2020-01-16 19:06:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:11,938 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:11,938 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:11,938 INFO L426 AbstractCegarLoop]: === Iteration 1076 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:11,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:11,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1507834080, now seen corresponding path program 1070 times [2020-01-16 19:06:11,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:11,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88287403] [2020-01-16 19:06:11,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:12,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-01-16 19:06:12,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88287403] [2020-01-16 19:06:12,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:12,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:12,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986831436] [2020-01-16 19:06:12,199 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:12,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:12,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:12,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:12,199 INFO L87 Difference]: Start difference. First operand 386 states and 1322 transitions. Second operand 9 states. [2020-01-16 19:06:12,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:12,310 INFO L93 Difference]: Finished difference Result 599 states and 1764 transitions. [2020-01-16 19:06:12,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:12,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:12,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:12,311 INFO L225 Difference]: With dead ends: 599 [2020-01-16 19:06:12,311 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 19:06:12,312 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:12,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 19:06:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 383. [2020-01-16 19:06:12,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:06:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1314 transitions. [2020-01-16 19:06:12,321 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1314 transitions. Word has length 22 [2020-01-16 19:06:12,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:12,321 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1314 transitions. [2020-01-16 19:06:12,321 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:12,321 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1314 transitions. [2020-01-16 19:06:12,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:12,321 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:12,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, 1, 1, 1] [2020-01-16 19:06:12,322 INFO L426 AbstractCegarLoop]: === Iteration 1077 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:12,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:12,322 INFO L82 PathProgramCache]: Analyzing trace with hash -199339768, now seen corresponding path program 1071 times [2020-01-16 19:06:12,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:12,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043888435] [2020-01-16 19:06:12,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:12,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043888435] [2020-01-16 19:06:12,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:12,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:12,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776145638] [2020-01-16 19:06:12,583 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:12,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:12,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:12,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:12,583 INFO L87 Difference]: Start difference. First operand 383 states and 1314 transitions. Second operand 9 states. [2020-01-16 19:06:12,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:12,692 INFO L93 Difference]: Finished difference Result 591 states and 1749 transitions. [2020-01-16 19:06:12,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:12,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:12,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:12,694 INFO L225 Difference]: With dead ends: 591 [2020-01-16 19:06:12,694 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:06:12,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:12,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:06:12,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 386. [2020-01-16 19:06:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:06:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1319 transitions. [2020-01-16 19:06:12,704 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1319 transitions. Word has length 22 [2020-01-16 19:06:12,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:12,704 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1319 transitions. [2020-01-16 19:06:12,704 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:12,704 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1319 transitions. [2020-01-16 19:06:12,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:12,705 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:12,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, 1, 1, 1] [2020-01-16 19:06:12,705 INFO L426 AbstractCegarLoop]: === Iteration 1078 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:12,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:12,705 INFO L82 PathProgramCache]: Analyzing trace with hash 102678176, now seen corresponding path program 1072 times [2020-01-16 19:06:12,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:12,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287478578] [2020-01-16 19:06:12,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:12,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-01-16 19:06:12,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287478578] [2020-01-16 19:06:12,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:12,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:12,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727088555] [2020-01-16 19:06:12,966 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:12,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:12,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:12,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:12,967 INFO L87 Difference]: Start difference. First operand 386 states and 1319 transitions. Second operand 9 states. [2020-01-16 19:06:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:13,101 INFO L93 Difference]: Finished difference Result 583 states and 1740 transitions. [2020-01-16 19:06:13,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:13,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:13,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:13,103 INFO L225 Difference]: With dead ends: 583 [2020-01-16 19:06:13,103 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:06:13,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:06:13,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 383. [2020-01-16 19:06:13,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:06:13,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1311 transitions. [2020-01-16 19:06:13,113 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1311 transitions. Word has length 22 [2020-01-16 19:06:13,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:13,113 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1311 transitions. [2020-01-16 19:06:13,113 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:13,113 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1311 transitions. [2020-01-16 19:06:13,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:13,113 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:13,113 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:13,114 INFO L426 AbstractCegarLoop]: === Iteration 1079 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:13,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:13,114 INFO L82 PathProgramCache]: Analyzing trace with hash -735212408, now seen corresponding path program 1073 times [2020-01-16 19:06:13,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:13,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225495838] [2020-01-16 19:06:13,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:13,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-01-16 19:06:13,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225495838] [2020-01-16 19:06:13,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:13,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:13,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056098835] [2020-01-16 19:06:13,368 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:13,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:13,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:13,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:13,368 INFO L87 Difference]: Start difference. First operand 383 states and 1311 transitions. Second operand 9 states. [2020-01-16 19:06:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:13,507 INFO L93 Difference]: Finished difference Result 595 states and 1755 transitions. [2020-01-16 19:06:13,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:13,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:13,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:13,509 INFO L225 Difference]: With dead ends: 595 [2020-01-16 19:06:13,509 INFO L226 Difference]: Without dead ends: 581 [2020-01-16 19:06:13,509 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-01-16 19:06:13,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 387. [2020-01-16 19:06:13,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:06:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1318 transitions. [2020-01-16 19:06:13,518 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1318 transitions. Word has length 22 [2020-01-16 19:06:13,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:13,518 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1318 transitions. [2020-01-16 19:06:13,518 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1318 transitions. [2020-01-16 19:06:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:13,519 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:13,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, 1, 1, 1] [2020-01-16 19:06:13,519 INFO L426 AbstractCegarLoop]: === Iteration 1080 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:13,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:13,519 INFO L82 PathProgramCache]: Analyzing trace with hash 120094246, now seen corresponding path program 1074 times [2020-01-16 19:06:13,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:13,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923071239] [2020-01-16 19:06:13,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:13,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-01-16 19:06:13,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923071239] [2020-01-16 19:06:13,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:13,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:13,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174244369] [2020-01-16 19:06:13,768 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:13,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:13,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:13,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:13,769 INFO L87 Difference]: Start difference. First operand 387 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:06:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:13,886 INFO L93 Difference]: Finished difference Result 584 states and 1739 transitions. [2020-01-16 19:06:13,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:13,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:13,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:13,888 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:06:13,888 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:06:13,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:13,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:06:13,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 380. [2020-01-16 19:06:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:06:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1305 transitions. [2020-01-16 19:06:13,897 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1305 transitions. Word has length 22 [2020-01-16 19:06:13,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:13,897 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1305 transitions. [2020-01-16 19:06:13,897 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:13,897 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1305 transitions. [2020-01-16 19:06:13,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:13,898 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:13,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, 1, 1, 1] [2020-01-16 19:06:13,898 INFO L426 AbstractCegarLoop]: === Iteration 1081 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:13,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:13,898 INFO L82 PathProgramCache]: Analyzing trace with hash 281177300, now seen corresponding path program 1075 times [2020-01-16 19:06:13,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:13,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699192940] [2020-01-16 19:06:13,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:14,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-01-16 19:06:14,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699192940] [2020-01-16 19:06:14,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:14,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:14,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866745817] [2020-01-16 19:06:14,144 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:14,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:14,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:14,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:14,144 INFO L87 Difference]: Start difference. First operand 380 states and 1305 transitions. Second operand 9 states. [2020-01-16 19:06:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:14,260 INFO L93 Difference]: Finished difference Result 584 states and 1728 transitions. [2020-01-16 19:06:14,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:14,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:14,262 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:06:14,263 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:06:14,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:14,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:06:14,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 382. [2020-01-16 19:06:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:06:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1309 transitions. [2020-01-16 19:06:14,272 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1309 transitions. Word has length 22 [2020-01-16 19:06:14,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:14,272 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1309 transitions. [2020-01-16 19:06:14,272 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:14,272 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1309 transitions. [2020-01-16 19:06:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:14,272 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:14,273 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:14,273 INFO L426 AbstractCegarLoop]: === Iteration 1082 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:14,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:14,273 INFO L82 PathProgramCache]: Analyzing trace with hash -794533856, now seen corresponding path program 1076 times [2020-01-16 19:06:14,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:14,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393722226] [2020-01-16 19:06:14,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:14,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-01-16 19:06:14,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393722226] [2020-01-16 19:06:14,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:14,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:14,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345753015] [2020-01-16 19:06:14,518 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:14,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:14,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:14,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:14,518 INFO L87 Difference]: Start difference. First operand 382 states and 1309 transitions. Second operand 9 states. [2020-01-16 19:06:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:14,657 INFO L93 Difference]: Finished difference Result 589 states and 1737 transitions. [2020-01-16 19:06:14,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:14,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:14,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:14,659 INFO L225 Difference]: With dead ends: 589 [2020-01-16 19:06:14,659 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:06:14,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:14,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:06:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 381. [2020-01-16 19:06:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:06:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1307 transitions. [2020-01-16 19:06:14,668 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1307 transitions. Word has length 22 [2020-01-16 19:06:14,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:14,669 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1307 transitions. [2020-01-16 19:06:14,669 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1307 transitions. [2020-01-16 19:06:14,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:14,669 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:14,669 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:14,669 INFO L426 AbstractCegarLoop]: === Iteration 1083 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:14,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:14,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1319260554, now seen corresponding path program 1077 times [2020-01-16 19:06:14,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:14,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856563235] [2020-01-16 19:06:14,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:14,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:14,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856563235] [2020-01-16 19:06:14,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:14,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:14,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976096006] [2020-01-16 19:06:14,928 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:14,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:14,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:14,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:14,928 INFO L87 Difference]: Start difference. First operand 381 states and 1307 transitions. Second operand 9 states. [2020-01-16 19:06:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:15,042 INFO L93 Difference]: Finished difference Result 581 states and 1722 transitions. [2020-01-16 19:06:15,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:15,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:15,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:15,044 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:06:15,044 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:06:15,044 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:15,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:06:15,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 382. [2020-01-16 19:06:15,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:06:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1308 transitions. [2020-01-16 19:06:15,053 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1308 transitions. Word has length 22 [2020-01-16 19:06:15,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:15,053 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1308 transitions. [2020-01-16 19:06:15,053 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:15,053 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1308 transitions. [2020-01-16 19:06:15,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:15,054 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:15,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, 1, 1, 1] [2020-01-16 19:06:15,054 INFO L426 AbstractCegarLoop]: === Iteration 1084 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:15,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:15,054 INFO L82 PathProgramCache]: Analyzing trace with hash -784030752, now seen corresponding path program 1078 times [2020-01-16 19:06:15,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:15,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661292686] [2020-01-16 19:06:15,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:15,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661292686] [2020-01-16 19:06:15,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:15,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:15,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637690276] [2020-01-16 19:06:15,307 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:15,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:15,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:15,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:15,307 INFO L87 Difference]: Start difference. First operand 382 states and 1308 transitions. Second operand 9 states. [2020-01-16 19:06:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:15,441 INFO L93 Difference]: Finished difference Result 575 states and 1719 transitions. [2020-01-16 19:06:15,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:15,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:15,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:15,443 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:06:15,443 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:06:15,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:15,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:06:15,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 381. [2020-01-16 19:06:15,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:06:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1306 transitions. [2020-01-16 19:06:15,452 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1306 transitions. Word has length 22 [2020-01-16 19:06:15,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:15,453 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1306 transitions. [2020-01-16 19:06:15,453 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:15,453 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1306 transitions. [2020-01-16 19:06:15,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:15,453 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:15,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, 1, 1, 1] [2020-01-16 19:06:15,453 INFO L426 AbstractCegarLoop]: === Iteration 1085 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:15,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:15,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1382279178, now seen corresponding path program 1079 times [2020-01-16 19:06:15,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:15,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039451771] [2020-01-16 19:06:15,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:15,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039451771] [2020-01-16 19:06:15,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:15,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:15,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795907002] [2020-01-16 19:06:15,700 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:15,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:15,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:15,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:15,700 INFO L87 Difference]: Start difference. First operand 381 states and 1306 transitions. Second operand 9 states. [2020-01-16 19:06:15,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:15,836 INFO L93 Difference]: Finished difference Result 589 states and 1740 transitions. [2020-01-16 19:06:15,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:15,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:15,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:15,837 INFO L225 Difference]: With dead ends: 589 [2020-01-16 19:06:15,838 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:06:15,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:15,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:06:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 385. [2020-01-16 19:06:15,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:06:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1313 transitions. [2020-01-16 19:06:15,847 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1313 transitions. Word has length 22 [2020-01-16 19:06:15,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:15,847 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1313 transitions. [2020-01-16 19:06:15,847 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:15,847 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1313 transitions. [2020-01-16 19:06:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:15,848 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:15,848 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:15,848 INFO L426 AbstractCegarLoop]: === Iteration 1086 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:15,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:15,848 INFO L82 PathProgramCache]: Analyzing trace with hash 228661780, now seen corresponding path program 1080 times [2020-01-16 19:06:15,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:15,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210283545] [2020-01-16 19:06:15,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:16,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:16,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210283545] [2020-01-16 19:06:16,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:16,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:16,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150376056] [2020-01-16 19:06:16,098 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:16,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:16,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:16,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:16,099 INFO L87 Difference]: Start difference. First operand 385 states and 1313 transitions. Second operand 9 states. [2020-01-16 19:06:16,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:16,236 INFO L93 Difference]: Finished difference Result 578 states and 1724 transitions. [2020-01-16 19:06:16,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:16,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:16,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:16,238 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:06:16,238 INFO L226 Difference]: Without dead ends: 557 [2020-01-16 19:06:16,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:16,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-01-16 19:06:16,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 376. [2020-01-16 19:06:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:06:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1298 transitions. [2020-01-16 19:06:16,247 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1298 transitions. Word has length 22 [2020-01-16 19:06:16,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:16,248 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1298 transitions. [2020-01-16 19:06:16,248 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1298 transitions. [2020-01-16 19:06:16,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:16,248 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:16,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, 1, 1, 1] [2020-01-16 19:06:16,248 INFO L426 AbstractCegarLoop]: === Iteration 1087 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:16,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:16,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1636377640, now seen corresponding path program 1081 times [2020-01-16 19:06:16,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:16,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232902314] [2020-01-16 19:06:16,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:16,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-01-16 19:06:16,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232902314] [2020-01-16 19:06:16,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:16,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:16,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910079833] [2020-01-16 19:06:16,521 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:16,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:16,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:16,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:16,522 INFO L87 Difference]: Start difference. First operand 376 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:06:16,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:16,629 INFO L93 Difference]: Finished difference Result 647 states and 1916 transitions. [2020-01-16 19:06:16,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:16,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:16,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:16,631 INFO L225 Difference]: With dead ends: 647 [2020-01-16 19:06:16,631 INFO L226 Difference]: Without dead ends: 631 [2020-01-16 19:06:16,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:16,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-01-16 19:06:16,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 391. [2020-01-16 19:06:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:06:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1350 transitions. [2020-01-16 19:06:16,640 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1350 transitions. Word has length 22 [2020-01-16 19:06:16,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:16,640 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1350 transitions. [2020-01-16 19:06:16,640 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:16,640 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1350 transitions. [2020-01-16 19:06:16,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:16,641 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:16,641 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:16,641 INFO L426 AbstractCegarLoop]: === Iteration 1088 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:16,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:16,641 INFO L82 PathProgramCache]: Analyzing trace with hash -46111754, now seen corresponding path program 1082 times [2020-01-16 19:06:16,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:16,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330374459] [2020-01-16 19:06:16,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:16,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330374459] [2020-01-16 19:06:16,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:16,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:16,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653567672] [2020-01-16 19:06:16,916 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:16,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:16,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:16,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:16,916 INFO L87 Difference]: Start difference. First operand 391 states and 1350 transitions. Second operand 9 states. [2020-01-16 19:06:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:17,046 INFO L93 Difference]: Finished difference Result 642 states and 1903 transitions. [2020-01-16 19:06:17,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:17,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:17,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:17,048 INFO L225 Difference]: With dead ends: 642 [2020-01-16 19:06:17,048 INFO L226 Difference]: Without dead ends: 627 [2020-01-16 19:06:17,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:17,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-01-16 19:06:17,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 387. [2020-01-16 19:06:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:06:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1341 transitions. [2020-01-16 19:06:17,057 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1341 transitions. Word has length 22 [2020-01-16 19:06:17,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:17,057 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1341 transitions. [2020-01-16 19:06:17,057 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:17,057 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1341 transitions. [2020-01-16 19:06:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:17,058 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:17,058 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:17,058 INFO L426 AbstractCegarLoop]: === Iteration 1089 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:17,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:17,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1535465468, now seen corresponding path program 1083 times [2020-01-16 19:06:17,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:17,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504220868] [2020-01-16 19:06:17,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:17,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-01-16 19:06:17,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504220868] [2020-01-16 19:06:17,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:17,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:17,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866151563] [2020-01-16 19:06:17,335 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:17,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:17,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:17,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:17,335 INFO L87 Difference]: Start difference. First operand 387 states and 1341 transitions. Second operand 9 states. [2020-01-16 19:06:17,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:17,440 INFO L93 Difference]: Finished difference Result 645 states and 1908 transitions. [2020-01-16 19:06:17,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:17,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:17,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:17,442 INFO L225 Difference]: With dead ends: 645 [2020-01-16 19:06:17,442 INFO L226 Difference]: Without dead ends: 629 [2020-01-16 19:06:17,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:17,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-01-16 19:06:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 390. [2020-01-16 19:06:17,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:06:17,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1345 transitions. [2020-01-16 19:06:17,452 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1345 transitions. Word has length 22 [2020-01-16 19:06:17,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:17,452 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1345 transitions. [2020-01-16 19:06:17,452 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1345 transitions. [2020-01-16 19:06:17,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:17,453 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:17,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, 1, 1, 1] [2020-01-16 19:06:17,453 INFO L426 AbstractCegarLoop]: === Iteration 1090 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:17,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:17,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1408829094, now seen corresponding path program 1084 times [2020-01-16 19:06:17,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:17,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828312640] [2020-01-16 19:06:17,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:17,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828312640] [2020-01-16 19:06:17,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:17,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:17,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669832599] [2020-01-16 19:06:17,727 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:17,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:17,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:17,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:17,727 INFO L87 Difference]: Start difference. First operand 390 states and 1345 transitions. Second operand 9 states. [2020-01-16 19:06:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:17,858 INFO L93 Difference]: Finished difference Result 639 states and 1894 transitions. [2020-01-16 19:06:17,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:17,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:17,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:17,860 INFO L225 Difference]: With dead ends: 639 [2020-01-16 19:06:17,860 INFO L226 Difference]: Without dead ends: 626 [2020-01-16 19:06:17,860 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:17,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-01-16 19:06:17,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 387. [2020-01-16 19:06:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:06:17,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1338 transitions. [2020-01-16 19:06:17,875 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1338 transitions. Word has length 22 [2020-01-16 19:06:17,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:17,875 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1338 transitions. [2020-01-16 19:06:17,876 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:17,876 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1338 transitions. [2020-01-16 19:06:17,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:17,876 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:17,876 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:17,876 INFO L426 AbstractCegarLoop]: === Iteration 1091 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:17,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:17,877 INFO L82 PathProgramCache]: Analyzing trace with hash 471120034, now seen corresponding path program 1085 times [2020-01-16 19:06:17,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:17,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072751661] [2020-01-16 19:06:17,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:18,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:18,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072751661] [2020-01-16 19:06:18,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:18,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:18,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899663100] [2020-01-16 19:06:18,145 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:18,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:18,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:18,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:18,146 INFO L87 Difference]: Start difference. First operand 387 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:06:18,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:18,273 INFO L93 Difference]: Finished difference Result 634 states and 1885 transitions. [2020-01-16 19:06:18,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:18,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:18,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:18,275 INFO L225 Difference]: With dead ends: 634 [2020-01-16 19:06:18,275 INFO L226 Difference]: Without dead ends: 623 [2020-01-16 19:06:18,275 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:18,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-01-16 19:06:18,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 389. [2020-01-16 19:06:18,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:06:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1341 transitions. [2020-01-16 19:06:18,284 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1341 transitions. Word has length 22 [2020-01-16 19:06:18,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:18,284 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1341 transitions. [2020-01-16 19:06:18,284 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:18,284 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1341 transitions. [2020-01-16 19:06:18,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:18,285 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:18,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, 1, 1, 1] [2020-01-16 19:06:18,285 INFO L426 AbstractCegarLoop]: === Iteration 1092 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:18,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:18,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1813052822, now seen corresponding path program 1086 times [2020-01-16 19:06:18,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:18,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875046199] [2020-01-16 19:06:18,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:18,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-01-16 19:06:18,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875046199] [2020-01-16 19:06:18,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:18,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:18,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488990687] [2020-01-16 19:06:18,561 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:18,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:18,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:18,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:18,561 INFO L87 Difference]: Start difference. First operand 389 states and 1341 transitions. Second operand 9 states. [2020-01-16 19:06:18,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:18,681 INFO L93 Difference]: Finished difference Result 633 states and 1881 transitions. [2020-01-16 19:06:18,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:18,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:18,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:18,683 INFO L225 Difference]: With dead ends: 633 [2020-01-16 19:06:18,683 INFO L226 Difference]: Without dead ends: 618 [2020-01-16 19:06:18,683 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:18,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-01-16 19:06:18,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 384. [2020-01-16 19:06:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:06:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1331 transitions. [2020-01-16 19:06:18,693 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1331 transitions. Word has length 22 [2020-01-16 19:06:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:18,693 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1331 transitions. [2020-01-16 19:06:18,693 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1331 transitions. [2020-01-16 19:06:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:18,694 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:18,694 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:18,694 INFO L426 AbstractCegarLoop]: === Iteration 1093 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:18,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:18,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1321022442, now seen corresponding path program 1087 times [2020-01-16 19:06:18,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:18,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622187076] [2020-01-16 19:06:18,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:18,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-01-16 19:06:18,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622187076] [2020-01-16 19:06:18,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:18,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:18,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461723737] [2020-01-16 19:06:18,979 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:18,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:18,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:18,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:18,979 INFO L87 Difference]: Start difference. First operand 384 states and 1331 transitions. Second operand 9 states. [2020-01-16 19:06:19,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:19,083 INFO L93 Difference]: Finished difference Result 659 states and 1943 transitions. [2020-01-16 19:06:19,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:19,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:19,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:19,085 INFO L225 Difference]: With dead ends: 659 [2020-01-16 19:06:19,085 INFO L226 Difference]: Without dead ends: 643 [2020-01-16 19:06:19,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:19,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-01-16 19:06:19,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 393. [2020-01-16 19:06:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:06:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1353 transitions. [2020-01-16 19:06:19,094 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1353 transitions. Word has length 22 [2020-01-16 19:06:19,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:19,094 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1353 transitions. [2020-01-16 19:06:19,094 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:19,094 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1353 transitions. [2020-01-16 19:06:19,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:19,095 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:19,095 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:19,095 INFO L426 AbstractCegarLoop]: === Iteration 1094 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:19,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:19,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1383678968, now seen corresponding path program 1088 times [2020-01-16 19:06:19,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:19,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043122917] [2020-01-16 19:06:19,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:19,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-01-16 19:06:19,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043122917] [2020-01-16 19:06:19,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:19,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:19,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398736883] [2020-01-16 19:06:19,369 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:19,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:19,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:19,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:19,369 INFO L87 Difference]: Start difference. First operand 393 states and 1353 transitions. Second operand 9 states. [2020-01-16 19:06:19,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:19,498 INFO L93 Difference]: Finished difference Result 654 states and 1930 transitions. [2020-01-16 19:06:19,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:19,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:19,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:19,499 INFO L225 Difference]: With dead ends: 654 [2020-01-16 19:06:19,500 INFO L226 Difference]: Without dead ends: 639 [2020-01-16 19:06:19,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:19,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-01-16 19:06:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 389. [2020-01-16 19:06:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:06:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1343 transitions. [2020-01-16 19:06:19,509 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1343 transitions. Word has length 22 [2020-01-16 19:06:19,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:19,509 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1343 transitions. [2020-01-16 19:06:19,509 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1343 transitions. [2020-01-16 19:06:19,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:19,510 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:19,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, 1, 1, 1] [2020-01-16 19:06:19,510 INFO L426 AbstractCegarLoop]: === Iteration 1095 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:19,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:19,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1586073306, now seen corresponding path program 1089 times [2020-01-16 19:06:19,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:19,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93607178] [2020-01-16 19:06:19,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:19,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-01-16 19:06:19,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93607178] [2020-01-16 19:06:19,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:19,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:19,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806337399] [2020-01-16 19:06:19,807 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:19,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:19,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:19,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:19,807 INFO L87 Difference]: Start difference. First operand 389 states and 1343 transitions. Second operand 9 states. [2020-01-16 19:06:19,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:19,917 INFO L93 Difference]: Finished difference Result 666 states and 1955 transitions. [2020-01-16 19:06:19,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:19,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:19,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:19,919 INFO L225 Difference]: With dead ends: 666 [2020-01-16 19:06:19,919 INFO L226 Difference]: Without dead ends: 650 [2020-01-16 19:06:19,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:19,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-01-16 19:06:19,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 397. [2020-01-16 19:06:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:06:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1356 transitions. [2020-01-16 19:06:19,928 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1356 transitions. Word has length 22 [2020-01-16 19:06:19,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:19,929 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1356 transitions. [2020-01-16 19:06:19,929 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:19,929 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1356 transitions. [2020-01-16 19:06:19,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:19,929 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:19,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, 1, 1, 1] [2020-01-16 19:06:19,930 INFO L426 AbstractCegarLoop]: === Iteration 1096 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:19,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:19,930 INFO L82 PathProgramCache]: Analyzing trace with hash 88501756, now seen corresponding path program 1090 times [2020-01-16 19:06:19,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:19,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954370164] [2020-01-16 19:06:19,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:20,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-01-16 19:06:20,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954370164] [2020-01-16 19:06:20,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:20,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:20,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953371489] [2020-01-16 19:06:20,214 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:20,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:20,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:20,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:20,215 INFO L87 Difference]: Start difference. First operand 397 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:06:20,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:20,346 INFO L93 Difference]: Finished difference Result 664 states and 1945 transitions. [2020-01-16 19:06:20,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:20,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:20,348 INFO L225 Difference]: With dead ends: 664 [2020-01-16 19:06:20,348 INFO L226 Difference]: Without dead ends: 642 [2020-01-16 19:06:20,349 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:20,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-01-16 19:06:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 389. [2020-01-16 19:06:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:06:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1338 transitions. [2020-01-16 19:06:20,358 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1338 transitions. Word has length 22 [2020-01-16 19:06:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:20,358 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1338 transitions. [2020-01-16 19:06:20,358 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:20,358 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1338 transitions. [2020-01-16 19:06:20,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:20,359 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:20,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, 1, 1, 1] [2020-01-16 19:06:20,359 INFO L426 AbstractCegarLoop]: === Iteration 1097 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:20,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:20,359 INFO L82 PathProgramCache]: Analyzing trace with hash 370776892, now seen corresponding path program 1091 times [2020-01-16 19:06:20,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:20,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661438805] [2020-01-16 19:06:20,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:20,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661438805] [2020-01-16 19:06:20,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:20,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:20,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862634740] [2020-01-16 19:06:20,636 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:20,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:20,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:20,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:20,636 INFO L87 Difference]: Start difference. First operand 389 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:06:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:20,764 INFO L93 Difference]: Finished difference Result 651 states and 1920 transitions. [2020-01-16 19:06:20,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:20,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:20,766 INFO L225 Difference]: With dead ends: 651 [2020-01-16 19:06:20,766 INFO L226 Difference]: Without dead ends: 640 [2020-01-16 19:06:20,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:20,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-01-16 19:06:20,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 392. [2020-01-16 19:06:20,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:06:20,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1343 transitions. [2020-01-16 19:06:20,775 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1343 transitions. Word has length 22 [2020-01-16 19:06:20,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:20,781 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1343 transitions. [2020-01-16 19:06:20,781 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:20,781 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1343 transitions. [2020-01-16 19:06:20,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:20,781 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:20,781 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:20,781 INFO L426 AbstractCegarLoop]: === Iteration 1098 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:20,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:20,782 INFO L82 PathProgramCache]: Analyzing trace with hash 389210918, now seen corresponding path program 1092 times [2020-01-16 19:06:20,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:20,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250997428] [2020-01-16 19:06:20,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:21,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250997428] [2020-01-16 19:06:21,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:21,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:21,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580947740] [2020-01-16 19:06:21,055 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:21,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:21,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:21,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:21,055 INFO L87 Difference]: Start difference. First operand 392 states and 1343 transitions. Second operand 9 states. [2020-01-16 19:06:21,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:21,186 INFO L93 Difference]: Finished difference Result 654 states and 1923 transitions. [2020-01-16 19:06:21,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:21,187 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:21,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:21,188 INFO L225 Difference]: With dead ends: 654 [2020-01-16 19:06:21,188 INFO L226 Difference]: Without dead ends: 632 [2020-01-16 19:06:21,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:21,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-01-16 19:06:21,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 384. [2020-01-16 19:06:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:06:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1327 transitions. [2020-01-16 19:06:21,197 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1327 transitions. Word has length 22 [2020-01-16 19:06:21,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:21,197 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1327 transitions. [2020-01-16 19:06:21,197 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:21,197 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1327 transitions. [2020-01-16 19:06:21,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:21,198 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:21,198 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:21,198 INFO L426 AbstractCegarLoop]: === Iteration 1099 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:21,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:21,198 INFO L82 PathProgramCache]: Analyzing trace with hash -2037057798, now seen corresponding path program 1093 times [2020-01-16 19:06:21,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:21,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788933414] [2020-01-16 19:06:21,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:21,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-01-16 19:06:21,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788933414] [2020-01-16 19:06:21,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:21,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:21,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281816828] [2020-01-16 19:06:21,479 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:21,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:21,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:21,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:21,480 INFO L87 Difference]: Start difference. First operand 384 states and 1327 transitions. Second operand 9 states. [2020-01-16 19:06:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:21,580 INFO L93 Difference]: Finished difference Result 653 states and 1922 transitions. [2020-01-16 19:06:21,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:21,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:21,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:21,582 INFO L225 Difference]: With dead ends: 653 [2020-01-16 19:06:21,582 INFO L226 Difference]: Without dead ends: 637 [2020-01-16 19:06:21,582 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:21,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-01-16 19:06:21,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 391. [2020-01-16 19:06:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:06:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1343 transitions. [2020-01-16 19:06:21,592 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1343 transitions. Word has length 22 [2020-01-16 19:06:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:21,592 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1343 transitions. [2020-01-16 19:06:21,592 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1343 transitions. [2020-01-16 19:06:21,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:21,593 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:21,593 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:21,593 INFO L426 AbstractCegarLoop]: === Iteration 1100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:21,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:21,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1910421424, now seen corresponding path program 1094 times [2020-01-16 19:06:21,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:21,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428286076] [2020-01-16 19:06:21,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:21,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:21,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428286076] [2020-01-16 19:06:21,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:21,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:21,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216976178] [2020-01-16 19:06:21,877 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:21,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:21,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:21,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:21,877 INFO L87 Difference]: Start difference. First operand 391 states and 1343 transitions. Second operand 9 states. [2020-01-16 19:06:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:22,004 INFO L93 Difference]: Finished difference Result 647 states and 1908 transitions. [2020-01-16 19:06:22,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:22,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:22,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:22,005 INFO L225 Difference]: With dead ends: 647 [2020-01-16 19:06:22,006 INFO L226 Difference]: Without dead ends: 634 [2020-01-16 19:06:22,006 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:22,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-01-16 19:06:22,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 388. [2020-01-16 19:06:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:06:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1336 transitions. [2020-01-16 19:06:22,015 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1336 transitions. Word has length 22 [2020-01-16 19:06:22,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:22,015 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1336 transitions. [2020-01-16 19:06:22,015 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1336 transitions. [2020-01-16 19:06:22,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:22,016 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:22,016 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:22,016 INFO L426 AbstractCegarLoop]: === Iteration 1101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:22,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:22,016 INFO L82 PathProgramCache]: Analyzing trace with hash -428742616, now seen corresponding path program 1095 times [2020-01-16 19:06:22,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:22,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444665345] [2020-01-16 19:06:22,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:22,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-01-16 19:06:22,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444665345] [2020-01-16 19:06:22,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:22,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:22,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211804464] [2020-01-16 19:06:22,301 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:22,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:22,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:22,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:22,302 INFO L87 Difference]: Start difference. First operand 388 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:06:22,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:22,406 INFO L93 Difference]: Finished difference Result 662 states and 1940 transitions. [2020-01-16 19:06:22,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:22,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:22,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:22,408 INFO L225 Difference]: With dead ends: 662 [2020-01-16 19:06:22,408 INFO L226 Difference]: Without dead ends: 646 [2020-01-16 19:06:22,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:22,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-01-16 19:06:22,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 396. [2020-01-16 19:06:22,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:06:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1349 transitions. [2020-01-16 19:06:22,418 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1349 transitions. Word has length 22 [2020-01-16 19:06:22,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:22,418 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1349 transitions. [2020-01-16 19:06:22,418 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:22,418 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1349 transitions. [2020-01-16 19:06:22,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:22,419 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:22,419 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:22,419 INFO L426 AbstractCegarLoop]: === Iteration 1102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:22,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:22,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1078188208, now seen corresponding path program 1096 times [2020-01-16 19:06:22,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:22,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739255634] [2020-01-16 19:06:22,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:22,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-01-16 19:06:22,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739255634] [2020-01-16 19:06:22,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:22,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:22,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834855307] [2020-01-16 19:06:22,702 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:22,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:22,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:22,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:22,702 INFO L87 Difference]: Start difference. First operand 396 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:06:22,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:22,833 INFO L93 Difference]: Finished difference Result 660 states and 1930 transitions. [2020-01-16 19:06:22,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:22,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:22,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:22,835 INFO L225 Difference]: With dead ends: 660 [2020-01-16 19:06:22,835 INFO L226 Difference]: Without dead ends: 638 [2020-01-16 19:06:22,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-01-16 19:06:22,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 388. [2020-01-16 19:06:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:06:22,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1332 transitions. [2020-01-16 19:06:22,844 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1332 transitions. Word has length 22 [2020-01-16 19:06:22,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:22,844 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1332 transitions. [2020-01-16 19:06:22,845 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1332 transitions. [2020-01-16 19:06:22,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:22,845 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:22,845 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:22,845 INFO L426 AbstractCegarLoop]: === Iteration 1103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:22,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:22,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1846690294, now seen corresponding path program 1097 times [2020-01-16 19:06:22,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:22,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485781851] [2020-01-16 19:06:22,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:23,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485781851] [2020-01-16 19:06:23,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:23,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:23,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957571318] [2020-01-16 19:06:23,111 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:23,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:23,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:23,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:23,112 INFO L87 Difference]: Start difference. First operand 388 states and 1332 transitions. Second operand 9 states. [2020-01-16 19:06:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:23,243 INFO L93 Difference]: Finished difference Result 644 states and 1899 transitions. [2020-01-16 19:06:23,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:23,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:23,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:23,245 INFO L225 Difference]: With dead ends: 644 [2020-01-16 19:06:23,245 INFO L226 Difference]: Without dead ends: 634 [2020-01-16 19:06:23,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:23,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-01-16 19:06:23,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 390. [2020-01-16 19:06:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:06:23,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1335 transitions. [2020-01-16 19:06:23,255 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1335 transitions. Word has length 22 [2020-01-16 19:06:23,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:23,255 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1335 transitions. [2020-01-16 19:06:23,255 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:23,255 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1335 transitions. [2020-01-16 19:06:23,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:23,256 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:23,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, 1, 1, 1] [2020-01-16 19:06:23,256 INFO L426 AbstractCegarLoop]: === Iteration 1104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:23,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:23,256 INFO L82 PathProgramCache]: Analyzing trace with hash 928740104, now seen corresponding path program 1098 times [2020-01-16 19:06:23,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:23,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019855810] [2020-01-16 19:06:23,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:23,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019855810] [2020-01-16 19:06:23,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:23,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:23,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918087018] [2020-01-16 19:06:23,526 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:23,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:23,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:23,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:23,527 INFO L87 Difference]: Start difference. First operand 390 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:06:23,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:23,639 INFO L93 Difference]: Finished difference Result 648 states and 1905 transitions. [2020-01-16 19:06:23,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:23,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:23,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:23,641 INFO L225 Difference]: With dead ends: 648 [2020-01-16 19:06:23,641 INFO L226 Difference]: Without dead ends: 628 [2020-01-16 19:06:23,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:23,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-01-16 19:06:23,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 384. [2020-01-16 19:06:23,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:06:23,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1323 transitions. [2020-01-16 19:06:23,651 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1323 transitions. Word has length 22 [2020-01-16 19:06:23,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:23,651 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1323 transitions. [2020-01-16 19:06:23,651 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1323 transitions. [2020-01-16 19:06:23,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:23,652 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:23,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, 1, 1, 1] [2020-01-16 19:06:23,652 INFO L426 AbstractCegarLoop]: === Iteration 1105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:23,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:23,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1063619292, now seen corresponding path program 1099 times [2020-01-16 19:06:23,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:23,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147835094] [2020-01-16 19:06:23,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:23,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147835094] [2020-01-16 19:06:23,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:23,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:23,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270617080] [2020-01-16 19:06:23,934 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:23,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:23,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:23,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:23,934 INFO L87 Difference]: Start difference. First operand 384 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:06:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:24,051 INFO L93 Difference]: Finished difference Result 629 states and 1870 transitions. [2020-01-16 19:06:24,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:24,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:24,052 INFO L225 Difference]: With dead ends: 629 [2020-01-16 19:06:24,053 INFO L226 Difference]: Without dead ends: 618 [2020-01-16 19:06:24,053 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:24,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-01-16 19:06:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 388. [2020-01-16 19:06:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:06:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1333 transitions. [2020-01-16 19:06:24,061 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1333 transitions. Word has length 22 [2020-01-16 19:06:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:24,061 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1333 transitions. [2020-01-16 19:06:24,062 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:24,062 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1333 transitions. [2020-01-16 19:06:24,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:24,062 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:24,062 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:24,062 INFO L426 AbstractCegarLoop]: === Iteration 1106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:24,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:24,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1889415216, now seen corresponding path program 1100 times [2020-01-16 19:06:24,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:24,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347087392] [2020-01-16 19:06:24,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:24,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-01-16 19:06:24,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347087392] [2020-01-16 19:06:24,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:24,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:24,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614973481] [2020-01-16 19:06:24,343 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:24,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:24,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:24,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:24,343 INFO L87 Difference]: Start difference. First operand 388 states and 1333 transitions. Second operand 9 states. [2020-01-16 19:06:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:24,475 INFO L93 Difference]: Finished difference Result 628 states and 1866 transitions. [2020-01-16 19:06:24,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:24,475 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:24,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:24,477 INFO L225 Difference]: With dead ends: 628 [2020-01-16 19:06:24,477 INFO L226 Difference]: Without dead ends: 616 [2020-01-16 19:06:24,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:24,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-01-16 19:06:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 386. [2020-01-16 19:06:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:06:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1328 transitions. [2020-01-16 19:06:24,486 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1328 transitions. Word has length 22 [2020-01-16 19:06:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:24,486 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1328 transitions. [2020-01-16 19:06:24,486 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1328 transitions. [2020-01-16 19:06:24,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:24,486 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:24,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, 1, 1, 1] [2020-01-16 19:06:24,487 INFO L426 AbstractCegarLoop]: === Iteration 1107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:24,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:24,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1623032822, now seen corresponding path program 1101 times [2020-01-16 19:06:24,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:24,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4912011] [2020-01-16 19:06:24,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:24,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4912011] [2020-01-16 19:06:24,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:24,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:24,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426639854] [2020-01-16 19:06:24,763 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:24,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:24,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:24,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:24,764 INFO L87 Difference]: Start difference. First operand 386 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:06:24,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:24,901 INFO L93 Difference]: Finished difference Result 634 states and 1879 transitions. [2020-01-16 19:06:24,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:24,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:24,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:24,902 INFO L225 Difference]: With dead ends: 634 [2020-01-16 19:06:24,902 INFO L226 Difference]: Without dead ends: 623 [2020-01-16 19:06:24,902 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:24,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-01-16 19:06:24,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 389. [2020-01-16 19:06:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:06:24,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1333 transitions. [2020-01-16 19:06:24,912 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1333 transitions. Word has length 22 [2020-01-16 19:06:24,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:24,912 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1333 transitions. [2020-01-16 19:06:24,912 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:24,912 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1333 transitions. [2020-01-16 19:06:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:24,913 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:24,913 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:24,913 INFO L426 AbstractCegarLoop]: === Iteration 1108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:24,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:24,913 INFO L82 PathProgramCache]: Analyzing trace with hash -756472838, now seen corresponding path program 1102 times [2020-01-16 19:06:24,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:24,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438045941] [2020-01-16 19:06:24,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:25,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:25,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438045941] [2020-01-16 19:06:25,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:25,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:25,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568113200] [2020-01-16 19:06:25,192 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:25,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:25,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:25,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:25,193 INFO L87 Difference]: Start difference. First operand 389 states and 1333 transitions. Second operand 9 states. [2020-01-16 19:06:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:25,325 INFO L93 Difference]: Finished difference Result 637 states and 1882 transitions. [2020-01-16 19:06:25,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:25,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:25,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:25,327 INFO L225 Difference]: With dead ends: 637 [2020-01-16 19:06:25,327 INFO L226 Difference]: Without dead ends: 620 [2020-01-16 19:06:25,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:25,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-01-16 19:06:25,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 386. [2020-01-16 19:06:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:06:25,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1326 transitions. [2020-01-16 19:06:25,337 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1326 transitions. Word has length 22 [2020-01-16 19:06:25,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:25,338 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1326 transitions. [2020-01-16 19:06:25,338 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1326 transitions. [2020-01-16 19:06:25,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:25,338 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:25,338 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:25,338 INFO L426 AbstractCegarLoop]: === Iteration 1109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:25,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:25,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1354185414, now seen corresponding path program 1103 times [2020-01-16 19:06:25,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:25,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667430055] [2020-01-16 19:06:25,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:25,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667430055] [2020-01-16 19:06:25,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:25,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:25,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323661339] [2020-01-16 19:06:25,606 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:25,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:25,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:25,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:25,606 INFO L87 Difference]: Start difference. First operand 386 states and 1326 transitions. Second operand 9 states. [2020-01-16 19:06:25,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:25,735 INFO L93 Difference]: Finished difference Result 631 states and 1870 transitions. [2020-01-16 19:06:25,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:25,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:25,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:25,737 INFO L225 Difference]: With dead ends: 631 [2020-01-16 19:06:25,737 INFO L226 Difference]: Without dead ends: 621 [2020-01-16 19:06:25,737 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:25,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-01-16 19:06:25,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 388. [2020-01-16 19:06:25,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:06:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1329 transitions. [2020-01-16 19:06:25,746 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1329 transitions. Word has length 22 [2020-01-16 19:06:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:25,746 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1329 transitions. [2020-01-16 19:06:25,746 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1329 transitions. [2020-01-16 19:06:25,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:25,747 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:25,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, 1, 1, 1] [2020-01-16 19:06:25,747 INFO L426 AbstractCegarLoop]: === Iteration 1110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:25,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:25,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2022831692, now seen corresponding path program 1104 times [2020-01-16 19:06:25,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:25,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234790505] [2020-01-16 19:06:25,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:26,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-01-16 19:06:26,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234790505] [2020-01-16 19:06:26,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:26,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:26,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187298698] [2020-01-16 19:06:26,020 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:26,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:26,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:26,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:26,021 INFO L87 Difference]: Start difference. First operand 388 states and 1329 transitions. Second operand 9 states. [2020-01-16 19:06:26,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:26,142 INFO L93 Difference]: Finished difference Result 635 states and 1876 transitions. [2020-01-16 19:06:26,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:26,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:26,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:26,143 INFO L225 Difference]: With dead ends: 635 [2020-01-16 19:06:26,144 INFO L226 Difference]: Without dead ends: 613 [2020-01-16 19:06:26,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-01-16 19:06:26,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 380. [2020-01-16 19:06:26,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:06:26,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1314 transitions. [2020-01-16 19:06:26,152 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1314 transitions. Word has length 22 [2020-01-16 19:06:26,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:26,152 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1314 transitions. [2020-01-16 19:06:26,153 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:26,153 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1314 transitions. [2020-01-16 19:06:26,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:26,153 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:26,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, 1, 1, 1] [2020-01-16 19:06:26,153 INFO L426 AbstractCegarLoop]: === Iteration 1111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:26,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:26,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1848533258, now seen corresponding path program 1105 times [2020-01-16 19:06:26,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:26,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669663754] [2020-01-16 19:06:26,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:26,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-01-16 19:06:26,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669663754] [2020-01-16 19:06:26,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:26,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:26,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097877175] [2020-01-16 19:06:26,426 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:26,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:26,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:26,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:26,426 INFO L87 Difference]: Start difference. First operand 380 states and 1314 transitions. Second operand 9 states. [2020-01-16 19:06:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:26,513 INFO L93 Difference]: Finished difference Result 636 states and 1884 transitions. [2020-01-16 19:06:26,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:26,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:26,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:26,515 INFO L225 Difference]: With dead ends: 636 [2020-01-16 19:06:26,515 INFO L226 Difference]: Without dead ends: 620 [2020-01-16 19:06:26,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-01-16 19:06:26,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 390. [2020-01-16 19:06:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:06:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1343 transitions. [2020-01-16 19:06:26,529 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1343 transitions. Word has length 22 [2020-01-16 19:06:26,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:26,529 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1343 transitions. [2020-01-16 19:06:26,529 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:26,529 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1343 transitions. [2020-01-16 19:06:26,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:26,530 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:26,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, 1, 1, 1] [2020-01-16 19:06:26,530 INFO L426 AbstractCegarLoop]: === Iteration 1112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:26,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:26,530 INFO L82 PathProgramCache]: Analyzing trace with hash -258267372, now seen corresponding path program 1106 times [2020-01-16 19:06:26,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:26,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97335143] [2020-01-16 19:06:26,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:26,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-01-16 19:06:26,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97335143] [2020-01-16 19:06:26,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:26,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:26,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939184236] [2020-01-16 19:06:26,794 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:26,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:26,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:26,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:26,795 INFO L87 Difference]: Start difference. First operand 390 states and 1343 transitions. Second operand 9 states. [2020-01-16 19:06:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:26,926 INFO L93 Difference]: Finished difference Result 631 states and 1871 transitions. [2020-01-16 19:06:26,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:26,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:26,928 INFO L225 Difference]: With dead ends: 631 [2020-01-16 19:06:26,928 INFO L226 Difference]: Without dead ends: 616 [2020-01-16 19:06:26,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-01-16 19:06:26,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 386. [2020-01-16 19:06:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:06:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1334 transitions. [2020-01-16 19:06:26,937 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1334 transitions. Word has length 22 [2020-01-16 19:06:26,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:26,937 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1334 transitions. [2020-01-16 19:06:26,937 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:26,937 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1334 transitions. [2020-01-16 19:06:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:26,938 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:26,938 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:26,938 INFO L426 AbstractCegarLoop]: === Iteration 1113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:26,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:26,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1747621086, now seen corresponding path program 1107 times [2020-01-16 19:06:26,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:26,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587615061] [2020-01-16 19:06:26,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:27,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-01-16 19:06:27,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587615061] [2020-01-16 19:06:27,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:27,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:27,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696698823] [2020-01-16 19:06:27,215 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:27,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:27,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:27,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:27,215 INFO L87 Difference]: Start difference. First operand 386 states and 1334 transitions. Second operand 9 states. [2020-01-16 19:06:27,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:27,327 INFO L93 Difference]: Finished difference Result 634 states and 1876 transitions. [2020-01-16 19:06:27,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:27,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:27,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:27,329 INFO L225 Difference]: With dead ends: 634 [2020-01-16 19:06:27,329 INFO L226 Difference]: Without dead ends: 618 [2020-01-16 19:06:27,329 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:27,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-01-16 19:06:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 389. [2020-01-16 19:06:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:06:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1338 transitions. [2020-01-16 19:06:27,338 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1338 transitions. Word has length 22 [2020-01-16 19:06:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:27,338 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1338 transitions. [2020-01-16 19:06:27,338 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1338 transitions. [2020-01-16 19:06:27,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:27,339 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:27,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:27,339 INFO L426 AbstractCegarLoop]: === Iteration 1114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:27,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:27,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1620984712, now seen corresponding path program 1108 times [2020-01-16 19:06:27,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:27,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909267298] [2020-01-16 19:06:27,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:27,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909267298] [2020-01-16 19:06:27,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:27,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:27,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026226274] [2020-01-16 19:06:27,611 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:27,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:27,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:27,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:27,612 INFO L87 Difference]: Start difference. First operand 389 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:06:27,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:27,746 INFO L93 Difference]: Finished difference Result 628 states and 1862 transitions. [2020-01-16 19:06:27,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:27,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:27,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:27,747 INFO L225 Difference]: With dead ends: 628 [2020-01-16 19:06:27,748 INFO L226 Difference]: Without dead ends: 615 [2020-01-16 19:06:27,748 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-01-16 19:06:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 386. [2020-01-16 19:06:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:06:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1331 transitions. [2020-01-16 19:06:27,756 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1331 transitions. Word has length 22 [2020-01-16 19:06:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:27,757 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1331 transitions. [2020-01-16 19:06:27,757 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:27,757 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1331 transitions. [2020-01-16 19:06:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:27,757 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:27,757 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:27,757 INFO L426 AbstractCegarLoop]: === Iteration 1115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:27,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:27,758 INFO L82 PathProgramCache]: Analyzing trace with hash 258964416, now seen corresponding path program 1109 times [2020-01-16 19:06:27,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:27,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307349875] [2020-01-16 19:06:27,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:28,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307349875] [2020-01-16 19:06:28,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:28,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:28,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623799281] [2020-01-16 19:06:28,034 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:28,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:28,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:28,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:28,035 INFO L87 Difference]: Start difference. First operand 386 states and 1331 transitions. Second operand 9 states. [2020-01-16 19:06:28,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:28,169 INFO L93 Difference]: Finished difference Result 623 states and 1853 transitions. [2020-01-16 19:06:28,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:28,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:28,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:28,171 INFO L225 Difference]: With dead ends: 623 [2020-01-16 19:06:28,171 INFO L226 Difference]: Without dead ends: 612 [2020-01-16 19:06:28,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:28,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-01-16 19:06:28,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 388. [2020-01-16 19:06:28,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:06:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1334 transitions. [2020-01-16 19:06:28,179 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1334 transitions. Word has length 22 [2020-01-16 19:06:28,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:28,179 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1334 transitions. [2020-01-16 19:06:28,179 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1334 transitions. [2020-01-16 19:06:28,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:28,180 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:28,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, 1, 1, 1] [2020-01-16 19:06:28,180 INFO L426 AbstractCegarLoop]: === Iteration 1116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:28,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:28,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1600897204, now seen corresponding path program 1110 times [2020-01-16 19:06:28,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:28,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342324376] [2020-01-16 19:06:28,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:28,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342324376] [2020-01-16 19:06:28,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:28,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:28,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186127086] [2020-01-16 19:06:28,454 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:28,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:28,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:28,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:28,454 INFO L87 Difference]: Start difference. First operand 388 states and 1334 transitions. Second operand 9 states. [2020-01-16 19:06:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:28,556 INFO L93 Difference]: Finished difference Result 622 states and 1849 transitions. [2020-01-16 19:06:28,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:28,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:28,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:28,557 INFO L225 Difference]: With dead ends: 622 [2020-01-16 19:06:28,558 INFO L226 Difference]: Without dead ends: 607 [2020-01-16 19:06:28,558 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:28,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-01-16 19:06:28,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 383. [2020-01-16 19:06:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:06:28,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1324 transitions. [2020-01-16 19:06:28,567 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1324 transitions. Word has length 22 [2020-01-16 19:06:28,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:28,567 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1324 transitions. [2020-01-16 19:06:28,567 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:28,567 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1324 transitions. [2020-01-16 19:06:28,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:28,567 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:28,567 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:28,567 INFO L426 AbstractCegarLoop]: === Iteration 1117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:28,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:28,568 INFO L82 PathProgramCache]: Analyzing trace with hash 686381098, now seen corresponding path program 1111 times [2020-01-16 19:06:28,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:28,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457091391] [2020-01-16 19:06:28,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:28,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457091391] [2020-01-16 19:06:28,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:28,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:28,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500392961] [2020-01-16 19:06:28,846 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:28,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:28,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:28,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:28,847 INFO L87 Difference]: Start difference. First operand 383 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:06:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:28,922 INFO L93 Difference]: Finished difference Result 638 states and 1888 transitions. [2020-01-16 19:06:28,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:28,923 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:28,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:28,924 INFO L225 Difference]: With dead ends: 638 [2020-01-16 19:06:28,924 INFO L226 Difference]: Without dead ends: 622 [2020-01-16 19:06:28,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:28,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-01-16 19:06:28,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 391. [2020-01-16 19:06:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:06:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1344 transitions. [2020-01-16 19:06:28,934 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1344 transitions. Word has length 22 [2020-01-16 19:06:28,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:28,934 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1344 transitions. [2020-01-16 19:06:28,934 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:28,934 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1344 transitions. [2020-01-16 19:06:28,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:28,935 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:28,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, 1, 1, 1] [2020-01-16 19:06:28,935 INFO L426 AbstractCegarLoop]: === Iteration 1118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:28,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:28,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2018320312, now seen corresponding path program 1112 times [2020-01-16 19:06:28,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:28,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754295619] [2020-01-16 19:06:28,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:29,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-01-16 19:06:29,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754295619] [2020-01-16 19:06:29,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:29,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:29,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392582196] [2020-01-16 19:06:29,208 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:29,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:29,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:29,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:29,208 INFO L87 Difference]: Start difference. First operand 391 states and 1344 transitions. Second operand 9 states. [2020-01-16 19:06:29,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:29,312 INFO L93 Difference]: Finished difference Result 633 states and 1875 transitions. [2020-01-16 19:06:29,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:29,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:29,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:29,314 INFO L225 Difference]: With dead ends: 633 [2020-01-16 19:06:29,314 INFO L226 Difference]: Without dead ends: 618 [2020-01-16 19:06:29,314 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-01-16 19:06:29,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 387. [2020-01-16 19:06:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:06:29,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1334 transitions. [2020-01-16 19:06:29,324 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1334 transitions. Word has length 22 [2020-01-16 19:06:29,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:29,324 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1334 transitions. [2020-01-16 19:06:29,324 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:29,324 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1334 transitions. [2020-01-16 19:06:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:29,325 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:29,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, 1, 1, 1] [2020-01-16 19:06:29,325 INFO L426 AbstractCegarLoop]: === Iteration 1119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:29,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:29,325 INFO L82 PathProgramCache]: Analyzing trace with hash -662295654, now seen corresponding path program 1113 times [2020-01-16 19:06:29,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:29,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386997302] [2020-01-16 19:06:29,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:29,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-01-16 19:06:29,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386997302] [2020-01-16 19:06:29,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:29,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:29,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215789729] [2020-01-16 19:06:29,605 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:29,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:29,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:29,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:29,606 INFO L87 Difference]: Start difference. First operand 387 states and 1334 transitions. Second operand 9 states. [2020-01-16 19:06:29,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:29,681 INFO L93 Difference]: Finished difference Result 632 states and 1875 transitions. [2020-01-16 19:06:29,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:29,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:29,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:29,683 INFO L225 Difference]: With dead ends: 632 [2020-01-16 19:06:29,683 INFO L226 Difference]: Without dead ends: 616 [2020-01-16 19:06:29,683 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:29,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-01-16 19:06:29,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 392. [2020-01-16 19:06:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:06:29,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1342 transitions. [2020-01-16 19:06:29,693 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1342 transitions. Word has length 22 [2020-01-16 19:06:29,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:29,693 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1342 transitions. [2020-01-16 19:06:29,693 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:29,693 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1342 transitions. [2020-01-16 19:06:29,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:29,693 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:29,694 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:29,694 INFO L426 AbstractCegarLoop]: === Iteration 1120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:29,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:29,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1931343740, now seen corresponding path program 1114 times [2020-01-16 19:06:29,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:29,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130058378] [2020-01-16 19:06:29,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:29,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-01-16 19:06:29,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130058378] [2020-01-16 19:06:29,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:29,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:29,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630379037] [2020-01-16 19:06:29,975 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:29,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:29,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:29,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:29,975 INFO L87 Difference]: Start difference. First operand 392 states and 1342 transitions. Second operand 9 states. [2020-01-16 19:06:30,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:30,073 INFO L93 Difference]: Finished difference Result 619 states and 1855 transitions. [2020-01-16 19:06:30,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:30,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:30,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:30,075 INFO L225 Difference]: With dead ends: 619 [2020-01-16 19:06:30,075 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:06:30,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:30,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:06:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 387. [2020-01-16 19:06:30,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:06:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1330 transitions. [2020-01-16 19:06:30,085 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1330 transitions. Word has length 22 [2020-01-16 19:06:30,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:30,085 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1330 transitions. [2020-01-16 19:06:30,085 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:30,085 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1330 transitions. [2020-01-16 19:06:30,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:30,086 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:30,086 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:30,086 INFO L426 AbstractCegarLoop]: === Iteration 1121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:30,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:30,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1877592068, now seen corresponding path program 1115 times [2020-01-16 19:06:30,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:30,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211299919] [2020-01-16 19:06:30,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:30,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-01-16 19:06:30,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211299919] [2020-01-16 19:06:30,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:30,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:30,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758770729] [2020-01-16 19:06:30,363 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:30,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:30,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:30,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:30,364 INFO L87 Difference]: Start difference. First operand 387 states and 1330 transitions. Second operand 9 states. [2020-01-16 19:06:30,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:30,466 INFO L93 Difference]: Finished difference Result 625 states and 1857 transitions. [2020-01-16 19:06:30,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:30,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:30,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:30,468 INFO L225 Difference]: With dead ends: 625 [2020-01-16 19:06:30,468 INFO L226 Difference]: Without dead ends: 614 [2020-01-16 19:06:30,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:30,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-01-16 19:06:30,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 390. [2020-01-16 19:06:30,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:06:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1335 transitions. [2020-01-16 19:06:30,476 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1335 transitions. Word has length 22 [2020-01-16 19:06:30,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:30,476 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1335 transitions. [2020-01-16 19:06:30,476 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1335 transitions. [2020-01-16 19:06:30,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:30,477 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:30,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, 1, 1, 1] [2020-01-16 19:06:30,477 INFO L426 AbstractCegarLoop]: === Iteration 1122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:30,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:30,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1003851388, now seen corresponding path program 1116 times [2020-01-16 19:06:30,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:30,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888099567] [2020-01-16 19:06:30,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:30,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-01-16 19:06:30,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888099567] [2020-01-16 19:06:30,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:30,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:30,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026190987] [2020-01-16 19:06:30,753 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:30,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:30,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:30,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:30,754 INFO L87 Difference]: Start difference. First operand 390 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:06:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:30,852 INFO L93 Difference]: Finished difference Result 617 states and 1848 transitions. [2020-01-16 19:06:30,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:30,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:30,853 INFO L225 Difference]: With dead ends: 617 [2020-01-16 19:06:30,854 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:06:30,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:30,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:06:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 383. [2020-01-16 19:06:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:06:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1321 transitions. [2020-01-16 19:06:30,862 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1321 transitions. Word has length 22 [2020-01-16 19:06:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:30,862 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1321 transitions. [2020-01-16 19:06:30,862 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1321 transitions. [2020-01-16 19:06:30,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:30,863 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:30,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, 1, 1, 1] [2020-01-16 19:06:30,863 INFO L426 AbstractCegarLoop]: === Iteration 1123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:30,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:30,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1948864378, now seen corresponding path program 1117 times [2020-01-16 19:06:30,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:30,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425802927] [2020-01-16 19:06:30,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:31,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-01-16 19:06:31,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425802927] [2020-01-16 19:06:31,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:31,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:31,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741748902] [2020-01-16 19:06:31,134 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:31,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:31,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:31,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:31,135 INFO L87 Difference]: Start difference. First operand 383 states and 1321 transitions. Second operand 9 states. [2020-01-16 19:06:31,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:31,224 INFO L93 Difference]: Finished difference Result 633 states and 1871 transitions. [2020-01-16 19:06:31,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:31,224 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:31,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:31,226 INFO L225 Difference]: With dead ends: 633 [2020-01-16 19:06:31,226 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 19:06:31,226 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:31,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 19:06:31,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 389. [2020-01-16 19:06:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:06:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1335 transitions. [2020-01-16 19:06:31,234 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1335 transitions. Word has length 22 [2020-01-16 19:06:31,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:31,235 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1335 transitions. [2020-01-16 19:06:31,235 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1335 transitions. [2020-01-16 19:06:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:31,235 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:31,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, 1, 1, 1] [2020-01-16 19:06:31,235 INFO L426 AbstractCegarLoop]: === Iteration 1124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:31,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:31,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2075500752, now seen corresponding path program 1118 times [2020-01-16 19:06:31,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:31,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386920000] [2020-01-16 19:06:31,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:31,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-01-16 19:06:31,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386920000] [2020-01-16 19:06:31,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:31,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:31,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293357500] [2020-01-16 19:06:31,493 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:31,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:31,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:31,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:31,493 INFO L87 Difference]: Start difference. First operand 389 states and 1335 transitions. Second operand 9 states. [2020-01-16 19:06:31,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:31,590 INFO L93 Difference]: Finished difference Result 627 states and 1857 transitions. [2020-01-16 19:06:31,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:31,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:31,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:31,598 INFO L225 Difference]: With dead ends: 627 [2020-01-16 19:06:31,598 INFO L226 Difference]: Without dead ends: 614 [2020-01-16 19:06:31,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:31,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-01-16 19:06:31,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 386. [2020-01-16 19:06:31,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:06:31,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1328 transitions. [2020-01-16 19:06:31,605 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1328 transitions. Word has length 22 [2020-01-16 19:06:31,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:31,605 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1328 transitions. [2020-01-16 19:06:31,606 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:31,606 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1328 transitions. [2020-01-16 19:06:31,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:31,606 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:31,606 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:31,606 INFO L426 AbstractCegarLoop]: === Iteration 1125 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:31,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:31,606 INFO L82 PathProgramCache]: Analyzing trace with hash 873153222, now seen corresponding path program 1119 times [2020-01-16 19:06:31,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:31,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243616135] [2020-01-16 19:06:31,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:31,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-01-16 19:06:31,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243616135] [2020-01-16 19:06:31,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:31,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:31,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399744759] [2020-01-16 19:06:31,883 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:31,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:31,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:31,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:31,883 INFO L87 Difference]: Start difference. First operand 386 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:06:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:31,971 INFO L93 Difference]: Finished difference Result 629 states and 1864 transitions. [2020-01-16 19:06:31,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:31,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:31,973 INFO L225 Difference]: With dead ends: 629 [2020-01-16 19:06:31,973 INFO L226 Difference]: Without dead ends: 613 [2020-01-16 19:06:31,973 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:31,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-01-16 19:06:31,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 391. [2020-01-16 19:06:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:06:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1336 transitions. [2020-01-16 19:06:31,983 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1336 transitions. Word has length 22 [2020-01-16 19:06:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:31,983 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1336 transitions. [2020-01-16 19:06:31,983 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:31,983 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1336 transitions. [2020-01-16 19:06:31,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:31,984 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:31,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, 1, 1, 1] [2020-01-16 19:06:31,984 INFO L426 AbstractCegarLoop]: === Iteration 1126 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:31,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:31,984 INFO L82 PathProgramCache]: Analyzing trace with hash 764653776, now seen corresponding path program 1120 times [2020-01-16 19:06:31,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:31,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364369846] [2020-01-16 19:06:31,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:32,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-01-16 19:06:32,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364369846] [2020-01-16 19:06:32,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:32,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:32,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830676805] [2020-01-16 19:06:32,258 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:32,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:32,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:32,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:32,259 INFO L87 Difference]: Start difference. First operand 391 states and 1336 transitions. Second operand 9 states. [2020-01-16 19:06:32,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:32,353 INFO L93 Difference]: Finished difference Result 616 states and 1844 transitions. [2020-01-16 19:06:32,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:32,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:32,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:32,355 INFO L225 Difference]: With dead ends: 616 [2020-01-16 19:06:32,355 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 19:06:32,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:32,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 19:06:32,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 386. [2020-01-16 19:06:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:06:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1325 transitions. [2020-01-16 19:06:32,364 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1325 transitions. Word has length 22 [2020-01-16 19:06:32,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:32,364 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1325 transitions. [2020-01-16 19:06:32,364 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1325 transitions. [2020-01-16 19:06:32,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:32,365 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:32,365 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:32,365 INFO L426 AbstractCegarLoop]: === Iteration 1127 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:32,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:32,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1146381164, now seen corresponding path program 1121 times [2020-01-16 19:06:32,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:32,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860767854] [2020-01-16 19:06:32,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:32,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860767854] [2020-01-16 19:06:32,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:32,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:32,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339268123] [2020-01-16 19:06:32,630 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:32,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:32,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:32,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:32,631 INFO L87 Difference]: Start difference. First operand 386 states and 1325 transitions. Second operand 9 states. [2020-01-16 19:06:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:32,726 INFO L93 Difference]: Finished difference Result 620 states and 1842 transitions. [2020-01-16 19:06:32,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:32,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:32,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:32,728 INFO L225 Difference]: With dead ends: 620 [2020-01-16 19:06:32,728 INFO L226 Difference]: Without dead ends: 610 [2020-01-16 19:06:32,729 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:32,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-01-16 19:06:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 388. [2020-01-16 19:06:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:06:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1328 transitions. [2020-01-16 19:06:32,738 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1328 transitions. Word has length 22 [2020-01-16 19:06:32,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:32,738 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1328 transitions. [2020-01-16 19:06:32,738 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:32,738 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1328 transitions. [2020-01-16 19:06:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:32,739 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:32,739 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:32,739 INFO L426 AbstractCegarLoop]: === Iteration 1128 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:32,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:32,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1319628856, now seen corresponding path program 1122 times [2020-01-16 19:06:32,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:32,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189935605] [2020-01-16 19:06:32,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:33,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189935605] [2020-01-16 19:06:33,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:33,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:33,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661832661] [2020-01-16 19:06:33,016 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:33,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:33,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:33,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:33,017 INFO L87 Difference]: Start difference. First operand 388 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:06:33,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:33,118 INFO L93 Difference]: Finished difference Result 613 states and 1836 transitions. [2020-01-16 19:06:33,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:33,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:33,120 INFO L225 Difference]: With dead ends: 613 [2020-01-16 19:06:33,120 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 19:06:33,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:33,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 19:06:33,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 383. [2020-01-16 19:06:33,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:06:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-01-16 19:06:33,128 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-01-16 19:06:33,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:33,129 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-01-16 19:06:33,129 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:33,129 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-01-16 19:06:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:33,129 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:33,129 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:33,129 INFO L426 AbstractCegarLoop]: === Iteration 1129 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:33,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:33,130 INFO L82 PathProgramCache]: Analyzing trace with hash 754574172, now seen corresponding path program 1123 times [2020-01-16 19:06:33,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:33,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909036873] [2020-01-16 19:06:33,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:33,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909036873] [2020-01-16 19:06:33,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:33,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:33,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345075547] [2020-01-16 19:06:33,407 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:33,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:33,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:33,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:33,407 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:06:33,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:33,510 INFO L93 Difference]: Finished difference Result 614 states and 1831 transitions. [2020-01-16 19:06:33,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:33,511 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:33,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:33,512 INFO L225 Difference]: With dead ends: 614 [2020-01-16 19:06:33,512 INFO L226 Difference]: Without dead ends: 603 [2020-01-16 19:06:33,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-01-16 19:06:33,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 387. [2020-01-16 19:06:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:06:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1328 transitions. [2020-01-16 19:06:33,522 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1328 transitions. Word has length 22 [2020-01-16 19:06:33,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:33,522 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1328 transitions. [2020-01-16 19:06:33,522 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1328 transitions. [2020-01-16 19:06:33,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:33,522 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:33,522 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:33,523 INFO L426 AbstractCegarLoop]: === Iteration 1130 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:33,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:33,523 INFO L82 PathProgramCache]: Analyzing trace with hash 2096506960, now seen corresponding path program 1124 times [2020-01-16 19:06:33,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:33,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64786047] [2020-01-16 19:06:33,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:33,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-01-16 19:06:33,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64786047] [2020-01-16 19:06:33,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:33,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:33,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80537387] [2020-01-16 19:06:33,807 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:33,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:33,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:33,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:33,807 INFO L87 Difference]: Start difference. First operand 387 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:06:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:33,909 INFO L93 Difference]: Finished difference Result 613 states and 1827 transitions. [2020-01-16 19:06:33,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:33,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:33,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:33,910 INFO L225 Difference]: With dead ends: 613 [2020-01-16 19:06:33,910 INFO L226 Difference]: Without dead ends: 601 [2020-01-16 19:06:33,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:33,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-01-16 19:06:33,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 385. [2020-01-16 19:06:33,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:06:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1323 transitions. [2020-01-16 19:06:33,921 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1323 transitions. Word has length 22 [2020-01-16 19:06:33,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:33,921 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1323 transitions. [2020-01-16 19:06:33,921 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:33,921 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1323 transitions. [2020-01-16 19:06:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:33,921 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:33,922 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:33,922 INFO L426 AbstractCegarLoop]: === Iteration 1131 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:33,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:33,922 INFO L82 PathProgramCache]: Analyzing trace with hash -321136984, now seen corresponding path program 1125 times [2020-01-16 19:06:33,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:33,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850167601] [2020-01-16 19:06:33,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:34,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850167601] [2020-01-16 19:06:34,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:34,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:34,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011609469] [2020-01-16 19:06:34,201 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:34,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:34,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:34,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:34,202 INFO L87 Difference]: Start difference. First operand 385 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:06:34,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:34,303 INFO L93 Difference]: Finished difference Result 614 states and 1831 transitions. [2020-01-16 19:06:34,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:34,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:34,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:34,304 INFO L225 Difference]: With dead ends: 614 [2020-01-16 19:06:34,305 INFO L226 Difference]: Without dead ends: 603 [2020-01-16 19:06:34,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:34,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-01-16 19:06:34,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 388. [2020-01-16 19:06:34,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:06:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1328 transitions. [2020-01-16 19:06:34,313 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1328 transitions. Word has length 22 [2020-01-16 19:06:34,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:34,313 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1328 transitions. [2020-01-16 19:06:34,313 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:34,313 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1328 transitions. [2020-01-16 19:06:34,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:34,314 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:34,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, 1, 1, 1] [2020-01-16 19:06:34,314 INFO L426 AbstractCegarLoop]: === Iteration 1132 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:34,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:34,314 INFO L82 PathProgramCache]: Analyzing trace with hash 2145432152, now seen corresponding path program 1126 times [2020-01-16 19:06:34,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:34,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736473495] [2020-01-16 19:06:34,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:34,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-01-16 19:06:34,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736473495] [2020-01-16 19:06:34,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:34,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:34,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465843953] [2020-01-16 19:06:34,589 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:34,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:34,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:34,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:34,589 INFO L87 Difference]: Start difference. First operand 388 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:06:34,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:34,690 INFO L93 Difference]: Finished difference Result 606 states and 1822 transitions. [2020-01-16 19:06:34,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:34,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:34,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:34,692 INFO L225 Difference]: With dead ends: 606 [2020-01-16 19:06:34,692 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 19:06:34,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:34,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 19:06:34,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 385. [2020-01-16 19:06:34,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:06:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1321 transitions. [2020-01-16 19:06:34,702 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1321 transitions. Word has length 22 [2020-01-16 19:06:34,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:34,702 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1321 transitions. [2020-01-16 19:06:34,702 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:34,702 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1321 transitions. [2020-01-16 19:06:34,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:34,703 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:34,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, 1, 1, 1] [2020-01-16 19:06:34,703 INFO L426 AbstractCegarLoop]: === Iteration 1133 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:34,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:34,703 INFO L82 PathProgramCache]: Analyzing trace with hash -52289576, now seen corresponding path program 1127 times [2020-01-16 19:06:34,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:34,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740035949] [2020-01-16 19:06:34,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:34,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-01-16 19:06:34,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740035949] [2020-01-16 19:06:34,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:34,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:34,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027959022] [2020-01-16 19:06:34,978 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:34,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:34,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:34,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:34,978 INFO L87 Difference]: Start difference. First operand 385 states and 1321 transitions. Second operand 9 states. [2020-01-16 19:06:35,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:35,080 INFO L93 Difference]: Finished difference Result 612 states and 1824 transitions. [2020-01-16 19:06:35,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:35,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:35,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:35,081 INFO L225 Difference]: With dead ends: 612 [2020-01-16 19:06:35,082 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:06:35,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:35,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:06:35,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 387. [2020-01-16 19:06:35,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:06:35,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1324 transitions. [2020-01-16 19:06:35,091 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1324 transitions. Word has length 22 [2020-01-16 19:06:35,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:35,091 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1324 transitions. [2020-01-16 19:06:35,091 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1324 transitions. [2020-01-16 19:06:35,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:35,092 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:35,092 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:35,092 INFO L426 AbstractCegarLoop]: === Iteration 1134 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:35,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:35,092 INFO L82 PathProgramCache]: Analyzing trace with hash -225537268, now seen corresponding path program 1128 times [2020-01-16 19:06:35,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:35,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563968560] [2020-01-16 19:06:35,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:35,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-01-16 19:06:35,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563968560] [2020-01-16 19:06:35,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:35,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:35,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522891012] [2020-01-16 19:06:35,364 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:35,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:35,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:35,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:35,365 INFO L87 Difference]: Start difference. First operand 387 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:06:35,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:35,465 INFO L93 Difference]: Finished difference Result 605 states and 1818 transitions. [2020-01-16 19:06:35,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:35,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:35,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:35,466 INFO L225 Difference]: With dead ends: 605 [2020-01-16 19:06:35,466 INFO L226 Difference]: Without dead ends: 586 [2020-01-16 19:06:35,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:35,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-01-16 19:06:35,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 380. [2020-01-16 19:06:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:06:35,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1311 transitions. [2020-01-16 19:06:35,475 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1311 transitions. Word has length 22 [2020-01-16 19:06:35,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:35,475 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1311 transitions. [2020-01-16 19:06:35,475 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:35,475 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1311 transitions. [2020-01-16 19:06:35,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:35,476 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:35,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, 1, 1, 1] [2020-01-16 19:06:35,476 INFO L426 AbstractCegarLoop]: === Iteration 1135 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:35,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:35,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1701011146, now seen corresponding path program 1129 times [2020-01-16 19:06:35,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:35,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467775532] [2020-01-16 19:06:35,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:35,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-01-16 19:06:35,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467775532] [2020-01-16 19:06:35,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:35,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:35,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034884893] [2020-01-16 19:06:35,756 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:35,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:35,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:35,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:35,756 INFO L87 Difference]: Start difference. First operand 380 states and 1311 transitions. Second operand 9 states. [2020-01-16 19:06:35,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:35,835 INFO L93 Difference]: Finished difference Result 666 states and 1963 transitions. [2020-01-16 19:06:35,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:35,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:35,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:35,836 INFO L225 Difference]: With dead ends: 666 [2020-01-16 19:06:35,837 INFO L226 Difference]: Without dead ends: 650 [2020-01-16 19:06:35,837 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:35,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-01-16 19:06:35,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 394. [2020-01-16 19:06:35,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:06:35,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1354 transitions. [2020-01-16 19:06:35,853 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1354 transitions. Word has length 22 [2020-01-16 19:06:35,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:35,853 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1354 transitions. [2020-01-16 19:06:35,853 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:35,853 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1354 transitions. [2020-01-16 19:06:35,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:35,854 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:35,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, 1, 1, 1] [2020-01-16 19:06:35,854 INFO L426 AbstractCegarLoop]: === Iteration 1136 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:35,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:35,854 INFO L82 PathProgramCache]: Analyzing trace with hash -110745260, now seen corresponding path program 1130 times [2020-01-16 19:06:35,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:35,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145602687] [2020-01-16 19:06:35,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:36,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145602687] [2020-01-16 19:06:36,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:36,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:36,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790950538] [2020-01-16 19:06:36,131 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:36,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:36,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:36,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:36,132 INFO L87 Difference]: Start difference. First operand 394 states and 1354 transitions. Second operand 9 states. [2020-01-16 19:06:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:36,231 INFO L93 Difference]: Finished difference Result 661 states and 1950 transitions. [2020-01-16 19:06:36,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:36,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:36,233 INFO L225 Difference]: With dead ends: 661 [2020-01-16 19:06:36,233 INFO L226 Difference]: Without dead ends: 646 [2020-01-16 19:06:36,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:36,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-01-16 19:06:36,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 390. [2020-01-16 19:06:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:06:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1344 transitions. [2020-01-16 19:06:36,242 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1344 transitions. Word has length 22 [2020-01-16 19:06:36,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:36,242 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1344 transitions. [2020-01-16 19:06:36,242 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:36,242 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1344 transitions. [2020-01-16 19:06:36,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:36,243 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:36,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, 1, 1, 1] [2020-01-16 19:06:36,243 INFO L426 AbstractCegarLoop]: === Iteration 1137 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:36,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:36,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1435960282, now seen corresponding path program 1131 times [2020-01-16 19:06:36,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:36,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79415557] [2020-01-16 19:06:36,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:36,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-01-16 19:06:36,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79415557] [2020-01-16 19:06:36,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:36,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:36,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050303921] [2020-01-16 19:06:36,529 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:36,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:36,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:36,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:36,530 INFO L87 Difference]: Start difference. First operand 390 states and 1344 transitions. Second operand 9 states. [2020-01-16 19:06:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:36,601 INFO L93 Difference]: Finished difference Result 673 states and 1975 transitions. [2020-01-16 19:06:36,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:36,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:36,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:36,603 INFO L225 Difference]: With dead ends: 673 [2020-01-16 19:06:36,604 INFO L226 Difference]: Without dead ends: 657 [2020-01-16 19:06:36,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:36,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-01-16 19:06:36,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 398. [2020-01-16 19:06:36,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 19:06:36,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1357 transitions. [2020-01-16 19:06:36,613 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1357 transitions. Word has length 22 [2020-01-16 19:06:36,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:36,614 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1357 transitions. [2020-01-16 19:06:36,614 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1357 transitions. [2020-01-16 19:06:36,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:36,614 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:36,614 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:36,614 INFO L426 AbstractCegarLoop]: === Iteration 1138 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:36,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:36,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1361435464, now seen corresponding path program 1132 times [2020-01-16 19:06:36,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:36,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647967515] [2020-01-16 19:06:36,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:36,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:36,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647967515] [2020-01-16 19:06:36,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:36,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:36,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625842101] [2020-01-16 19:06:36,907 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:36,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:36,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:36,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:36,908 INFO L87 Difference]: Start difference. First operand 398 states and 1357 transitions. Second operand 9 states. [2020-01-16 19:06:37,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:37,024 INFO L93 Difference]: Finished difference Result 671 states and 1965 transitions. [2020-01-16 19:06:37,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:37,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:37,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:37,026 INFO L225 Difference]: With dead ends: 671 [2020-01-16 19:06:37,026 INFO L226 Difference]: Without dead ends: 649 [2020-01-16 19:06:37,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2020-01-16 19:06:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 390. [2020-01-16 19:06:37,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:06:37,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1339 transitions. [2020-01-16 19:06:37,035 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1339 transitions. Word has length 22 [2020-01-16 19:06:37,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:37,036 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1339 transitions. [2020-01-16 19:06:37,036 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:37,036 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1339 transitions. [2020-01-16 19:06:37,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:37,036 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:37,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, 1, 1, 1] [2020-01-16 19:06:37,036 INFO L426 AbstractCegarLoop]: === Iteration 1139 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:37,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:37,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1643710600, now seen corresponding path program 1133 times [2020-01-16 19:06:37,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:37,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84854322] [2020-01-16 19:06:37,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:37,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-01-16 19:06:37,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84854322] [2020-01-16 19:06:37,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:37,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:37,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489407822] [2020-01-16 19:06:37,311 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:37,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:37,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:37,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:37,311 INFO L87 Difference]: Start difference. First operand 390 states and 1339 transitions. Second operand 9 states. [2020-01-16 19:06:37,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:37,410 INFO L93 Difference]: Finished difference Result 658 states and 1940 transitions. [2020-01-16 19:06:37,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:37,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:37,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:37,412 INFO L225 Difference]: With dead ends: 658 [2020-01-16 19:06:37,412 INFO L226 Difference]: Without dead ends: 647 [2020-01-16 19:06:37,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:37,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2020-01-16 19:06:37,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 393. [2020-01-16 19:06:37,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:06:37,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1344 transitions. [2020-01-16 19:06:37,422 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1344 transitions. Word has length 22 [2020-01-16 19:06:37,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:37,422 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1344 transitions. [2020-01-16 19:06:37,423 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:37,423 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1344 transitions. [2020-01-16 19:06:37,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:37,423 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:37,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, 1, 1, 1] [2020-01-16 19:06:37,423 INFO L426 AbstractCegarLoop]: === Iteration 1140 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:37,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:37,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1662144626, now seen corresponding path program 1134 times [2020-01-16 19:06:37,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:37,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234878176] [2020-01-16 19:06:37,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:37,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-01-16 19:06:37,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234878176] [2020-01-16 19:06:37,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:37,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:37,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755625877] [2020-01-16 19:06:37,712 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:37,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:37,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:37,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:37,713 INFO L87 Difference]: Start difference. First operand 393 states and 1344 transitions. Second operand 9 states. [2020-01-16 19:06:37,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:37,812 INFO L93 Difference]: Finished difference Result 661 states and 1943 transitions. [2020-01-16 19:06:37,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:37,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:37,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:37,814 INFO L225 Difference]: With dead ends: 661 [2020-01-16 19:06:37,814 INFO L226 Difference]: Without dead ends: 639 [2020-01-16 19:06:37,814 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:37,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-01-16 19:06:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 385. [2020-01-16 19:06:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:06:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1327 transitions. [2020-01-16 19:06:37,823 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1327 transitions. Word has length 22 [2020-01-16 19:06:37,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:37,824 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1327 transitions. [2020-01-16 19:06:37,824 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:37,824 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1327 transitions. [2020-01-16 19:06:37,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:37,824 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:37,824 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:37,824 INFO L426 AbstractCegarLoop]: === Iteration 1141 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:37,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:37,825 INFO L82 PathProgramCache]: Analyzing trace with hash -2123496872, now seen corresponding path program 1135 times [2020-01-16 19:06:37,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:37,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865635829] [2020-01-16 19:06:37,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:38,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865635829] [2020-01-16 19:06:38,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:38,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:38,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045425825] [2020-01-16 19:06:38,102 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:38,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:38,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:38,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:38,102 INFO L87 Difference]: Start difference. First operand 385 states and 1327 transitions. Second operand 9 states. [2020-01-16 19:06:38,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:38,179 INFO L93 Difference]: Finished difference Result 656 states and 1935 transitions. [2020-01-16 19:06:38,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:38,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:38,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:38,180 INFO L225 Difference]: With dead ends: 656 [2020-01-16 19:06:38,181 INFO L226 Difference]: Without dead ends: 640 [2020-01-16 19:06:38,181 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:38,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-01-16 19:06:38,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 393. [2020-01-16 19:06:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:06:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1347 transitions. [2020-01-16 19:06:38,190 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1347 transitions. Word has length 22 [2020-01-16 19:06:38,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:38,190 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1347 transitions. [2020-01-16 19:06:38,190 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:38,190 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1347 transitions. [2020-01-16 19:06:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:38,191 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:38,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, 1, 1, 1] [2020-01-16 19:06:38,191 INFO L426 AbstractCegarLoop]: === Iteration 1142 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:38,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:38,191 INFO L82 PathProgramCache]: Analyzing trace with hash -533230986, now seen corresponding path program 1136 times [2020-01-16 19:06:38,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:38,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181238219] [2020-01-16 19:06:38,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:38,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-01-16 19:06:38,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181238219] [2020-01-16 19:06:38,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:38,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:38,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175005823] [2020-01-16 19:06:38,466 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:38,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:38,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:38,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:38,466 INFO L87 Difference]: Start difference. First operand 393 states and 1347 transitions. Second operand 9 states. [2020-01-16 19:06:38,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:38,565 INFO L93 Difference]: Finished difference Result 651 states and 1922 transitions. [2020-01-16 19:06:38,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:38,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:38,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:38,567 INFO L225 Difference]: With dead ends: 651 [2020-01-16 19:06:38,567 INFO L226 Difference]: Without dead ends: 636 [2020-01-16 19:06:38,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:38,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2020-01-16 19:06:38,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 389. [2020-01-16 19:06:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:06:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1337 transitions. [2020-01-16 19:06:38,576 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1337 transitions. Word has length 22 [2020-01-16 19:06:38,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:38,576 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1337 transitions. [2020-01-16 19:06:38,576 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1337 transitions. [2020-01-16 19:06:38,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:38,577 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:38,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, 1, 1, 1] [2020-01-16 19:06:38,577 INFO L426 AbstractCegarLoop]: === Iteration 1143 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:38,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:38,577 INFO L82 PathProgramCache]: Analyzing trace with hash 822793672, now seen corresponding path program 1137 times [2020-01-16 19:06:38,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:38,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086023022] [2020-01-16 19:06:38,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:38,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-01-16 19:06:38,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086023022] [2020-01-16 19:06:38,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:38,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:38,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352082133] [2020-01-16 19:06:38,859 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:38,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:38,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:38,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:38,859 INFO L87 Difference]: Start difference. First operand 389 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:06:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:38,936 INFO L93 Difference]: Finished difference Result 650 states and 1922 transitions. [2020-01-16 19:06:38,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:38,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:38,938 INFO L225 Difference]: With dead ends: 650 [2020-01-16 19:06:38,938 INFO L226 Difference]: Without dead ends: 634 [2020-01-16 19:06:38,938 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:38,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-01-16 19:06:38,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 394. [2020-01-16 19:06:38,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:06:38,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1345 transitions. [2020-01-16 19:06:38,948 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1345 transitions. Word has length 22 [2020-01-16 19:06:38,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:38,948 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1345 transitions. [2020-01-16 19:06:38,948 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1345 transitions. [2020-01-16 19:06:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:38,949 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:38,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, 1, 1, 1] [2020-01-16 19:06:38,949 INFO L426 AbstractCegarLoop]: === Iteration 1144 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:38,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:38,949 INFO L82 PathProgramCache]: Analyzing trace with hash -878534230, now seen corresponding path program 1138 times [2020-01-16 19:06:38,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:38,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451313901] [2020-01-16 19:06:38,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:39,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-01-16 19:06:39,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451313901] [2020-01-16 19:06:39,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:39,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:39,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897660771] [2020-01-16 19:06:39,226 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:39,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:39,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:39,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:39,226 INFO L87 Difference]: Start difference. First operand 394 states and 1345 transitions. Second operand 9 states. [2020-01-16 19:06:39,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:39,325 INFO L93 Difference]: Finished difference Result 637 states and 1902 transitions. [2020-01-16 19:06:39,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:39,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:39,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:39,327 INFO L225 Difference]: With dead ends: 637 [2020-01-16 19:06:39,327 INFO L226 Difference]: Without dead ends: 620 [2020-01-16 19:06:39,327 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:39,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-01-16 19:06:39,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 389. [2020-01-16 19:06:39,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:06:39,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1333 transitions. [2020-01-16 19:06:39,337 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1333 transitions. Word has length 22 [2020-01-16 19:06:39,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:39,337 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1333 transitions. [2020-01-16 19:06:39,337 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:39,337 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1333 transitions. [2020-01-16 19:06:39,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:39,337 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:39,338 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:39,338 INFO L426 AbstractCegarLoop]: === Iteration 1145 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:39,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:39,338 INFO L82 PathProgramCache]: Analyzing trace with hash -392502742, now seen corresponding path program 1139 times [2020-01-16 19:06:39,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:39,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408268429] [2020-01-16 19:06:39,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:39,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-01-16 19:06:39,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408268429] [2020-01-16 19:06:39,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:39,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:39,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997010620] [2020-01-16 19:06:39,620 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:39,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:39,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:39,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:39,621 INFO L87 Difference]: Start difference. First operand 389 states and 1333 transitions. Second operand 9 states. [2020-01-16 19:06:39,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:39,735 INFO L93 Difference]: Finished difference Result 643 states and 1904 transitions. [2020-01-16 19:06:39,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:39,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:39,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:39,737 INFO L225 Difference]: With dead ends: 643 [2020-01-16 19:06:39,737 INFO L226 Difference]: Without dead ends: 632 [2020-01-16 19:06:39,737 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:39,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-01-16 19:06:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 392. [2020-01-16 19:06:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:06:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1338 transitions. [2020-01-16 19:06:39,746 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1338 transitions. Word has length 22 [2020-01-16 19:06:39,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:39,746 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1338 transitions. [2020-01-16 19:06:39,746 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1338 transitions. [2020-01-16 19:06:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:39,747 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:39,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, 1, 1, 1] [2020-01-16 19:06:39,747 INFO L426 AbstractCegarLoop]: === Iteration 1146 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:39,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:39,747 INFO L82 PathProgramCache]: Analyzing trace with hash 481237938, now seen corresponding path program 1140 times [2020-01-16 19:06:39,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:39,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006252303] [2020-01-16 19:06:39,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:40,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-01-16 19:06:40,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006252303] [2020-01-16 19:06:40,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:40,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:40,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899032144] [2020-01-16 19:06:40,046 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:40,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:40,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:40,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:40,047 INFO L87 Difference]: Start difference. First operand 392 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:06:40,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:40,140 INFO L93 Difference]: Finished difference Result 635 states and 1895 transitions. [2020-01-16 19:06:40,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:40,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:40,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:40,142 INFO L225 Difference]: With dead ends: 635 [2020-01-16 19:06:40,142 INFO L226 Difference]: Without dead ends: 616 [2020-01-16 19:06:40,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-01-16 19:06:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 385. [2020-01-16 19:06:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:06:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1323 transitions. [2020-01-16 19:06:40,150 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1323 transitions. Word has length 22 [2020-01-16 19:06:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:40,151 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1323 transitions. [2020-01-16 19:06:40,151 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1323 transitions. [2020-01-16 19:06:40,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:40,151 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:40,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, 1, 1, 1] [2020-01-16 19:06:40,151 INFO L426 AbstractCegarLoop]: === Iteration 1147 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:40,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:40,152 INFO L82 PathProgramCache]: Analyzing trace with hash -295266634, now seen corresponding path program 1141 times [2020-01-16 19:06:40,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:40,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519923493] [2020-01-16 19:06:40,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:40,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519923493] [2020-01-16 19:06:40,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:40,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:40,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408425070] [2020-01-16 19:06:40,441 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:40,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:40,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:40,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:40,441 INFO L87 Difference]: Start difference. First operand 385 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:06:40,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:40,517 INFO L93 Difference]: Finished difference Result 669 states and 1962 transitions. [2020-01-16 19:06:40,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:40,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:40,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:40,519 INFO L225 Difference]: With dead ends: 669 [2020-01-16 19:06:40,519 INFO L226 Difference]: Without dead ends: 653 [2020-01-16 19:06:40,520 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:40,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-01-16 19:06:40,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 399. [2020-01-16 19:06:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-01-16 19:06:40,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1356 transitions. [2020-01-16 19:06:40,529 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1356 transitions. Word has length 22 [2020-01-16 19:06:40,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:40,530 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 1356 transitions. [2020-01-16 19:06:40,530 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:40,530 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1356 transitions. [2020-01-16 19:06:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:40,530 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:40,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, 1, 1, 1] [2020-01-16 19:06:40,531 INFO L426 AbstractCegarLoop]: === Iteration 1148 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:40,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:40,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1792838184, now seen corresponding path program 1142 times [2020-01-16 19:06:40,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:40,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909679766] [2020-01-16 19:06:40,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:40,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-01-16 19:06:40,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909679766] [2020-01-16 19:06:40,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:40,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:40,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485636273] [2020-01-16 19:06:40,810 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:40,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:40,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:40,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:40,810 INFO L87 Difference]: Start difference. First operand 399 states and 1356 transitions. Second operand 9 states. [2020-01-16 19:06:40,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:40,909 INFO L93 Difference]: Finished difference Result 667 states and 1952 transitions. [2020-01-16 19:06:40,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:40,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:40,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:40,911 INFO L225 Difference]: With dead ends: 667 [2020-01-16 19:06:40,911 INFO L226 Difference]: Without dead ends: 645 [2020-01-16 19:06:40,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:40,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-01-16 19:06:40,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 391. [2020-01-16 19:06:40,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:06:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1337 transitions. [2020-01-16 19:06:40,919 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1337 transitions. Word has length 22 [2020-01-16 19:06:40,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:40,920 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1337 transitions. [2020-01-16 19:06:40,920 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:40,920 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1337 transitions. [2020-01-16 19:06:40,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:40,920 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:40,920 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:40,920 INFO L426 AbstractCegarLoop]: === Iteration 1149 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:40,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:40,921 INFO L82 PathProgramCache]: Analyzing trace with hash 449435864, now seen corresponding path program 1143 times [2020-01-16 19:06:40,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:40,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112027907] [2020-01-16 19:06:40,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:41,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:41,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112027907] [2020-01-16 19:06:41,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:41,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:41,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194710811] [2020-01-16 19:06:41,209 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:41,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:41,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:41,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:41,209 INFO L87 Difference]: Start difference. First operand 391 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:06:41,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:41,302 INFO L93 Difference]: Finished difference Result 656 states and 1931 transitions. [2020-01-16 19:06:41,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:41,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:41,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:41,303 INFO L225 Difference]: With dead ends: 656 [2020-01-16 19:06:41,304 INFO L226 Difference]: Without dead ends: 640 [2020-01-16 19:06:41,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:41,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-01-16 19:06:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 396. [2020-01-16 19:06:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:06:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1345 transitions. [2020-01-16 19:06:41,312 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1345 transitions. Word has length 22 [2020-01-16 19:06:41,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:41,313 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1345 transitions. [2020-01-16 19:06:41,313 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:41,313 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1345 transitions. [2020-01-16 19:06:41,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:41,313 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:41,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, 1, 1, 1] [2020-01-16 19:06:41,313 INFO L426 AbstractCegarLoop]: === Iteration 1150 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:41,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:41,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1251892038, now seen corresponding path program 1144 times [2020-01-16 19:06:41,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:41,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200248386] [2020-01-16 19:06:41,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:41,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:41,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200248386] [2020-01-16 19:06:41,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:41,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:41,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842101012] [2020-01-16 19:06:41,601 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:41,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:41,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:41,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:41,602 INFO L87 Difference]: Start difference. First operand 396 states and 1345 transitions. Second operand 9 states. [2020-01-16 19:06:41,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:41,708 INFO L93 Difference]: Finished difference Result 643 states and 1911 transitions. [2020-01-16 19:06:41,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:41,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:41,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:41,710 INFO L225 Difference]: With dead ends: 643 [2020-01-16 19:06:41,710 INFO L226 Difference]: Without dead ends: 626 [2020-01-16 19:06:41,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:41,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-01-16 19:06:41,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 391. [2020-01-16 19:06:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:06:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1332 transitions. [2020-01-16 19:06:41,720 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1332 transitions. Word has length 22 [2020-01-16 19:06:41,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:41,720 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1332 transitions. [2020-01-16 19:06:41,720 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1332 transitions. [2020-01-16 19:06:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:41,721 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:41,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, 1, 1, 1] [2020-01-16 19:06:41,721 INFO L426 AbstractCegarLoop]: === Iteration 1151 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:41,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:41,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2129059412, now seen corresponding path program 1145 times [2020-01-16 19:06:41,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:41,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105845333] [2020-01-16 19:06:41,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:41,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105845333] [2020-01-16 19:06:41,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:41,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:41,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996121076] [2020-01-16 19:06:41,987 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:41,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:41,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:41,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:41,987 INFO L87 Difference]: Start difference. First operand 391 states and 1332 transitions. Second operand 9 states. [2020-01-16 19:06:42,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:42,087 INFO L93 Difference]: Finished difference Result 653 states and 1921 transitions. [2020-01-16 19:06:42,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:42,087 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:42,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:42,089 INFO L225 Difference]: With dead ends: 653 [2020-01-16 19:06:42,089 INFO L226 Difference]: Without dead ends: 639 [2020-01-16 19:06:42,089 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:42,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-01-16 19:06:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 395. [2020-01-16 19:06:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:06:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1339 transitions. [2020-01-16 19:06:42,099 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1339 transitions. Word has length 22 [2020-01-16 19:06:42,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:42,099 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1339 transitions. [2020-01-16 19:06:42,099 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:42,099 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1339 transitions. [2020-01-16 19:06:42,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:42,100 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:42,100 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:42,100 INFO L426 AbstractCegarLoop]: === Iteration 1152 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:42,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:42,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1307033354, now seen corresponding path program 1146 times [2020-01-16 19:06:42,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:42,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677950328] [2020-01-16 19:06:42,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:42,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-01-16 19:06:42,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677950328] [2020-01-16 19:06:42,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:42,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:42,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934570257] [2020-01-16 19:06:42,380 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:42,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:42,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:42,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:42,381 INFO L87 Difference]: Start difference. First operand 395 states and 1339 transitions. Second operand 9 states. [2020-01-16 19:06:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:42,481 INFO L93 Difference]: Finished difference Result 642 states and 1905 transitions. [2020-01-16 19:06:42,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:42,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:42,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:42,483 INFO L225 Difference]: With dead ends: 642 [2020-01-16 19:06:42,483 INFO L226 Difference]: Without dead ends: 620 [2020-01-16 19:06:42,484 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-01-16 19:06:42,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 385. [2020-01-16 19:06:42,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:06:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1318 transitions. [2020-01-16 19:06:42,493 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1318 transitions. Word has length 22 [2020-01-16 19:06:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:42,493 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1318 transitions. [2020-01-16 19:06:42,493 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1318 transitions. [2020-01-16 19:06:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:42,494 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:42,494 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:42,494 INFO L426 AbstractCegarLoop]: === Iteration 1153 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:42,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:42,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1711318868, now seen corresponding path program 1147 times [2020-01-16 19:06:42,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:42,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126427441] [2020-01-16 19:06:42,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:42,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126427441] [2020-01-16 19:06:42,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:42,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:42,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604578472] [2020-01-16 19:06:42,755 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:42,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:42,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:42,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:42,755 INFO L87 Difference]: Start difference. First operand 385 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:06:42,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:42,858 INFO L93 Difference]: Finished difference Result 644 states and 1904 transitions. [2020-01-16 19:06:42,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:42,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:42,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:42,860 INFO L225 Difference]: With dead ends: 644 [2020-01-16 19:06:42,860 INFO L226 Difference]: Without dead ends: 633 [2020-01-16 19:06:42,860 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-01-16 19:06:42,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 391. [2020-01-16 19:06:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:06:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1334 transitions. [2020-01-16 19:06:42,869 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1334 transitions. Word has length 22 [2020-01-16 19:06:42,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:42,870 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1334 transitions. [2020-01-16 19:06:42,870 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1334 transitions. [2020-01-16 19:06:42,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:42,870 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:42,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, 1, 1, 1] [2020-01-16 19:06:42,870 INFO L426 AbstractCegarLoop]: === Iteration 1154 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:42,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:42,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1729752894, now seen corresponding path program 1148 times [2020-01-16 19:06:42,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:42,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646228919] [2020-01-16 19:06:42,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:43,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646228919] [2020-01-16 19:06:43,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:43,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:43,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52581679] [2020-01-16 19:06:43,147 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:43,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:43,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:43,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:43,148 INFO L87 Difference]: Start difference. First operand 391 states and 1334 transitions. Second operand 9 states. [2020-01-16 19:06:43,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:43,249 INFO L93 Difference]: Finished difference Result 647 states and 1907 transitions. [2020-01-16 19:06:43,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:43,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:43,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:43,251 INFO L225 Difference]: With dead ends: 647 [2020-01-16 19:06:43,251 INFO L226 Difference]: Without dead ends: 630 [2020-01-16 19:06:43,251 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:43,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-01-16 19:06:43,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 388. [2020-01-16 19:06:43,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:06:43,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1326 transitions. [2020-01-16 19:06:43,260 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1326 transitions. Word has length 22 [2020-01-16 19:06:43,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:43,261 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1326 transitions. [2020-01-16 19:06:43,261 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:43,261 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1326 transitions. [2020-01-16 19:06:43,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:43,261 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:43,261 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:43,261 INFO L426 AbstractCegarLoop]: === Iteration 1155 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:43,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:43,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1838945930, now seen corresponding path program 1149 times [2020-01-16 19:06:43,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:43,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035360334] [2020-01-16 19:06:43,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:43,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-01-16 19:06:43,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035360334] [2020-01-16 19:06:43,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:43,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:43,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005010627] [2020-01-16 19:06:43,536 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:43,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:43,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:43,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:43,537 INFO L87 Difference]: Start difference. First operand 388 states and 1326 transitions. Second operand 9 states. [2020-01-16 19:06:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:43,637 INFO L93 Difference]: Finished difference Result 639 states and 1892 transitions. [2020-01-16 19:06:43,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:43,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:43,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:43,638 INFO L225 Difference]: With dead ends: 639 [2020-01-16 19:06:43,639 INFO L226 Difference]: Without dead ends: 628 [2020-01-16 19:06:43,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:43,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-01-16 19:06:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 391. [2020-01-16 19:06:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:06:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1331 transitions. [2020-01-16 19:06:43,648 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1331 transitions. Word has length 22 [2020-01-16 19:06:43,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:43,648 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1331 transitions. [2020-01-16 19:06:43,649 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1331 transitions. [2020-01-16 19:06:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:43,649 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:43,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, 1, 1, 1] [2020-01-16 19:06:43,649 INFO L426 AbstractCegarLoop]: === Iteration 1156 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:43,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:43,650 INFO L82 PathProgramCache]: Analyzing trace with hash -965205250, now seen corresponding path program 1150 times [2020-01-16 19:06:43,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:43,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79514728] [2020-01-16 19:06:43,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:43,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-01-16 19:06:43,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79514728] [2020-01-16 19:06:43,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:43,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:43,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885746489] [2020-01-16 19:06:43,919 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:43,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:43,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:43,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:43,920 INFO L87 Difference]: Start difference. First operand 391 states and 1331 transitions. Second operand 9 states. [2020-01-16 19:06:44,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:44,021 INFO L93 Difference]: Finished difference Result 631 states and 1883 transitions. [2020-01-16 19:06:44,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:44,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:44,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:44,022 INFO L225 Difference]: With dead ends: 631 [2020-01-16 19:06:44,023 INFO L226 Difference]: Without dead ends: 616 [2020-01-16 19:06:44,023 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-01-16 19:06:44,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 388. [2020-01-16 19:06:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:06:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1323 transitions. [2020-01-16 19:06:44,032 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1323 transitions. Word has length 22 [2020-01-16 19:06:44,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:44,032 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1323 transitions. [2020-01-16 19:06:44,032 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:44,032 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1323 transitions. [2020-01-16 19:06:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:44,033 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:44,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, 1, 1, 1] [2020-01-16 19:06:44,033 INFO L426 AbstractCegarLoop]: === Iteration 1157 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:44,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:44,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1249057098, now seen corresponding path program 1151 times [2020-01-16 19:06:44,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:44,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356920732] [2020-01-16 19:06:44,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:44,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356920732] [2020-01-16 19:06:44,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:44,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:44,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637841647] [2020-01-16 19:06:44,306 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:44,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:44,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:44,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:44,306 INFO L87 Difference]: Start difference. First operand 388 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:06:44,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:44,406 INFO L93 Difference]: Finished difference Result 643 states and 1898 transitions. [2020-01-16 19:06:44,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:44,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:44,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:44,407 INFO L225 Difference]: With dead ends: 643 [2020-01-16 19:06:44,408 INFO L226 Difference]: Without dead ends: 629 [2020-01-16 19:06:44,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:44,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-01-16 19:06:44,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 392. [2020-01-16 19:06:44,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:06:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1330 transitions. [2020-01-16 19:06:44,417 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1330 transitions. Word has length 22 [2020-01-16 19:06:44,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:44,417 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1330 transitions. [2020-01-16 19:06:44,417 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1330 transitions. [2020-01-16 19:06:44,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:44,417 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:44,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, 1, 1, 1] [2020-01-16 19:06:44,418 INFO L426 AbstractCegarLoop]: === Iteration 1158 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:44,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:44,418 INFO L82 PathProgramCache]: Analyzing trace with hash -393750444, now seen corresponding path program 1152 times [2020-01-16 19:06:44,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:44,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004075071] [2020-01-16 19:06:44,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:44,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004075071] [2020-01-16 19:06:44,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:44,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:44,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530309891] [2020-01-16 19:06:44,683 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:44,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:44,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:44,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:44,684 INFO L87 Difference]: Start difference. First operand 392 states and 1330 transitions. Second operand 9 states. [2020-01-16 19:06:44,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:44,785 INFO L93 Difference]: Finished difference Result 632 states and 1882 transitions. [2020-01-16 19:06:44,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:44,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:44,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:44,787 INFO L225 Difference]: With dead ends: 632 [2020-01-16 19:06:44,787 INFO L226 Difference]: Without dead ends: 608 [2020-01-16 19:06:44,787 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:44,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-01-16 19:06:44,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 380. [2020-01-16 19:06:44,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:06:44,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1307 transitions. [2020-01-16 19:06:44,797 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1307 transitions. Word has length 22 [2020-01-16 19:06:44,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:44,797 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1307 transitions. [2020-01-16 19:06:44,797 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:44,797 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1307 transitions. [2020-01-16 19:06:44,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:44,798 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:44,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, 1, 1, 1] [2020-01-16 19:06:44,798 INFO L426 AbstractCegarLoop]: === Iteration 1159 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:44,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:44,798 INFO L82 PathProgramCache]: Analyzing trace with hash 884841890, now seen corresponding path program 1153 times [2020-01-16 19:06:44,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:44,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074258002] [2020-01-16 19:06:44,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:45,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-01-16 19:06:45,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074258002] [2020-01-16 19:06:45,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:45,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:45,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914201593] [2020-01-16 19:06:45,046 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:45,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:45,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:45,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:45,046 INFO L87 Difference]: Start difference. First operand 380 states and 1307 transitions. Second operand 9 states. [2020-01-16 19:06:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:45,121 INFO L93 Difference]: Finished difference Result 653 states and 1918 transitions. [2020-01-16 19:06:45,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:45,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:45,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:45,123 INFO L225 Difference]: With dead ends: 653 [2020-01-16 19:06:45,123 INFO L226 Difference]: Without dead ends: 637 [2020-01-16 19:06:45,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:45,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-01-16 19:06:45,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 391. [2020-01-16 19:06:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:06:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1339 transitions. [2020-01-16 19:06:45,141 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1339 transitions. Word has length 22 [2020-01-16 19:06:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:45,142 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1339 transitions. [2020-01-16 19:06:45,142 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1339 transitions. [2020-01-16 19:06:45,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:45,142 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:45,142 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:45,143 INFO L426 AbstractCegarLoop]: === Iteration 1160 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:45,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:45,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1011478264, now seen corresponding path program 1154 times [2020-01-16 19:06:45,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:45,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019764078] [2020-01-16 19:06:45,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:45,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019764078] [2020-01-16 19:06:45,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:45,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:45,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239379044] [2020-01-16 19:06:45,390 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:45,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:45,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:45,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:45,390 INFO L87 Difference]: Start difference. First operand 391 states and 1339 transitions. Second operand 9 states. [2020-01-16 19:06:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:45,491 INFO L93 Difference]: Finished difference Result 647 states and 1904 transitions. [2020-01-16 19:06:45,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:45,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:45,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:45,493 INFO L225 Difference]: With dead ends: 647 [2020-01-16 19:06:45,493 INFO L226 Difference]: Without dead ends: 634 [2020-01-16 19:06:45,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-01-16 19:06:45,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 388. [2020-01-16 19:06:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:06:45,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1332 transitions. [2020-01-16 19:06:45,502 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1332 transitions. Word has length 22 [2020-01-16 19:06:45,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:45,502 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1332 transitions. [2020-01-16 19:06:45,502 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1332 transitions. [2020-01-16 19:06:45,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:45,503 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:45,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, 1, 1, 1] [2020-01-16 19:06:45,503 INFO L426 AbstractCegarLoop]: === Iteration 1161 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:45,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:45,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1801810224, now seen corresponding path program 1155 times [2020-01-16 19:06:45,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:45,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818567600] [2020-01-16 19:06:45,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:45,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-01-16 19:06:45,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818567600] [2020-01-16 19:06:45,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:45,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:45,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785717648] [2020-01-16 19:06:45,777 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:45,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:45,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:45,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:45,777 INFO L87 Difference]: Start difference. First operand 388 states and 1332 transitions. Second operand 9 states. [2020-01-16 19:06:45,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:45,854 INFO L93 Difference]: Finished difference Result 662 states and 1936 transitions. [2020-01-16 19:06:45,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:45,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:45,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:45,856 INFO L225 Difference]: With dead ends: 662 [2020-01-16 19:06:45,856 INFO L226 Difference]: Without dead ends: 646 [2020-01-16 19:06:45,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:45,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-01-16 19:06:45,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 396. [2020-01-16 19:06:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:06:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1345 transitions. [2020-01-16 19:06:45,865 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1345 transitions. Word has length 22 [2020-01-16 19:06:45,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:45,866 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1345 transitions. [2020-01-16 19:06:45,866 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1345 transitions. [2020-01-16 19:06:45,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:45,866 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:45,866 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:45,866 INFO L426 AbstractCegarLoop]: === Iteration 1162 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:45,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:45,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1843711480, now seen corresponding path program 1156 times [2020-01-16 19:06:45,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:45,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946784694] [2020-01-16 19:06:45,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:46,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946784694] [2020-01-16 19:06:46,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:46,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:46,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971041627] [2020-01-16 19:06:46,129 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:46,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:46,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:46,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:46,129 INFO L87 Difference]: Start difference. First operand 396 states and 1345 transitions. Second operand 9 states. [2020-01-16 19:06:46,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:46,234 INFO L93 Difference]: Finished difference Result 660 states and 1926 transitions. [2020-01-16 19:06:46,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:46,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:46,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:46,236 INFO L225 Difference]: With dead ends: 660 [2020-01-16 19:06:46,236 INFO L226 Difference]: Without dead ends: 638 [2020-01-16 19:06:46,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:46,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-01-16 19:06:46,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 388. [2020-01-16 19:06:46,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:06:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1328 transitions. [2020-01-16 19:06:46,255 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1328 transitions. Word has length 22 [2020-01-16 19:06:46,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:46,255 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1328 transitions. [2020-01-16 19:06:46,255 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1328 transitions. [2020-01-16 19:06:46,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:46,256 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:46,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, 1, 1, 1] [2020-01-16 19:06:46,256 INFO L426 AbstractCegarLoop]: === Iteration 1163 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:46,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:46,256 INFO L82 PathProgramCache]: Analyzing trace with hash 473622686, now seen corresponding path program 1157 times [2020-01-16 19:06:46,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:46,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687623949] [2020-01-16 19:06:46,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:46,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:46,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687623949] [2020-01-16 19:06:46,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:46,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:46,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685459252] [2020-01-16 19:06:46,503 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:46,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:46,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:46,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:46,503 INFO L87 Difference]: Start difference. First operand 388 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:06:46,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:46,605 INFO L93 Difference]: Finished difference Result 644 states and 1895 transitions. [2020-01-16 19:06:46,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:46,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:46,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:46,607 INFO L225 Difference]: With dead ends: 644 [2020-01-16 19:06:46,607 INFO L226 Difference]: Without dead ends: 634 [2020-01-16 19:06:46,607 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:46,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-01-16 19:06:46,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 390. [2020-01-16 19:06:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:06:46,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1331 transitions. [2020-01-16 19:06:46,617 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1331 transitions. Word has length 22 [2020-01-16 19:06:46,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:46,617 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1331 transitions. [2020-01-16 19:06:46,617 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1331 transitions. [2020-01-16 19:06:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:46,618 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:46,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, 1, 1, 1] [2020-01-16 19:06:46,618 INFO L426 AbstractCegarLoop]: === Iteration 1164 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:46,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:46,618 INFO L82 PathProgramCache]: Analyzing trace with hash -444327504, now seen corresponding path program 1158 times [2020-01-16 19:06:46,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:46,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780455860] [2020-01-16 19:06:46,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:46,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-01-16 19:06:46,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780455860] [2020-01-16 19:06:46,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:46,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:46,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621027156] [2020-01-16 19:06:46,863 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:46,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:46,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:46,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:46,863 INFO L87 Difference]: Start difference. First operand 390 states and 1331 transitions. Second operand 9 states. [2020-01-16 19:06:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:46,967 INFO L93 Difference]: Finished difference Result 648 states and 1901 transitions. [2020-01-16 19:06:46,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:46,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:46,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:46,969 INFO L225 Difference]: With dead ends: 648 [2020-01-16 19:06:46,969 INFO L226 Difference]: Without dead ends: 628 [2020-01-16 19:06:46,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:46,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-01-16 19:06:46,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 384. [2020-01-16 19:06:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:06:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1319 transitions. [2020-01-16 19:06:46,978 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1319 transitions. Word has length 22 [2020-01-16 19:06:46,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:46,978 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1319 transitions. [2020-01-16 19:06:46,978 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1319 transitions. [2020-01-16 19:06:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:46,979 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:46,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, 1, 1, 1] [2020-01-16 19:06:46,979 INFO L426 AbstractCegarLoop]: === Iteration 1165 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:46,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:46,979 INFO L82 PathProgramCache]: Analyzing trace with hash -715595964, now seen corresponding path program 1159 times [2020-01-16 19:06:46,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:46,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205581150] [2020-01-16 19:06:46,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:47,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205581150] [2020-01-16 19:06:47,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:47,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:47,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348392727] [2020-01-16 19:06:47,229 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:47,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:47,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:47,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:47,229 INFO L87 Difference]: Start difference. First operand 384 states and 1319 transitions. Second operand 9 states. [2020-01-16 19:06:47,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:47,311 INFO L93 Difference]: Finished difference Result 644 states and 1894 transitions. [2020-01-16 19:06:47,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:47,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:47,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:47,312 INFO L225 Difference]: With dead ends: 644 [2020-01-16 19:06:47,313 INFO L226 Difference]: Without dead ends: 628 [2020-01-16 19:06:47,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:47,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-01-16 19:06:47,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 390. [2020-01-16 19:06:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:06:47,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1333 transitions. [2020-01-16 19:06:47,321 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1333 transitions. Word has length 22 [2020-01-16 19:06:47,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:47,321 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1333 transitions. [2020-01-16 19:06:47,322 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:47,322 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1333 transitions. [2020-01-16 19:06:47,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:47,322 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:47,322 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:47,322 INFO L426 AbstractCegarLoop]: === Iteration 1166 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:47,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:47,322 INFO L82 PathProgramCache]: Analyzing trace with hash -588959590, now seen corresponding path program 1160 times [2020-01-16 19:06:47,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:47,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314224486] [2020-01-16 19:06:47,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:47,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314224486] [2020-01-16 19:06:47,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:47,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:47,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698413107] [2020-01-16 19:06:47,583 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:47,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:47,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:47,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:47,583 INFO L87 Difference]: Start difference. First operand 390 states and 1333 transitions. Second operand 9 states. [2020-01-16 19:06:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:47,689 INFO L93 Difference]: Finished difference Result 638 states and 1880 transitions. [2020-01-16 19:06:47,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:47,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:47,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:47,691 INFO L225 Difference]: With dead ends: 638 [2020-01-16 19:06:47,691 INFO L226 Difference]: Without dead ends: 625 [2020-01-16 19:06:47,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-01-16 19:06:47,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 387. [2020-01-16 19:06:47,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:06:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1326 transitions. [2020-01-16 19:06:47,701 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1326 transitions. Word has length 22 [2020-01-16 19:06:47,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:47,701 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1326 transitions. [2020-01-16 19:06:47,701 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:47,701 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1326 transitions. [2020-01-16 19:06:47,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:47,702 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:47,702 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:47,702 INFO L426 AbstractCegarLoop]: === Iteration 1167 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:47,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:47,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1791307120, now seen corresponding path program 1161 times [2020-01-16 19:06:47,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:47,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346490075] [2020-01-16 19:06:47,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:47,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346490075] [2020-01-16 19:06:47,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:47,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:47,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726296612] [2020-01-16 19:06:47,968 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:47,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:47,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:47,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:47,969 INFO L87 Difference]: Start difference. First operand 387 states and 1326 transitions. Second operand 9 states. [2020-01-16 19:06:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:48,047 INFO L93 Difference]: Finished difference Result 640 states and 1887 transitions. [2020-01-16 19:06:48,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:48,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:48,048 INFO L225 Difference]: With dead ends: 640 [2020-01-16 19:06:48,049 INFO L226 Difference]: Without dead ends: 624 [2020-01-16 19:06:48,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:48,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-01-16 19:06:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 392. [2020-01-16 19:06:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:06:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1334 transitions. [2020-01-16 19:06:48,058 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1334 transitions. Word has length 22 [2020-01-16 19:06:48,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:48,058 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1334 transitions. [2020-01-16 19:06:48,058 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1334 transitions. [2020-01-16 19:06:48,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:48,059 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:48,059 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:48,059 INFO L426 AbstractCegarLoop]: === Iteration 1168 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:48,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:48,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1899806566, now seen corresponding path program 1162 times [2020-01-16 19:06:48,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:48,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156697000] [2020-01-16 19:06:48,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:48,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-01-16 19:06:48,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156697000] [2020-01-16 19:06:48,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:48,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:48,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461976533] [2020-01-16 19:06:48,316 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:48,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:48,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:48,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:48,316 INFO L87 Difference]: Start difference. First operand 392 states and 1334 transitions. Second operand 9 states. [2020-01-16 19:06:48,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:48,441 INFO L93 Difference]: Finished difference Result 627 states and 1867 transitions. [2020-01-16 19:06:48,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:48,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:48,443 INFO L225 Difference]: With dead ends: 627 [2020-01-16 19:06:48,443 INFO L226 Difference]: Without dead ends: 610 [2020-01-16 19:06:48,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-01-16 19:06:48,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 387. [2020-01-16 19:06:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:06:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1323 transitions. [2020-01-16 19:06:48,452 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1323 transitions. Word has length 22 [2020-01-16 19:06:48,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:48,452 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1323 transitions. [2020-01-16 19:06:48,452 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1323 transitions. [2020-01-16 19:06:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:48,452 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:48,452 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:48,453 INFO L426 AbstractCegarLoop]: === Iteration 1169 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:48,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:48,453 INFO L82 PathProgramCache]: Analyzing trace with hash 484125790, now seen corresponding path program 1163 times [2020-01-16 19:06:48,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:48,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742100507] [2020-01-16 19:06:48,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:48,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-01-16 19:06:48,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742100507] [2020-01-16 19:06:48,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:48,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:48,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973846988] [2020-01-16 19:06:48,714 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:48,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:48,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:48,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:48,715 INFO L87 Difference]: Start difference. First operand 387 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:06:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:48,816 INFO L93 Difference]: Finished difference Result 631 states and 1865 transitions. [2020-01-16 19:06:48,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:48,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:48,818 INFO L225 Difference]: With dead ends: 631 [2020-01-16 19:06:48,818 INFO L226 Difference]: Without dead ends: 621 [2020-01-16 19:06:48,819 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:48,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-01-16 19:06:48,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 389. [2020-01-16 19:06:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:06:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1326 transitions. [2020-01-16 19:06:48,828 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1326 transitions. Word has length 22 [2020-01-16 19:06:48,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:48,828 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1326 transitions. [2020-01-16 19:06:48,828 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1326 transitions. [2020-01-16 19:06:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:48,829 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:48,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, 1, 1, 1] [2020-01-16 19:06:48,829 INFO L426 AbstractCegarLoop]: === Iteration 1170 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:48,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:48,829 INFO L82 PathProgramCache]: Analyzing trace with hash 310878098, now seen corresponding path program 1164 times [2020-01-16 19:06:48,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:48,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328334604] [2020-01-16 19:06:48,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:49,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328334604] [2020-01-16 19:06:49,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:49,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:49,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006149660] [2020-01-16 19:06:49,073 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:49,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:49,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:49,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:49,073 INFO L87 Difference]: Start difference. First operand 389 states and 1326 transitions. Second operand 9 states. [2020-01-16 19:06:49,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:49,198 INFO L93 Difference]: Finished difference Result 624 states and 1859 transitions. [2020-01-16 19:06:49,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:49,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:49,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:49,200 INFO L225 Difference]: With dead ends: 624 [2020-01-16 19:06:49,200 INFO L226 Difference]: Without dead ends: 607 [2020-01-16 19:06:49,200 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:49,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-01-16 19:06:49,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 384. [2020-01-16 19:06:49,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:06:49,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1316 transitions. [2020-01-16 19:06:49,210 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1316 transitions. Word has length 22 [2020-01-16 19:06:49,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:49,210 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1316 transitions. [2020-01-16 19:06:49,210 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:49,210 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1316 transitions. [2020-01-16 19:06:49,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:49,211 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:49,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, 1, 1, 1] [2020-01-16 19:06:49,211 INFO L426 AbstractCegarLoop]: === Iteration 1171 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:49,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:49,211 INFO L82 PathProgramCache]: Analyzing trace with hash -789117692, now seen corresponding path program 1165 times [2020-01-16 19:06:49,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:49,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622039322] [2020-01-16 19:06:49,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:49,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-01-16 19:06:49,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622039322] [2020-01-16 19:06:49,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:49,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:49,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395431673] [2020-01-16 19:06:49,481 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:49,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:49,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:49,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:49,482 INFO L87 Difference]: Start difference. First operand 384 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:06:49,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:49,560 INFO L93 Difference]: Finished difference Result 662 states and 1936 transitions. [2020-01-16 19:06:49,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:49,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:49,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:49,562 INFO L225 Difference]: With dead ends: 662 [2020-01-16 19:06:49,562 INFO L226 Difference]: Without dead ends: 646 [2020-01-16 19:06:49,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:49,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-01-16 19:06:49,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 398. [2020-01-16 19:06:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-01-16 19:06:49,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1349 transitions. [2020-01-16 19:06:49,572 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1349 transitions. Word has length 22 [2020-01-16 19:06:49,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:49,572 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 1349 transitions. [2020-01-16 19:06:49,572 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:49,572 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1349 transitions. [2020-01-16 19:06:49,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:49,573 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:49,573 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:49,573 INFO L426 AbstractCegarLoop]: === Iteration 1172 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:49,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:49,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1438563284, now seen corresponding path program 1166 times [2020-01-16 19:06:49,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:49,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126313708] [2020-01-16 19:06:49,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:49,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-01-16 19:06:49,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126313708] [2020-01-16 19:06:49,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:49,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:49,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960108903] [2020-01-16 19:06:49,858 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:49,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:49,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:49,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:49,858 INFO L87 Difference]: Start difference. First operand 398 states and 1349 transitions. Second operand 9 states. [2020-01-16 19:06:49,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:49,961 INFO L93 Difference]: Finished difference Result 660 states and 1926 transitions. [2020-01-16 19:06:49,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:49,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:49,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:49,962 INFO L225 Difference]: With dead ends: 660 [2020-01-16 19:06:49,963 INFO L226 Difference]: Without dead ends: 638 [2020-01-16 19:06:49,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:49,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-01-16 19:06:49,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 390. [2020-01-16 19:06:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:06:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1330 transitions. [2020-01-16 19:06:49,972 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1330 transitions. Word has length 22 [2020-01-16 19:06:49,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:49,972 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1330 transitions. [2020-01-16 19:06:49,972 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:49,972 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1330 transitions. [2020-01-16 19:06:49,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:49,973 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:49,973 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:49,973 INFO L426 AbstractCegarLoop]: === Iteration 1173 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:49,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:49,973 INFO L82 PathProgramCache]: Analyzing trace with hash 821823266, now seen corresponding path program 1167 times [2020-01-16 19:06:49,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:49,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026518804] [2020-01-16 19:06:49,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:50,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-01-16 19:06:50,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026518804] [2020-01-16 19:06:50,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:50,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:50,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590105938] [2020-01-16 19:06:50,239 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:50,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:50,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:50,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:50,240 INFO L87 Difference]: Start difference. First operand 390 states and 1330 transitions. Second operand 9 states. [2020-01-16 19:06:50,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:50,321 INFO L93 Difference]: Finished difference Result 649 states and 1905 transitions. [2020-01-16 19:06:50,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:50,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:50,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:50,323 INFO L225 Difference]: With dead ends: 649 [2020-01-16 19:06:50,323 INFO L226 Difference]: Without dead ends: 633 [2020-01-16 19:06:50,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:50,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-01-16 19:06:50,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 395. [2020-01-16 19:06:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:06:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1338 transitions. [2020-01-16 19:06:50,331 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1338 transitions. Word has length 22 [2020-01-16 19:06:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:50,332 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1338 transitions. [2020-01-16 19:06:50,332 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1338 transitions. [2020-01-16 19:06:50,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:50,332 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:50,332 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:50,332 INFO L426 AbstractCegarLoop]: === Iteration 1174 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:50,333 INFO L82 PathProgramCache]: Analyzing trace with hash 713323820, now seen corresponding path program 1168 times [2020-01-16 19:06:50,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:50,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130106908] [2020-01-16 19:06:50,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:50,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-01-16 19:06:50,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130106908] [2020-01-16 19:06:50,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:50,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:50,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697941664] [2020-01-16 19:06:50,598 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:50,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:50,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:50,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:50,599 INFO L87 Difference]: Start difference. First operand 395 states and 1338 transitions. Second operand 9 states. [2020-01-16 19:06:50,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:50,701 INFO L93 Difference]: Finished difference Result 636 states and 1885 transitions. [2020-01-16 19:06:50,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:50,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:50,702 INFO L225 Difference]: With dead ends: 636 [2020-01-16 19:06:50,703 INFO L226 Difference]: Without dead ends: 619 [2020-01-16 19:06:50,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:50,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-01-16 19:06:50,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 390. [2020-01-16 19:06:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:06:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1325 transitions. [2020-01-16 19:06:50,712 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1325 transitions. Word has length 22 [2020-01-16 19:06:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:50,712 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1325 transitions. [2020-01-16 19:06:50,712 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1325 transitions. [2020-01-16 19:06:50,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:50,712 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:50,713 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:50,713 INFO L426 AbstractCegarLoop]: === Iteration 1175 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:50,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:50,713 INFO L82 PathProgramCache]: Analyzing trace with hash 321408896, now seen corresponding path program 1169 times [2020-01-16 19:06:50,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:50,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334009247] [2020-01-16 19:06:50,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:50,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334009247] [2020-01-16 19:06:50,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:50,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:50,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027421530] [2020-01-16 19:06:50,968 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:50,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:50,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:50,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:50,968 INFO L87 Difference]: Start difference. First operand 390 states and 1325 transitions. Second operand 9 states. [2020-01-16 19:06:51,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:51,096 INFO L93 Difference]: Finished difference Result 646 states and 1895 transitions. [2020-01-16 19:06:51,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:51,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:51,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:51,098 INFO L225 Difference]: With dead ends: 646 [2020-01-16 19:06:51,098 INFO L226 Difference]: Without dead ends: 632 [2020-01-16 19:06:51,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:51,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-01-16 19:06:51,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 394. [2020-01-16 19:06:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:06:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1332 transitions. [2020-01-16 19:06:51,117 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1332 transitions. Word has length 22 [2020-01-16 19:06:51,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:51,117 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1332 transitions. [2020-01-16 19:06:51,118 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:51,118 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1332 transitions. [2020-01-16 19:06:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:51,118 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:51,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, 1, 1, 1] [2020-01-16 19:06:51,118 INFO L426 AbstractCegarLoop]: === Iteration 1176 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:51,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:51,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1180283426, now seen corresponding path program 1170 times [2020-01-16 19:06:51,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:51,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549149233] [2020-01-16 19:06:51,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:51,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-01-16 19:06:51,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549149233] [2020-01-16 19:06:51,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:51,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:51,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116001892] [2020-01-16 19:06:51,370 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:51,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:51,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:51,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:51,371 INFO L87 Difference]: Start difference. First operand 394 states and 1332 transitions. Second operand 9 states. [2020-01-16 19:06:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:51,474 INFO L93 Difference]: Finished difference Result 635 states and 1879 transitions. [2020-01-16 19:06:51,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:51,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:51,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:51,476 INFO L225 Difference]: With dead ends: 635 [2020-01-16 19:06:51,476 INFO L226 Difference]: Without dead ends: 613 [2020-01-16 19:06:51,476 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:51,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-01-16 19:06:51,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 384. [2020-01-16 19:06:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:06:51,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1312 transitions. [2020-01-16 19:06:51,485 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1312 transitions. Word has length 22 [2020-01-16 19:06:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:51,485 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1312 transitions. [2020-01-16 19:06:51,485 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:51,485 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1312 transitions. [2020-01-16 19:06:51,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:51,486 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:51,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, 1, 1, 1] [2020-01-16 19:06:51,486 INFO L426 AbstractCegarLoop]: === Iteration 1177 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:51,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:51,486 INFO L82 PathProgramCache]: Analyzing trace with hash -620468902, now seen corresponding path program 1171 times [2020-01-16 19:06:51,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:51,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874624089] [2020-01-16 19:06:51,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:51,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-01-16 19:06:51,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874624089] [2020-01-16 19:06:51,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:51,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:51,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030925165] [2020-01-16 19:06:51,714 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:51,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:51,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:51,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:51,715 INFO L87 Difference]: Start difference. First operand 384 states and 1312 transitions. Second operand 9 states. [2020-01-16 19:06:51,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:51,821 INFO L93 Difference]: Finished difference Result 631 states and 1863 transitions. [2020-01-16 19:06:51,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:51,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:51,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:51,823 INFO L225 Difference]: With dead ends: 631 [2020-01-16 19:06:51,823 INFO L226 Difference]: Without dead ends: 621 [2020-01-16 19:06:51,823 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:51,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-01-16 19:06:51,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 388. [2020-01-16 19:06:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:06:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1322 transitions. [2020-01-16 19:06:51,832 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1322 transitions. Word has length 22 [2020-01-16 19:06:51,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:51,832 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1322 transitions. [2020-01-16 19:06:51,832 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:51,832 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1322 transitions. [2020-01-16 19:06:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:51,833 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:51,833 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:51,833 INFO L426 AbstractCegarLoop]: === Iteration 1178 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:51,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:51,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1538419092, now seen corresponding path program 1172 times [2020-01-16 19:06:51,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:51,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100487625] [2020-01-16 19:06:51,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:52,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-01-16 19:06:52,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100487625] [2020-01-16 19:06:52,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:52,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:52,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025730749] [2020-01-16 19:06:52,060 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:52,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:52,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:52,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:52,061 INFO L87 Difference]: Start difference. First operand 388 states and 1322 transitions. Second operand 9 states. [2020-01-16 19:06:52,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:52,168 INFO L93 Difference]: Finished difference Result 635 states and 1869 transitions. [2020-01-16 19:06:52,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:52,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:52,170 INFO L225 Difference]: With dead ends: 635 [2020-01-16 19:06:52,170 INFO L226 Difference]: Without dead ends: 619 [2020-01-16 19:06:52,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:52,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-01-16 19:06:52,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 386. [2020-01-16 19:06:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:06:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1317 transitions. [2020-01-16 19:06:52,179 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1317 transitions. Word has length 22 [2020-01-16 19:06:52,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:52,179 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1317 transitions. [2020-01-16 19:06:52,179 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1317 transitions. [2020-01-16 19:06:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:52,180 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:52,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, 1, 1, 1] [2020-01-16 19:06:52,180 INFO L426 AbstractCegarLoop]: === Iteration 1179 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:52,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:52,180 INFO L82 PathProgramCache]: Analyzing trace with hash 990472056, now seen corresponding path program 1173 times [2020-01-16 19:06:52,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:52,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965513852] [2020-01-16 19:06:52,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:52,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965513852] [2020-01-16 19:06:52,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:52,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:52,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263077815] [2020-01-16 19:06:52,433 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:52,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:52,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:52,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:52,433 INFO L87 Difference]: Start difference. First operand 386 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:06:52,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:52,556 INFO L93 Difference]: Finished difference Result 627 states and 1854 transitions. [2020-01-16 19:06:52,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:52,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:52,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:52,558 INFO L225 Difference]: With dead ends: 627 [2020-01-16 19:06:52,558 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 19:06:52,559 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:52,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 19:06:52,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 388. [2020-01-16 19:06:52,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:06:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1320 transitions. [2020-01-16 19:06:52,567 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1320 transitions. Word has length 22 [2020-01-16 19:06:52,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:52,568 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1320 transitions. [2020-01-16 19:06:52,568 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:52,568 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1320 transitions. [2020-01-16 19:06:52,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:52,568 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:52,568 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:52,568 INFO L426 AbstractCegarLoop]: === Iteration 1180 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:52,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:52,569 INFO L82 PathProgramCache]: Analyzing trace with hash 817224364, now seen corresponding path program 1174 times [2020-01-16 19:06:52,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:52,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123274716] [2020-01-16 19:06:52,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:52,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:52,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123274716] [2020-01-16 19:06:52,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:52,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:52,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018852031] [2020-01-16 19:06:52,801 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:52,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:52,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:52,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:52,802 INFO L87 Difference]: Start difference. First operand 388 states and 1320 transitions. Second operand 9 states. [2020-01-16 19:06:52,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:52,908 INFO L93 Difference]: Finished difference Result 620 states and 1848 transitions. [2020-01-16 19:06:52,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:52,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:52,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:52,909 INFO L225 Difference]: With dead ends: 620 [2020-01-16 19:06:52,910 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 19:06:52,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:52,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 19:06:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 386. [2020-01-16 19:06:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:06:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1315 transitions. [2020-01-16 19:06:52,919 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1315 transitions. Word has length 22 [2020-01-16 19:06:52,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:52,919 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1315 transitions. [2020-01-16 19:06:52,919 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:52,919 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1315 transitions. [2020-01-16 19:06:52,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:52,920 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:52,920 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:52,920 INFO L426 AbstractCegarLoop]: === Iteration 1181 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:52,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:52,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1680837048, now seen corresponding path program 1175 times [2020-01-16 19:06:52,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:52,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429576682] [2020-01-16 19:06:52,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:53,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:53,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429576682] [2020-01-16 19:06:53,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:53,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:53,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337281723] [2020-01-16 19:06:53,154 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:53,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:53,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:53,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:53,155 INFO L87 Difference]: Start difference. First operand 386 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:06:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:53,281 INFO L93 Difference]: Finished difference Result 633 states and 1866 transitions. [2020-01-16 19:06:53,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:53,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:53,283 INFO L225 Difference]: With dead ends: 633 [2020-01-16 19:06:53,283 INFO L226 Difference]: Without dead ends: 619 [2020-01-16 19:06:53,284 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:53,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-01-16 19:06:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 390. [2020-01-16 19:06:53,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:06:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1322 transitions. [2020-01-16 19:06:53,293 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1322 transitions. Word has length 22 [2020-01-16 19:06:53,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:53,293 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1322 transitions. [2020-01-16 19:06:53,293 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:53,293 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1322 transitions. [2020-01-16 19:06:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:53,294 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:53,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, 1, 1, 1] [2020-01-16 19:06:53,294 INFO L426 AbstractCegarLoop]: === Iteration 1182 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:53,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:53,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1869427750, now seen corresponding path program 1176 times [2020-01-16 19:06:53,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:53,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544220463] [2020-01-16 19:06:53,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:53,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:53,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544220463] [2020-01-16 19:06:53,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:53,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:53,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348805242] [2020-01-16 19:06:53,528 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:53,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:53,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:53,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:53,529 INFO L87 Difference]: Start difference. First operand 390 states and 1322 transitions. Second operand 9 states. [2020-01-16 19:06:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:53,678 INFO L93 Difference]: Finished difference Result 622 states and 1850 transitions. [2020-01-16 19:06:53,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:53,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:53,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:53,680 INFO L225 Difference]: With dead ends: 622 [2020-01-16 19:06:53,680 INFO L226 Difference]: Without dead ends: 600 [2020-01-16 19:06:53,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:53,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-01-16 19:06:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 380. [2020-01-16 19:06:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:06:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1303 transitions. [2020-01-16 19:06:53,689 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1303 transitions. Word has length 22 [2020-01-16 19:06:53,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:53,689 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1303 transitions. [2020-01-16 19:06:53,689 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:53,689 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1303 transitions. [2020-01-16 19:06:53,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:53,690 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:53,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, 1, 1, 1] [2020-01-16 19:06:53,690 INFO L426 AbstractCegarLoop]: === Iteration 1183 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:53,690 INFO L82 PathProgramCache]: Analyzing trace with hash -752347456, now seen corresponding path program 1177 times [2020-01-16 19:06:53,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:53,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104754014] [2020-01-16 19:06:53,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:53,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104754014] [2020-01-16 19:06:53,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:53,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:53,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36559410] [2020-01-16 19:06:53,951 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:53,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:53,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:53,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:53,951 INFO L87 Difference]: Start difference. First operand 380 states and 1303 transitions. Second operand 9 states. [2020-01-16 19:06:54,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:54,071 INFO L93 Difference]: Finished difference Result 610 states and 1819 transitions. [2020-01-16 19:06:54,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:54,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:54,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:54,073 INFO L225 Difference]: With dead ends: 610 [2020-01-16 19:06:54,073 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 19:06:54,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:54,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 19:06:54,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 386. [2020-01-16 19:06:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:06:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1322 transitions. [2020-01-16 19:06:54,082 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1322 transitions. Word has length 22 [2020-01-16 19:06:54,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:54,082 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1322 transitions. [2020-01-16 19:06:54,082 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:54,082 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1322 transitions. [2020-01-16 19:06:54,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:54,083 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:54,083 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:54,083 INFO L426 AbstractCegarLoop]: === Iteration 1184 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:54,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:54,083 INFO L82 PathProgramCache]: Analyzing trace with hash 589585332, now seen corresponding path program 1178 times [2020-01-16 19:06:54,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:54,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728661173] [2020-01-16 19:06:54,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:54,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-01-16 19:06:54,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728661173] [2020-01-16 19:06:54,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:54,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:54,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861922060] [2020-01-16 19:06:54,341 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:54,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:54,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:54,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:54,341 INFO L87 Difference]: Start difference. First operand 386 states and 1322 transitions. Second operand 9 states. [2020-01-16 19:06:54,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:54,455 INFO L93 Difference]: Finished difference Result 609 states and 1815 transitions. [2020-01-16 19:06:54,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:54,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:54,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:54,457 INFO L225 Difference]: With dead ends: 609 [2020-01-16 19:06:54,457 INFO L226 Difference]: Without dead ends: 597 [2020-01-16 19:06:54,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:54,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-01-16 19:06:54,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 384. [2020-01-16 19:06:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:06:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-01-16 19:06:54,466 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-01-16 19:06:54,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:54,467 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-01-16 19:06:54,467 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-01-16 19:06:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:54,467 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:54,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, 1, 1, 1] [2020-01-16 19:06:54,467 INFO L426 AbstractCegarLoop]: === Iteration 1185 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:54,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:54,468 INFO L82 PathProgramCache]: Analyzing trace with hash 855967726, now seen corresponding path program 1179 times [2020-01-16 19:06:54,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:54,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697539902] [2020-01-16 19:06:54,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:54,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-01-16 19:06:54,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697539902] [2020-01-16 19:06:54,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:54,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:54,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806381558] [2020-01-16 19:06:54,724 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:54,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:54,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:54,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:54,725 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:06:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:54,831 INFO L93 Difference]: Finished difference Result 615 states and 1828 transitions. [2020-01-16 19:06:54,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:54,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:54,833 INFO L225 Difference]: With dead ends: 615 [2020-01-16 19:06:54,833 INFO L226 Difference]: Without dead ends: 604 [2020-01-16 19:06:54,833 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:54,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-01-16 19:06:54,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 387. [2020-01-16 19:06:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:06:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1322 transitions. [2020-01-16 19:06:54,842 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1322 transitions. Word has length 22 [2020-01-16 19:06:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:54,843 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1322 transitions. [2020-01-16 19:06:54,843 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:54,843 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1322 transitions. [2020-01-16 19:06:54,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:54,843 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:54,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, 1, 1, 1] [2020-01-16 19:06:54,843 INFO L426 AbstractCegarLoop]: === Iteration 1186 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:54,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:54,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1722527710, now seen corresponding path program 1180 times [2020-01-16 19:06:54,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:54,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257421915] [2020-01-16 19:06:54,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:55,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-01-16 19:06:55,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257421915] [2020-01-16 19:06:55,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:55,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:55,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994024916] [2020-01-16 19:06:55,109 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:55,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:55,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:55,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:55,109 INFO L87 Difference]: Start difference. First operand 387 states and 1322 transitions. Second operand 9 states. [2020-01-16 19:06:55,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:55,217 INFO L93 Difference]: Finished difference Result 618 states and 1831 transitions. [2020-01-16 19:06:55,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:55,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:55,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:55,219 INFO L225 Difference]: With dead ends: 618 [2020-01-16 19:06:55,219 INFO L226 Difference]: Without dead ends: 601 [2020-01-16 19:06:55,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:55,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-01-16 19:06:55,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 384. [2020-01-16 19:06:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:06:55,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1315 transitions. [2020-01-16 19:06:55,228 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1315 transitions. Word has length 22 [2020-01-16 19:06:55,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:55,229 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1315 transitions. [2020-01-16 19:06:55,229 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:55,229 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1315 transitions. [2020-01-16 19:06:55,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:55,229 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:55,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, 1, 1, 1] [2020-01-16 19:06:55,229 INFO L426 AbstractCegarLoop]: === Iteration 1187 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:55,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:55,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1124815134, now seen corresponding path program 1181 times [2020-01-16 19:06:55,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:55,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123608892] [2020-01-16 19:06:55,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:55,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-01-16 19:06:55,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123608892] [2020-01-16 19:06:55,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:55,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:55,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77351388] [2020-01-16 19:06:55,477 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:55,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:55,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:55,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:55,478 INFO L87 Difference]: Start difference. First operand 384 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:06:55,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:55,578 INFO L93 Difference]: Finished difference Result 612 states and 1819 transitions. [2020-01-16 19:06:55,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:55,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:55,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:55,579 INFO L225 Difference]: With dead ends: 612 [2020-01-16 19:06:55,579 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:06:55,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:55,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:06:55,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 386. [2020-01-16 19:06:55,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:06:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1318 transitions. [2020-01-16 19:06:55,588 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1318 transitions. Word has length 22 [2020-01-16 19:06:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:55,589 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1318 transitions. [2020-01-16 19:06:55,589 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1318 transitions. [2020-01-16 19:06:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:55,589 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:55,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, 1, 1, 1] [2020-01-16 19:06:55,589 INFO L426 AbstractCegarLoop]: === Iteration 1188 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:55,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:55,590 INFO L82 PathProgramCache]: Analyzing trace with hash 206864944, now seen corresponding path program 1182 times [2020-01-16 19:06:55,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:55,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388821274] [2020-01-16 19:06:55,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:55,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388821274] [2020-01-16 19:06:55,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:55,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:55,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480042431] [2020-01-16 19:06:55,845 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:55,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:55,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:55,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:55,845 INFO L87 Difference]: Start difference. First operand 386 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:06:55,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:55,952 INFO L93 Difference]: Finished difference Result 616 states and 1825 transitions. [2020-01-16 19:06:55,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:55,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:55,954 INFO L225 Difference]: With dead ends: 616 [2020-01-16 19:06:55,954 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:06:55,954 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:06:55,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 382. [2020-01-16 19:06:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:06:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1310 transitions. [2020-01-16 19:06:55,964 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1310 transitions. Word has length 22 [2020-01-16 19:06:55,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:55,964 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1310 transitions. [2020-01-16 19:06:55,964 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1310 transitions. [2020-01-16 19:06:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:55,965 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:55,965 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:55,965 INFO L426 AbstractCegarLoop]: === Iteration 1189 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:55,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:55,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1942181986, now seen corresponding path program 1183 times [2020-01-16 19:06:55,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:55,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701817630] [2020-01-16 19:06:55,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:56,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701817630] [2020-01-16 19:06:56,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:56,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:56,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095892897] [2020-01-16 19:06:56,227 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:56,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:56,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:56,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:56,227 INFO L87 Difference]: Start difference. First operand 382 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:06:56,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:56,334 INFO L93 Difference]: Finished difference Result 606 states and 1808 transitions. [2020-01-16 19:06:56,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:56,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:56,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:56,336 INFO L225 Difference]: With dead ends: 606 [2020-01-16 19:06:56,336 INFO L226 Difference]: Without dead ends: 595 [2020-01-16 19:06:56,336 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:56,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-01-16 19:06:56,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 386. [2020-01-16 19:06:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:06:56,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1320 transitions. [2020-01-16 19:06:56,355 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1320 transitions. Word has length 22 [2020-01-16 19:06:56,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:56,356 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1320 transitions. [2020-01-16 19:06:56,356 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1320 transitions. [2020-01-16 19:06:56,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:56,356 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:56,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, 1, 1, 1] [2020-01-16 19:06:56,356 INFO L426 AbstractCegarLoop]: === Iteration 1190 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:56,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:56,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1010852522, now seen corresponding path program 1184 times [2020-01-16 19:06:56,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:56,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543502593] [2020-01-16 19:06:56,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:56,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543502593] [2020-01-16 19:06:56,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:56,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:56,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094664741] [2020-01-16 19:06:56,627 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:56,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:56,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:56,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:56,628 INFO L87 Difference]: Start difference. First operand 386 states and 1320 transitions. Second operand 9 states. [2020-01-16 19:06:56,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:56,733 INFO L93 Difference]: Finished difference Result 605 states and 1804 transitions. [2020-01-16 19:06:56,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:56,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:56,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:56,735 INFO L225 Difference]: With dead ends: 605 [2020-01-16 19:06:56,735 INFO L226 Difference]: Without dead ends: 593 [2020-01-16 19:06:56,735 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:56,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-01-16 19:06:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 384. [2020-01-16 19:06:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:06:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1315 transitions. [2020-01-16 19:06:56,744 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1315 transitions. Word has length 22 [2020-01-16 19:06:56,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:56,744 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1315 transitions. [2020-01-16 19:06:56,744 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1315 transitions. [2020-01-16 19:06:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:56,745 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:56,745 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:56,745 INFO L426 AbstractCegarLoop]: === Iteration 1191 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:56,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:56,745 INFO L82 PathProgramCache]: Analyzing trace with hash 866470830, now seen corresponding path program 1185 times [2020-01-16 19:06:56,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:56,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097883002] [2020-01-16 19:06:56,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:57,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097883002] [2020-01-16 19:06:57,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:57,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:57,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061516682] [2020-01-16 19:06:57,009 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:57,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:57,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:57,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:57,009 INFO L87 Difference]: Start difference. First operand 384 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:06:57,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:57,122 INFO L93 Difference]: Finished difference Result 606 states and 1808 transitions. [2020-01-16 19:06:57,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:57,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:57,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:57,124 INFO L225 Difference]: With dead ends: 606 [2020-01-16 19:06:57,124 INFO L226 Difference]: Without dead ends: 595 [2020-01-16 19:06:57,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:57,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-01-16 19:06:57,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 387. [2020-01-16 19:06:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:06:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1320 transitions. [2020-01-16 19:06:57,132 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1320 transitions. Word has length 22 [2020-01-16 19:06:57,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:57,132 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1320 transitions. [2020-01-16 19:06:57,132 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:57,133 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1320 transitions. [2020-01-16 19:06:57,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:57,133 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:57,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, 1, 1, 1] [2020-01-16 19:06:57,133 INFO L426 AbstractCegarLoop]: === Iteration 1192 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:57,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:57,133 INFO L82 PathProgramCache]: Analyzing trace with hash -961927330, now seen corresponding path program 1186 times [2020-01-16 19:06:57,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:57,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160119753] [2020-01-16 19:06:57,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:57,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160119753] [2020-01-16 19:06:57,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:57,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:57,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128512974] [2020-01-16 19:06:57,395 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:57,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:57,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:57,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:57,396 INFO L87 Difference]: Start difference. First operand 387 states and 1320 transitions. Second operand 9 states. [2020-01-16 19:06:57,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:57,515 INFO L93 Difference]: Finished difference Result 598 states and 1799 transitions. [2020-01-16 19:06:57,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:57,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:57,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:57,517 INFO L225 Difference]: With dead ends: 598 [2020-01-16 19:06:57,517 INFO L226 Difference]: Without dead ends: 583 [2020-01-16 19:06:57,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:57,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-01-16 19:06:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 384. [2020-01-16 19:06:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:06:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1313 transitions. [2020-01-16 19:06:57,525 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1313 transitions. Word has length 22 [2020-01-16 19:06:57,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:57,525 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1313 transitions. [2020-01-16 19:06:57,526 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1313 transitions. [2020-01-16 19:06:57,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:57,526 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:57,526 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:57,526 INFO L426 AbstractCegarLoop]: === Iteration 1193 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:57,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:57,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1135318238, now seen corresponding path program 1187 times [2020-01-16 19:06:57,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:57,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514586104] [2020-01-16 19:06:57,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:57,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-01-16 19:06:57,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514586104] [2020-01-16 19:06:57,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:57,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:57,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176653110] [2020-01-16 19:06:57,792 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:57,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:57,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:57,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:57,792 INFO L87 Difference]: Start difference. First operand 384 states and 1313 transitions. Second operand 9 states. [2020-01-16 19:06:57,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:57,904 INFO L93 Difference]: Finished difference Result 604 states and 1801 transitions. [2020-01-16 19:06:57,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:57,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:57,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:57,906 INFO L225 Difference]: With dead ends: 604 [2020-01-16 19:06:57,906 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:06:57,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:57,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:06:57,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 386. [2020-01-16 19:06:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:06:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1316 transitions. [2020-01-16 19:06:57,915 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1316 transitions. Word has length 22 [2020-01-16 19:06:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:57,915 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1316 transitions. [2020-01-16 19:06:57,916 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:57,916 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1316 transitions. [2020-01-16 19:06:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:57,916 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:57,916 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:57,916 INFO L426 AbstractCegarLoop]: === Iteration 1194 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:57,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:57,917 INFO L82 PathProgramCache]: Analyzing trace with hash 962070546, now seen corresponding path program 1188 times [2020-01-16 19:06:57,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:57,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989783129] [2020-01-16 19:06:57,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:58,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989783129] [2020-01-16 19:06:58,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:58,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:58,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538971458] [2020-01-16 19:06:58,174 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:58,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:58,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:58,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:58,174 INFO L87 Difference]: Start difference. First operand 386 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:06:58,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:58,278 INFO L93 Difference]: Finished difference Result 597 states and 1795 transitions. [2020-01-16 19:06:58,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:58,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:58,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:58,280 INFO L225 Difference]: With dead ends: 597 [2020-01-16 19:06:58,280 INFO L226 Difference]: Without dead ends: 581 [2020-01-16 19:06:58,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:58,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-01-16 19:06:58,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 382. [2020-01-16 19:06:58,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:06:58,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1308 transitions. [2020-01-16 19:06:58,289 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1308 transitions. Word has length 22 [2020-01-16 19:06:58,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:58,289 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1308 transitions. [2020-01-16 19:06:58,289 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:58,289 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1308 transitions. [2020-01-16 19:06:58,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:58,290 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:58,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, 1, 1, 1] [2020-01-16 19:06:58,290 INFO L426 AbstractCegarLoop]: === Iteration 1195 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:58,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:58,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1868660258, now seen corresponding path program 1189 times [2020-01-16 19:06:58,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:58,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880534819] [2020-01-16 19:06:58,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:58,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-01-16 19:06:58,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880534819] [2020-01-16 19:06:58,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:58,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:58,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589399055] [2020-01-16 19:06:58,544 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:58,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:58,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:58,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:58,545 INFO L87 Difference]: Start difference. First operand 382 states and 1308 transitions. Second operand 9 states. [2020-01-16 19:06:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:58,649 INFO L93 Difference]: Finished difference Result 618 states and 1835 transitions. [2020-01-16 19:06:58,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:58,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:58,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:58,651 INFO L225 Difference]: With dead ends: 618 [2020-01-16 19:06:58,651 INFO L226 Difference]: Without dead ends: 607 [2020-01-16 19:06:58,651 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:58,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-01-16 19:06:58,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 388. [2020-01-16 19:06:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:06:58,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1324 transitions. [2020-01-16 19:06:58,659 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1324 transitions. Word has length 22 [2020-01-16 19:06:58,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:58,660 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1324 transitions. [2020-01-16 19:06:58,660 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1324 transitions. [2020-01-16 19:06:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:58,660 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:58,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:58,660 INFO L426 AbstractCegarLoop]: === Iteration 1196 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:58,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:58,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1559747054, now seen corresponding path program 1190 times [2020-01-16 19:06:58,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:58,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675412197] [2020-01-16 19:06:58,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:58,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-01-16 19:06:58,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675412197] [2020-01-16 19:06:58,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:58,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:58,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383004339] [2020-01-16 19:06:58,913 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:58,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:58,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:58,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:58,914 INFO L87 Difference]: Start difference. First operand 388 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:06:59,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:59,017 INFO L93 Difference]: Finished difference Result 621 states and 1838 transitions. [2020-01-16 19:06:59,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:59,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:59,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:59,019 INFO L225 Difference]: With dead ends: 621 [2020-01-16 19:06:59,019 INFO L226 Difference]: Without dead ends: 604 [2020-01-16 19:06:59,019 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:59,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-01-16 19:06:59,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 385. [2020-01-16 19:06:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:06:59,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1316 transitions. [2020-01-16 19:06:59,027 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1316 transitions. Word has length 22 [2020-01-16 19:06:59,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:59,027 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1316 transitions. [2020-01-16 19:06:59,027 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1316 transitions. [2020-01-16 19:06:59,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:59,028 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:59,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:59,028 INFO L426 AbstractCegarLoop]: === Iteration 1197 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:59,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:59,028 INFO L82 PathProgramCache]: Analyzing trace with hash -815366080, now seen corresponding path program 1191 times [2020-01-16 19:06:59,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:59,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835147258] [2020-01-16 19:06:59,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:59,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-01-16 19:06:59,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835147258] [2020-01-16 19:06:59,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:59,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:59,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955449190] [2020-01-16 19:06:59,300 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:59,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:59,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:59,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:59,300 INFO L87 Difference]: Start difference. First operand 385 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:06:59,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:59,430 INFO L93 Difference]: Finished difference Result 613 states and 1823 transitions. [2020-01-16 19:06:59,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:59,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:59,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:59,432 INFO L225 Difference]: With dead ends: 613 [2020-01-16 19:06:59,432 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:06:59,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:59,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:06:59,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 388. [2020-01-16 19:06:59,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:06:59,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1321 transitions. [2020-01-16 19:06:59,440 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1321 transitions. Word has length 22 [2020-01-16 19:06:59,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:59,440 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1321 transitions. [2020-01-16 19:06:59,440 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:59,440 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1321 transitions. [2020-01-16 19:06:59,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:59,441 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:59,441 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:59,441 INFO L426 AbstractCegarLoop]: === Iteration 1198 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:59,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:59,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1651203056, now seen corresponding path program 1192 times [2020-01-16 19:06:59,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:59,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601846025] [2020-01-16 19:06:59,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:06:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:06:59,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601846025] [2020-01-16 19:06:59,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:06:59,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:06:59,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192748079] [2020-01-16 19:06:59,708 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:06:59,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:06:59,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:06:59,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:06:59,709 INFO L87 Difference]: Start difference. First operand 388 states and 1321 transitions. Second operand 9 states. [2020-01-16 19:06:59,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:06:59,814 INFO L93 Difference]: Finished difference Result 605 states and 1814 transitions. [2020-01-16 19:06:59,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:06:59,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:06:59,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:06:59,816 INFO L225 Difference]: With dead ends: 605 [2020-01-16 19:06:59,816 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 19:06:59,816 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:06:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 19:06:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 385. [2020-01-16 19:06:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:06:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1313 transitions. [2020-01-16 19:06:59,825 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1313 transitions. Word has length 22 [2020-01-16 19:06:59,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:06:59,825 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1313 transitions. [2020-01-16 19:06:59,825 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:06:59,825 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1313 transitions. [2020-01-16 19:06:59,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:06:59,826 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:06:59,826 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:06:59,826 INFO L426 AbstractCegarLoop]: === Iteration 1199 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:06:59,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:06:59,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1889452130, now seen corresponding path program 1193 times [2020-01-16 19:06:59,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:06:59,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226068005] [2020-01-16 19:06:59,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:06:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:00,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226068005] [2020-01-16 19:07:00,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:00,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:00,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924587758] [2020-01-16 19:07:00,075 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:00,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:00,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:00,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:00,076 INFO L87 Difference]: Start difference. First operand 385 states and 1313 transitions. Second operand 9 states. [2020-01-16 19:07:00,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:00,187 INFO L93 Difference]: Finished difference Result 617 states and 1829 transitions. [2020-01-16 19:07:00,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:00,187 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:00,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:00,188 INFO L225 Difference]: With dead ends: 617 [2020-01-16 19:07:00,189 INFO L226 Difference]: Without dead ends: 603 [2020-01-16 19:07:00,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-01-16 19:07:00,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 389. [2020-01-16 19:07:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:07:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1320 transitions. [2020-01-16 19:07:00,198 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1320 transitions. Word has length 22 [2020-01-16 19:07:00,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:00,198 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1320 transitions. [2020-01-16 19:07:00,198 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1320 transitions. [2020-01-16 19:07:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:00,199 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:00,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, 1, 1, 1] [2020-01-16 19:07:00,199 INFO L426 AbstractCegarLoop]: === Iteration 1200 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:00,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:00,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1550208512, now seen corresponding path program 1194 times [2020-01-16 19:07:00,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:00,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099552893] [2020-01-16 19:07:00,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:00,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-01-16 19:07:00,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099552893] [2020-01-16 19:07:00,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:00,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:00,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350314392] [2020-01-16 19:07:00,450 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:00,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:00,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:00,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:00,450 INFO L87 Difference]: Start difference. First operand 389 states and 1320 transitions. Second operand 9 states. [2020-01-16 19:07:00,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:00,581 INFO L93 Difference]: Finished difference Result 606 states and 1813 transitions. [2020-01-16 19:07:00,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:00,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:00,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:00,583 INFO L225 Difference]: With dead ends: 606 [2020-01-16 19:07:00,583 INFO L226 Difference]: Without dead ends: 587 [2020-01-16 19:07:00,583 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:00,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-01-16 19:07:00,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 382. [2020-01-16 19:07:00,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:00,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1306 transitions. [2020-01-16 19:07:00,591 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1306 transitions. Word has length 22 [2020-01-16 19:07:00,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:00,591 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1306 transitions. [2020-01-16 19:07:00,592 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:00,592 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1306 transitions. [2020-01-16 19:07:00,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:00,592 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:00,592 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:00,592 INFO L426 AbstractCegarLoop]: === Iteration 1201 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:00,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:00,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1063368042, now seen corresponding path program 1195 times [2020-01-16 19:07:00,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:00,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603400614] [2020-01-16 19:07:00,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:00,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:00,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603400614] [2020-01-16 19:07:00,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:00,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:00,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357846085] [2020-01-16 19:07:00,828 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:00,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:00,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:00,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:00,829 INFO L87 Difference]: Start difference. First operand 382 states and 1306 transitions. Second operand 9 states. [2020-01-16 19:07:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:00,928 INFO L93 Difference]: Finished difference Result 612 states and 1817 transitions. [2020-01-16 19:07:00,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:00,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:00,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:00,930 INFO L225 Difference]: With dead ends: 612 [2020-01-16 19:07:00,930 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:07:00,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:07:00,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 386. [2020-01-16 19:07:00,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:07:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1316 transitions. [2020-01-16 19:07:00,939 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1316 transitions. Word has length 22 [2020-01-16 19:07:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:00,939 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1316 transitions. [2020-01-16 19:07:00,939 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1316 transitions. [2020-01-16 19:07:00,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:00,939 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:00,939 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:00,940 INFO L426 AbstractCegarLoop]: === Iteration 1202 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:00,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:00,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1981318232, now seen corresponding path program 1196 times [2020-01-16 19:07:00,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:00,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621017001] [2020-01-16 19:07:00,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:01,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621017001] [2020-01-16 19:07:01,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:01,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:01,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105005749] [2020-01-16 19:07:01,174 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:01,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:01,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:01,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:01,174 INFO L87 Difference]: Start difference. First operand 386 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:07:01,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:01,276 INFO L93 Difference]: Finished difference Result 616 states and 1823 transitions. [2020-01-16 19:07:01,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:01,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:01,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:01,278 INFO L225 Difference]: With dead ends: 616 [2020-01-16 19:07:01,278 INFO L226 Difference]: Without dead ends: 600 [2020-01-16 19:07:01,279 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-01-16 19:07:01,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 384. [2020-01-16 19:07:01,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:07:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1311 transitions. [2020-01-16 19:07:01,287 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1311 transitions. Word has length 22 [2020-01-16 19:07:01,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:01,287 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1311 transitions. [2020-01-16 19:07:01,287 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1311 transitions. [2020-01-16 19:07:01,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:01,288 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:01,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, 1, 1, 1] [2020-01-16 19:07:01,288 INFO L426 AbstractCegarLoop]: === Iteration 1203 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:01,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:01,288 INFO L82 PathProgramCache]: Analyzing trace with hash 547572916, now seen corresponding path program 1197 times [2020-01-16 19:07:01,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:01,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990238547] [2020-01-16 19:07:01,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:01,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:01,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990238547] [2020-01-16 19:07:01,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:01,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:01,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697537011] [2020-01-16 19:07:01,523 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:01,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:01,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:01,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:01,523 INFO L87 Difference]: Start difference. First operand 384 states and 1311 transitions. Second operand 9 states. [2020-01-16 19:07:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:01,624 INFO L93 Difference]: Finished difference Result 608 states and 1808 transitions. [2020-01-16 19:07:01,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:01,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:01,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:01,626 INFO L225 Difference]: With dead ends: 608 [2020-01-16 19:07:01,626 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:07:01,626 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:01,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:07:01,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 386. [2020-01-16 19:07:01,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:07:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1314 transitions. [2020-01-16 19:07:01,635 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1314 transitions. Word has length 22 [2020-01-16 19:07:01,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:01,635 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1314 transitions. [2020-01-16 19:07:01,636 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1314 transitions. [2020-01-16 19:07:01,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:01,636 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:01,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, 1, 1, 1] [2020-01-16 19:07:01,636 INFO L426 AbstractCegarLoop]: === Iteration 1204 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:01,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:01,636 INFO L82 PathProgramCache]: Analyzing trace with hash 374325224, now seen corresponding path program 1198 times [2020-01-16 19:07:01,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:01,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788496329] [2020-01-16 19:07:01,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:01,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788496329] [2020-01-16 19:07:01,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:01,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:01,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73322277] [2020-01-16 19:07:01,872 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:01,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:01,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:01,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:01,873 INFO L87 Difference]: Start difference. First operand 386 states and 1314 transitions. Second operand 9 states. [2020-01-16 19:07:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:01,974 INFO L93 Difference]: Finished difference Result 601 states and 1802 transitions. [2020-01-16 19:07:01,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:01,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:01,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:01,975 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:07:01,976 INFO L226 Difference]: Without dead ends: 587 [2020-01-16 19:07:01,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-01-16 19:07:01,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 384. [2020-01-16 19:07:01,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:07:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1309 transitions. [2020-01-16 19:07:01,985 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1309 transitions. Word has length 22 [2020-01-16 19:07:01,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:01,985 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1309 transitions. [2020-01-16 19:07:01,985 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1309 transitions. [2020-01-16 19:07:01,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:01,986 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:01,986 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:01,986 INFO L426 AbstractCegarLoop]: === Iteration 1205 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:01,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:01,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1237937908, now seen corresponding path program 1199 times [2020-01-16 19:07:01,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:01,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837433137] [2020-01-16 19:07:01,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:02,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-01-16 19:07:02,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837433137] [2020-01-16 19:07:02,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:02,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:02,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053939568] [2020-01-16 19:07:02,230 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:02,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:02,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:02,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:02,230 INFO L87 Difference]: Start difference. First operand 384 states and 1309 transitions. Second operand 9 states. [2020-01-16 19:07:02,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:02,334 INFO L93 Difference]: Finished difference Result 614 states and 1820 transitions. [2020-01-16 19:07:02,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:02,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:02,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:02,336 INFO L225 Difference]: With dead ends: 614 [2020-01-16 19:07:02,336 INFO L226 Difference]: Without dead ends: 600 [2020-01-16 19:07:02,336 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-01-16 19:07:02,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 388. [2020-01-16 19:07:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:07:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1316 transitions. [2020-01-16 19:07:02,344 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1316 transitions. Word has length 22 [2020-01-16 19:07:02,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:02,345 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1316 transitions. [2020-01-16 19:07:02,345 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1316 transitions. [2020-01-16 19:07:02,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:02,345 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:02,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, 1, 1, 1] [2020-01-16 19:07:02,345 INFO L426 AbstractCegarLoop]: === Iteration 1206 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:02,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:02,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1982640406, now seen corresponding path program 1200 times [2020-01-16 19:07:02,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:02,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972050612] [2020-01-16 19:07:02,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:02,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-01-16 19:07:02,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972050612] [2020-01-16 19:07:02,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:02,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:02,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839744257] [2020-01-16 19:07:02,576 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:02,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:02,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:02,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:02,577 INFO L87 Difference]: Start difference. First operand 388 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:07:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:02,682 INFO L93 Difference]: Finished difference Result 603 states and 1804 transitions. [2020-01-16 19:07:02,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:02,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:02,684 INFO L225 Difference]: With dead ends: 603 [2020-01-16 19:07:02,684 INFO L226 Difference]: Without dead ends: 579 [2020-01-16 19:07:02,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:02,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-01-16 19:07:02,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 376. [2020-01-16 19:07:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:07:02,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1295 transitions. [2020-01-16 19:07:02,693 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1295 transitions. Word has length 22 [2020-01-16 19:07:02,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:02,693 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1295 transitions. [2020-01-16 19:07:02,693 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:02,693 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1295 transitions. [2020-01-16 19:07:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:02,694 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:02,694 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:02,694 INFO L426 AbstractCegarLoop]: === Iteration 1207 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:02,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:02,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1290117892, now seen corresponding path program 1201 times [2020-01-16 19:07:02,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:02,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646485634] [2020-01-16 19:07:02,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:02,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646485634] [2020-01-16 19:07:02,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:02,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:02,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655969574] [2020-01-16 19:07:02,954 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:02,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:02,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:02,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:02,955 INFO L87 Difference]: Start difference. First operand 376 states and 1295 transitions. Second operand 9 states. [2020-01-16 19:07:03,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:03,031 INFO L93 Difference]: Finished difference Result 602 states and 1759 transitions. [2020-01-16 19:07:03,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:03,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:03,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:03,032 INFO L225 Difference]: With dead ends: 602 [2020-01-16 19:07:03,033 INFO L226 Difference]: Without dead ends: 586 [2020-01-16 19:07:03,033 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:03,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-01-16 19:07:03,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 386. [2020-01-16 19:07:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:07:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1328 transitions. [2020-01-16 19:07:03,041 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1328 transitions. Word has length 22 [2020-01-16 19:07:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:03,041 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1328 transitions. [2020-01-16 19:07:03,041 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:03,041 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1328 transitions. [2020-01-16 19:07:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:03,042 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:03,042 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:03,042 INFO L426 AbstractCegarLoop]: === Iteration 1208 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:03,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:03,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1851186384, now seen corresponding path program 1202 times [2020-01-16 19:07:03,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:03,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906941184] [2020-01-16 19:07:03,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:03,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-01-16 19:07:03,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906941184] [2020-01-16 19:07:03,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:03,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:03,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997956525] [2020-01-16 19:07:03,308 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:03,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:03,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:03,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:03,309 INFO L87 Difference]: Start difference. First operand 386 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:07:03,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:03,387 INFO L93 Difference]: Finished difference Result 595 states and 1744 transitions. [2020-01-16 19:07:03,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:03,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:03,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:03,389 INFO L225 Difference]: With dead ends: 595 [2020-01-16 19:07:03,389 INFO L226 Difference]: Without dead ends: 584 [2020-01-16 19:07:03,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:03,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-01-16 19:07:03,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 384. [2020-01-16 19:07:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:07:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1324 transitions. [2020-01-16 19:07:03,399 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1324 transitions. Word has length 22 [2020-01-16 19:07:03,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:03,399 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1324 transitions. [2020-01-16 19:07:03,399 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:03,399 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1324 transitions. [2020-01-16 19:07:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:03,400 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:03,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, 1, 1, 1] [2020-01-16 19:07:03,400 INFO L426 AbstractCegarLoop]: === Iteration 1209 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:03,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:03,400 INFO L82 PathProgramCache]: Analyzing trace with hash -310319962, now seen corresponding path program 1203 times [2020-01-16 19:07:03,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:03,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203254095] [2020-01-16 19:07:03,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:03,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:03,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203254095] [2020-01-16 19:07:03,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:03,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:03,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549721922] [2020-01-16 19:07:03,667 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:03,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:03,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:03,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:03,668 INFO L87 Difference]: Start difference. First operand 384 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:07:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:03,745 INFO L93 Difference]: Finished difference Result 604 states and 1762 transitions. [2020-01-16 19:07:03,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:03,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:03,747 INFO L225 Difference]: With dead ends: 604 [2020-01-16 19:07:03,747 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 19:07:03,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:03,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 19:07:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 387. [2020-01-16 19:07:03,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:07:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1328 transitions. [2020-01-16 19:07:03,755 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1328 transitions. Word has length 22 [2020-01-16 19:07:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:03,756 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1328 transitions. [2020-01-16 19:07:03,756 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1328 transitions. [2020-01-16 19:07:03,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:03,756 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:03,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, 1, 1, 1] [2020-01-16 19:07:03,756 INFO L426 AbstractCegarLoop]: === Iteration 1210 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:03,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:03,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1272523624, now seen corresponding path program 1204 times [2020-01-16 19:07:03,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:03,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533374338] [2020-01-16 19:07:03,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:04,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533374338] [2020-01-16 19:07:04,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:04,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:04,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492193225] [2020-01-16 19:07:04,013 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:04,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:04,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:04,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:04,013 INFO L87 Difference]: Start difference. First operand 387 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:07:04,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:04,132 INFO L93 Difference]: Finished difference Result 598 states and 1748 transitions. [2020-01-16 19:07:04,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:04,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:04,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:04,133 INFO L225 Difference]: With dead ends: 598 [2020-01-16 19:07:04,134 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 19:07:04,134 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:04,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 19:07:04,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 384. [2020-01-16 19:07:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:07:04,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1322 transitions. [2020-01-16 19:07:04,142 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1322 transitions. Word has length 22 [2020-01-16 19:07:04,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:04,143 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1322 transitions. [2020-01-16 19:07:04,143 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1322 transitions. [2020-01-16 19:07:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:04,143 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:04,143 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:04,143 INFO L426 AbstractCegarLoop]: === Iteration 1211 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:04,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:04,143 INFO L82 PathProgramCache]: Analyzing trace with hash -255597736, now seen corresponding path program 1205 times [2020-01-16 19:07:04,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:04,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955612826] [2020-01-16 19:07:04,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:04,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955612826] [2020-01-16 19:07:04,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:04,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:04,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789430242] [2020-01-16 19:07:04,423 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:04,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:04,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:04,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:04,423 INFO L87 Difference]: Start difference. First operand 384 states and 1322 transitions. Second operand 9 states. [2020-01-16 19:07:04,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:04,509 INFO L93 Difference]: Finished difference Result 588 states and 1729 transitions. [2020-01-16 19:07:04,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:04,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:04,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:04,511 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:07:04,511 INFO L226 Difference]: Without dead ends: 579 [2020-01-16 19:07:04,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:04,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-01-16 19:07:04,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 385. [2020-01-16 19:07:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:07:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1323 transitions. [2020-01-16 19:07:04,521 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1323 transitions. Word has length 22 [2020-01-16 19:07:04,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:04,521 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1323 transitions. [2020-01-16 19:07:04,521 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:04,521 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1323 transitions. [2020-01-16 19:07:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:04,522 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:04,522 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:04,522 INFO L426 AbstractCegarLoop]: === Iteration 1212 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:04,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:04,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1355343222, now seen corresponding path program 1206 times [2020-01-16 19:07:04,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:04,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351598734] [2020-01-16 19:07:04,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:04,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351598734] [2020-01-16 19:07:04,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:04,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:04,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183082429] [2020-01-16 19:07:04,795 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:04,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:04,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:04,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:04,795 INFO L87 Difference]: Start difference. First operand 385 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:07:04,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:04,899 INFO L93 Difference]: Finished difference Result 589 states and 1730 transitions. [2020-01-16 19:07:04,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:04,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:04,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:04,901 INFO L225 Difference]: With dead ends: 589 [2020-01-16 19:07:04,901 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:07:04,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:04,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:07:04,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 382. [2020-01-16 19:07:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1318 transitions. [2020-01-16 19:07:04,910 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1318 transitions. Word has length 22 [2020-01-16 19:07:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:04,910 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1318 transitions. [2020-01-16 19:07:04,910 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1318 transitions. [2020-01-16 19:07:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:04,911 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:04,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:04,911 INFO L426 AbstractCegarLoop]: === Iteration 1213 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:04,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:04,911 INFO L82 PathProgramCache]: Analyzing trace with hash 692781234, now seen corresponding path program 1207 times [2020-01-16 19:07:04,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:04,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841575366] [2020-01-16 19:07:04,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:05,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-01-16 19:07:05,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841575366] [2020-01-16 19:07:05,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:05,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:05,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423230092] [2020-01-16 19:07:05,183 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:05,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:05,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:05,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:05,183 INFO L87 Difference]: Start difference. First operand 382 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:07:05,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:05,270 INFO L93 Difference]: Finished difference Result 612 states and 1780 transitions. [2020-01-16 19:07:05,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:05,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:05,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:05,272 INFO L225 Difference]: With dead ends: 612 [2020-01-16 19:07:05,272 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 19:07:05,272 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:05,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 19:07:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 387. [2020-01-16 19:07:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:07:05,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1328 transitions. [2020-01-16 19:07:05,281 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1328 transitions. Word has length 22 [2020-01-16 19:07:05,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:05,281 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1328 transitions. [2020-01-16 19:07:05,281 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:05,281 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1328 transitions. [2020-01-16 19:07:05,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:05,281 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:05,281 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:05,282 INFO L426 AbstractCegarLoop]: === Iteration 1214 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:05,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:05,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1253849726, now seen corresponding path program 1208 times [2020-01-16 19:07:05,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:05,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489320446] [2020-01-16 19:07:05,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:05,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-01-16 19:07:05,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489320446] [2020-01-16 19:07:05,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:05,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:05,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875137544] [2020-01-16 19:07:05,547 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:05,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:05,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:05,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:05,547 INFO L87 Difference]: Start difference. First operand 387 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:07:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:05,623 INFO L93 Difference]: Finished difference Result 605 states and 1765 transitions. [2020-01-16 19:07:05,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:05,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:05,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:05,625 INFO L225 Difference]: With dead ends: 605 [2020-01-16 19:07:05,625 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:07:05,625 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:05,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:07:05,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 385. [2020-01-16 19:07:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:07:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1324 transitions. [2020-01-16 19:07:05,634 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1324 transitions. Word has length 22 [2020-01-16 19:07:05,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:05,634 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1324 transitions. [2020-01-16 19:07:05,634 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1324 transitions. [2020-01-16 19:07:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:05,634 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:05,634 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:05,635 INFO L426 AbstractCegarLoop]: === Iteration 1215 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:05,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:05,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1705473766, now seen corresponding path program 1209 times [2020-01-16 19:07:05,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:05,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094364684] [2020-01-16 19:07:05,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:05,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-01-16 19:07:05,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094364684] [2020-01-16 19:07:05,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:05,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:05,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291351154] [2020-01-16 19:07:05,940 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:05,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:05,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:05,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:05,941 INFO L87 Difference]: Start difference. First operand 385 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:07:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:06,017 INFO L93 Difference]: Finished difference Result 623 states and 1804 transitions. [2020-01-16 19:07:06,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:06,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:06,019 INFO L225 Difference]: With dead ends: 623 [2020-01-16 19:07:06,019 INFO L226 Difference]: Without dead ends: 607 [2020-01-16 19:07:06,019 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:06,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-01-16 19:07:06,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 393. [2020-01-16 19:07:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:07:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1337 transitions. [2020-01-16 19:07:06,028 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1337 transitions. Word has length 22 [2020-01-16 19:07:06,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:06,029 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1337 transitions. [2020-01-16 19:07:06,029 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:06,029 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1337 transitions. [2020-01-16 19:07:06,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:06,029 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:06,029 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:06,029 INFO L426 AbstractCegarLoop]: === Iteration 1216 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:06,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:06,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1575503320, now seen corresponding path program 1210 times [2020-01-16 19:07:06,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:06,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464164091] [2020-01-16 19:07:06,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:06,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-01-16 19:07:06,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464164091] [2020-01-16 19:07:06,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:06,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:06,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422659723] [2020-01-16 19:07:06,309 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:06,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:06,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:06,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:06,310 INFO L87 Difference]: Start difference. First operand 393 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:07:06,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:06,410 INFO L93 Difference]: Finished difference Result 621 states and 1794 transitions. [2020-01-16 19:07:06,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:06,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:06,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:06,411 INFO L225 Difference]: With dead ends: 621 [2020-01-16 19:07:06,412 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 19:07:06,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:06,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 19:07:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 385. [2020-01-16 19:07:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:07:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1321 transitions. [2020-01-16 19:07:06,421 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1321 transitions. Word has length 22 [2020-01-16 19:07:06,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:06,421 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1321 transitions. [2020-01-16 19:07:06,421 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:06,421 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1321 transitions. [2020-01-16 19:07:06,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:06,422 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:06,422 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:06,422 INFO L426 AbstractCegarLoop]: === Iteration 1217 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:06,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:06,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1760195992, now seen corresponding path program 1211 times [2020-01-16 19:07:06,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:06,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635737771] [2020-01-16 19:07:06,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:06,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635737771] [2020-01-16 19:07:06,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:06,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:06,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612381910] [2020-01-16 19:07:06,690 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:06,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:06,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:06,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:06,690 INFO L87 Difference]: Start difference. First operand 385 states and 1321 transitions. Second operand 9 states. [2020-01-16 19:07:06,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:06,766 INFO L93 Difference]: Finished difference Result 602 states and 1757 transitions. [2020-01-16 19:07:06,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:06,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:06,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:06,767 INFO L225 Difference]: With dead ends: 602 [2020-01-16 19:07:06,768 INFO L226 Difference]: Without dead ends: 593 [2020-01-16 19:07:06,768 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-01-16 19:07:06,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 386. [2020-01-16 19:07:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:07:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1322 transitions. [2020-01-16 19:07:06,777 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1322 transitions. Word has length 22 [2020-01-16 19:07:06,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:06,778 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1322 transitions. [2020-01-16 19:07:06,778 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1322 transitions. [2020-01-16 19:07:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:06,778 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:06,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, 1, 1, 1] [2020-01-16 19:07:06,778 INFO L426 AbstractCegarLoop]: === Iteration 1218 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:06,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:06,779 INFO L82 PathProgramCache]: Analyzing trace with hash 684484836, now seen corresponding path program 1212 times [2020-01-16 19:07:06,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:06,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337074958] [2020-01-16 19:07:06,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:07,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337074958] [2020-01-16 19:07:07,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:07,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:07,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533164401] [2020-01-16 19:07:07,043 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:07,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:07,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:07,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:07,043 INFO L87 Difference]: Start difference. First operand 386 states and 1322 transitions. Second operand 9 states. [2020-01-16 19:07:07,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:07,147 INFO L93 Difference]: Finished difference Result 607 states and 1766 transitions. [2020-01-16 19:07:07,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:07,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:07,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:07,149 INFO L225 Difference]: With dead ends: 607 [2020-01-16 19:07:07,149 INFO L226 Difference]: Without dead ends: 589 [2020-01-16 19:07:07,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:07,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-01-16 19:07:07,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 382. [2020-01-16 19:07:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:07,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1315 transitions. [2020-01-16 19:07:07,159 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1315 transitions. Word has length 22 [2020-01-16 19:07:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:07,159 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1315 transitions. [2020-01-16 19:07:07,159 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1315 transitions. [2020-01-16 19:07:07,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:07,159 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:07,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, 1, 1, 1] [2020-01-16 19:07:07,159 INFO L426 AbstractCegarLoop]: === Iteration 1219 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:07,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:07,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1018377458, now seen corresponding path program 1213 times [2020-01-16 19:07:07,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:07,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552272086] [2020-01-16 19:07:07,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:07,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552272086] [2020-01-16 19:07:07,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:07,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:07,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835660165] [2020-01-16 19:07:07,420 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:07,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:07,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:07,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:07,421 INFO L87 Difference]: Start difference. First operand 382 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:07:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:07,498 INFO L93 Difference]: Finished difference Result 618 states and 1794 transitions. [2020-01-16 19:07:07,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:07,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:07,500 INFO L225 Difference]: With dead ends: 618 [2020-01-16 19:07:07,500 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:07:07,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:07,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:07:07,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 389. [2020-01-16 19:07:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:07:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1331 transitions. [2020-01-16 19:07:07,510 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1331 transitions. Word has length 22 [2020-01-16 19:07:07,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:07,511 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1331 transitions. [2020-01-16 19:07:07,511 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:07,511 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1331 transitions. [2020-01-16 19:07:07,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:07,511 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:07,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, 1, 1, 1] [2020-01-16 19:07:07,511 INFO L426 AbstractCegarLoop]: === Iteration 1220 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:07,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:07,512 INFO L82 PathProgramCache]: Analyzing trace with hash 56173796, now seen corresponding path program 1214 times [2020-01-16 19:07:07,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:07,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833289481] [2020-01-16 19:07:07,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:07,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833289481] [2020-01-16 19:07:07,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:07,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:07,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78289643] [2020-01-16 19:07:07,780 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:07,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:07,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:07,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:07,780 INFO L87 Difference]: Start difference. First operand 389 states and 1331 transitions. Second operand 9 states. [2020-01-16 19:07:07,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:07,887 INFO L93 Difference]: Finished difference Result 612 states and 1780 transitions. [2020-01-16 19:07:07,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:07,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:07,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:07,889 INFO L225 Difference]: With dead ends: 612 [2020-01-16 19:07:07,889 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 19:07:07,889 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 19:07:07,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 386. [2020-01-16 19:07:07,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:07:07,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1324 transitions. [2020-01-16 19:07:07,899 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1324 transitions. Word has length 22 [2020-01-16 19:07:07,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:07,899 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1324 transitions. [2020-01-16 19:07:07,899 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:07,899 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1324 transitions. [2020-01-16 19:07:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:07,899 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:07,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:07,900 INFO L426 AbstractCegarLoop]: === Iteration 1221 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:07,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:07,900 INFO L82 PathProgramCache]: Analyzing trace with hash -663459452, now seen corresponding path program 1215 times [2020-01-16 19:07:07,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:07,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337035547] [2020-01-16 19:07:07,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:08,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-01-16 19:07:08,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337035547] [2020-01-16 19:07:08,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:08,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:08,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079652451] [2020-01-16 19:07:08,182 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:08,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:08,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:08,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:08,183 INFO L87 Difference]: Start difference. First operand 386 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:07:08,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:08,258 INFO L93 Difference]: Finished difference Result 627 states and 1812 transitions. [2020-01-16 19:07:08,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:08,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:08,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:08,260 INFO L225 Difference]: With dead ends: 627 [2020-01-16 19:07:08,260 INFO L226 Difference]: Without dead ends: 611 [2020-01-16 19:07:08,261 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:08,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-01-16 19:07:08,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 394. [2020-01-16 19:07:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:07:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1337 transitions. [2020-01-16 19:07:08,270 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1337 transitions. Word has length 22 [2020-01-16 19:07:08,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:08,270 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1337 transitions. [2020-01-16 19:07:08,270 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1337 transitions. [2020-01-16 19:07:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:08,271 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:08,271 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:08,271 INFO L426 AbstractCegarLoop]: === Iteration 1222 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:08,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:08,271 INFO L82 PathProgramCache]: Analyzing trace with hash -793429898, now seen corresponding path program 1216 times [2020-01-16 19:07:08,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:08,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895109921] [2020-01-16 19:07:08,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:08,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:08,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895109921] [2020-01-16 19:07:08,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:08,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:08,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417207261] [2020-01-16 19:07:08,543 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:08,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:08,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:08,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:08,544 INFO L87 Difference]: Start difference. First operand 394 states and 1337 transitions. Second operand 9 states. [2020-01-16 19:07:08,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:08,648 INFO L93 Difference]: Finished difference Result 625 states and 1802 transitions. [2020-01-16 19:07:08,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:08,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:08,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:08,650 INFO L225 Difference]: With dead ends: 625 [2020-01-16 19:07:08,650 INFO L226 Difference]: Without dead ends: 603 [2020-01-16 19:07:08,651 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:08,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-01-16 19:07:08,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 386. [2020-01-16 19:07:08,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:07:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1320 transitions. [2020-01-16 19:07:08,659 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1320 transitions. Word has length 22 [2020-01-16 19:07:08,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:08,660 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1320 transitions. [2020-01-16 19:07:08,660 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:08,660 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1320 transitions. [2020-01-16 19:07:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:08,660 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:08,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:08,660 INFO L426 AbstractCegarLoop]: === Iteration 1223 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:08,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:08,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1557821440, now seen corresponding path program 1217 times [2020-01-16 19:07:08,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:08,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257934260] [2020-01-16 19:07:08,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:08,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:08,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257934260] [2020-01-16 19:07:08,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:08,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:08,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336818753] [2020-01-16 19:07:08,938 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:08,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:08,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:08,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:08,938 INFO L87 Difference]: Start difference. First operand 386 states and 1320 transitions. Second operand 9 states. [2020-01-16 19:07:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:09,043 INFO L93 Difference]: Finished difference Result 609 states and 1771 transitions. [2020-01-16 19:07:09,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:09,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:09,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:09,045 INFO L225 Difference]: With dead ends: 609 [2020-01-16 19:07:09,045 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 19:07:09,045 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:09,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 19:07:09,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 388. [2020-01-16 19:07:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:07:09,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1323 transitions. [2020-01-16 19:07:09,061 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1323 transitions. Word has length 22 [2020-01-16 19:07:09,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:09,061 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1323 transitions. [2020-01-16 19:07:09,061 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1323 transitions. [2020-01-16 19:07:09,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:09,061 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:09,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, 1, 1, 1] [2020-01-16 19:07:09,062 INFO L426 AbstractCegarLoop]: === Iteration 1224 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:09,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:09,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1819195666, now seen corresponding path program 1218 times [2020-01-16 19:07:09,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:09,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094111737] [2020-01-16 19:07:09,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:09,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-01-16 19:07:09,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094111737] [2020-01-16 19:07:09,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:09,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:09,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406396532] [2020-01-16 19:07:09,336 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:09,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:09,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:09,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:09,336 INFO L87 Difference]: Start difference. First operand 388 states and 1323 transitions. Second operand 9 states. [2020-01-16 19:07:09,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:09,445 INFO L93 Difference]: Finished difference Result 613 states and 1777 transitions. [2020-01-16 19:07:09,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:09,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:09,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:09,447 INFO L225 Difference]: With dead ends: 613 [2020-01-16 19:07:09,447 INFO L226 Difference]: Without dead ends: 593 [2020-01-16 19:07:09,448 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-01-16 19:07:09,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 382. [2020-01-16 19:07:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:09,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1312 transitions. [2020-01-16 19:07:09,457 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1312 transitions. Word has length 22 [2020-01-16 19:07:09,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:09,457 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1312 transitions. [2020-01-16 19:07:09,457 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1312 transitions. [2020-01-16 19:07:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:09,457 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:09,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, 1, 1, 1] [2020-01-16 19:07:09,457 INFO L426 AbstractCegarLoop]: === Iteration 1225 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:09,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:09,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1738732674, now seen corresponding path program 1219 times [2020-01-16 19:07:09,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:09,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926912856] [2020-01-16 19:07:09,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:09,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926912856] [2020-01-16 19:07:09,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:09,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:09,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089149187] [2020-01-16 19:07:09,747 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:09,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:09,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:09,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:09,747 INFO L87 Difference]: Start difference. First operand 382 states and 1312 transitions. Second operand 9 states. [2020-01-16 19:07:09,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:09,830 INFO L93 Difference]: Finished difference Result 583 states and 1715 transitions. [2020-01-16 19:07:09,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:09,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:09,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:09,832 INFO L225 Difference]: With dead ends: 583 [2020-01-16 19:07:09,832 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:07:09,832 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:09,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:07:09,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 384. [2020-01-16 19:07:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:07:09,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1316 transitions. [2020-01-16 19:07:09,840 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1316 transitions. Word has length 22 [2020-01-16 19:07:09,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:09,841 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1316 transitions. [2020-01-16 19:07:09,841 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:09,841 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1316 transitions. [2020-01-16 19:07:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:09,841 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:09,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, 1, 1, 1] [2020-01-16 19:07:09,841 INFO L426 AbstractCegarLoop]: === Iteration 1226 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:09,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:09,842 INFO L82 PathProgramCache]: Analyzing trace with hash -127791716, now seen corresponding path program 1220 times [2020-01-16 19:07:09,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:09,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949594084] [2020-01-16 19:07:09,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:10,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-01-16 19:07:10,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949594084] [2020-01-16 19:07:10,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:10,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:10,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984212696] [2020-01-16 19:07:10,122 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:10,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:10,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:10,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:10,122 INFO L87 Difference]: Start difference. First operand 384 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:07:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:10,226 INFO L93 Difference]: Finished difference Result 584 states and 1716 transitions. [2020-01-16 19:07:10,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:10,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:10,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:10,227 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:07:10,227 INFO L226 Difference]: Without dead ends: 573 [2020-01-16 19:07:10,228 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:10,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-01-16 19:07:10,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 383. [2020-01-16 19:07:10,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:07:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1314 transitions. [2020-01-16 19:07:10,237 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1314 transitions. Word has length 22 [2020-01-16 19:07:10,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:10,237 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1314 transitions. [2020-01-16 19:07:10,237 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:10,237 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1314 transitions. [2020-01-16 19:07:10,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:10,238 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:10,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, 1, 1, 1] [2020-01-16 19:07:10,238 INFO L426 AbstractCegarLoop]: === Iteration 1227 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:10,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:10,238 INFO L82 PathProgramCache]: Analyzing trace with hash 874397712, now seen corresponding path program 1221 times [2020-01-16 19:07:10,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:10,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304970251] [2020-01-16 19:07:10,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:10,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304970251] [2020-01-16 19:07:10,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:10,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:10,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968376706] [2020-01-16 19:07:10,514 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:10,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:10,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:10,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:10,514 INFO L87 Difference]: Start difference. First operand 383 states and 1314 transitions. Second operand 9 states. [2020-01-16 19:07:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:10,591 INFO L93 Difference]: Finished difference Result 587 states and 1722 transitions. [2020-01-16 19:07:10,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:10,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:10,592 INFO L225 Difference]: With dead ends: 587 [2020-01-16 19:07:10,593 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:07:10,593 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:10,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:07:10,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 384. [2020-01-16 19:07:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:07:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1315 transitions. [2020-01-16 19:07:10,602 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1315 transitions. Word has length 22 [2020-01-16 19:07:10,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:10,602 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1315 transitions. [2020-01-16 19:07:10,602 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:10,602 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1315 transitions. [2020-01-16 19:07:10,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:10,603 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:10,603 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:10,603 INFO L426 AbstractCegarLoop]: === Iteration 1228 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:10,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:10,603 INFO L82 PathProgramCache]: Analyzing trace with hash -201313444, now seen corresponding path program 1222 times [2020-01-16 19:07:10,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:10,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852631576] [2020-01-16 19:07:10,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:10,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:10,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852631576] [2020-01-16 19:07:10,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:10,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:10,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693750402] [2020-01-16 19:07:10,866 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:10,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:10,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:10,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:10,867 INFO L87 Difference]: Start difference. First operand 384 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:07:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:10,977 INFO L93 Difference]: Finished difference Result 592 states and 1731 transitions. [2020-01-16 19:07:10,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:10,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:10,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:10,979 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:07:10,979 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:07:10,979 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:07:10,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 383. [2020-01-16 19:07:10,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:07:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1313 transitions. [2020-01-16 19:07:10,988 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1313 transitions. Word has length 22 [2020-01-16 19:07:10,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:10,988 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1313 transitions. [2020-01-16 19:07:10,988 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1313 transitions. [2020-01-16 19:07:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:10,988 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:10,988 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:10,988 INFO L426 AbstractCegarLoop]: === Iteration 1229 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:10,989 INFO L82 PathProgramCache]: Analyzing trace with hash 884900816, now seen corresponding path program 1223 times [2020-01-16 19:07:10,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:10,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86744736] [2020-01-16 19:07:10,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:11,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-01-16 19:07:11,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86744736] [2020-01-16 19:07:11,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:11,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:11,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106768629] [2020-01-16 19:07:11,246 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:11,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:11,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:11,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:11,247 INFO L87 Difference]: Start difference. First operand 383 states and 1313 transitions. Second operand 9 states. [2020-01-16 19:07:11,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:11,349 INFO L93 Difference]: Finished difference Result 590 states and 1728 transitions. [2020-01-16 19:07:11,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:11,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:11,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:11,350 INFO L225 Difference]: With dead ends: 590 [2020-01-16 19:07:11,350 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:07:11,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:11,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:07:11,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 385. [2020-01-16 19:07:11,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:07:11,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1316 transitions. [2020-01-16 19:07:11,360 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1316 transitions. Word has length 22 [2020-01-16 19:07:11,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:11,360 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1316 transitions. [2020-01-16 19:07:11,360 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:11,360 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1316 transitions. [2020-01-16 19:07:11,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:11,361 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:11,361 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:11,361 INFO L426 AbstractCegarLoop]: === Iteration 1230 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:11,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:11,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1801751298, now seen corresponding path program 1224 times [2020-01-16 19:07:11,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:11,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720494684] [2020-01-16 19:07:11,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:11,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720494684] [2020-01-16 19:07:11,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:11,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:11,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310876940] [2020-01-16 19:07:11,624 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:11,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:11,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:11,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:11,625 INFO L87 Difference]: Start difference. First operand 385 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:07:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:11,725 INFO L93 Difference]: Finished difference Result 594 states and 1734 transitions. [2020-01-16 19:07:11,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:11,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:11,727 INFO L225 Difference]: With dead ends: 594 [2020-01-16 19:07:11,727 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:07:11,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:07:11,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 379. [2020-01-16 19:07:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:07:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1306 transitions. [2020-01-16 19:07:11,736 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1306 transitions. Word has length 22 [2020-01-16 19:07:11,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:11,737 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1306 transitions. [2020-01-16 19:07:11,737 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1306 transitions. [2020-01-16 19:07:11,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:11,737 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:11,737 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:11,737 INFO L426 AbstractCegarLoop]: === Iteration 1231 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:11,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:11,737 INFO L82 PathProgramCache]: Analyzing trace with hash 867632166, now seen corresponding path program 1225 times [2020-01-16 19:07:11,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:11,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607053000] [2020-01-16 19:07:11,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:11,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-01-16 19:07:11,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607053000] [2020-01-16 19:07:11,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:11,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:11,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277857830] [2020-01-16 19:07:11,998 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:11,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:11,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:11,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:11,998 INFO L87 Difference]: Start difference. First operand 379 states and 1306 transitions. Second operand 9 states. [2020-01-16 19:07:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:12,076 INFO L93 Difference]: Finished difference Result 592 states and 1732 transitions. [2020-01-16 19:07:12,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:12,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:12,078 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:07:12,078 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:07:12,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:12,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:07:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 385. [2020-01-16 19:07:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:07:12,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1322 transitions. [2020-01-16 19:07:12,088 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1322 transitions. Word has length 22 [2020-01-16 19:07:12,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:12,088 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1322 transitions. [2020-01-16 19:07:12,088 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:12,088 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1322 transitions. [2020-01-16 19:07:12,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:12,089 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:12,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, 1, 1, 1] [2020-01-16 19:07:12,089 INFO L426 AbstractCegarLoop]: === Iteration 1232 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:12,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:12,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1428700658, now seen corresponding path program 1226 times [2020-01-16 19:07:12,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:12,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804022672] [2020-01-16 19:07:12,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:12,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-01-16 19:07:12,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804022672] [2020-01-16 19:07:12,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:12,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:12,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745931741] [2020-01-16 19:07:12,352 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:12,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:12,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:12,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:12,352 INFO L87 Difference]: Start difference. First operand 385 states and 1322 transitions. Second operand 9 states. [2020-01-16 19:07:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:12,432 INFO L93 Difference]: Finished difference Result 585 states and 1717 transitions. [2020-01-16 19:07:12,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:12,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:12,434 INFO L225 Difference]: With dead ends: 585 [2020-01-16 19:07:12,434 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:07:12,434 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:07:12,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 383. [2020-01-16 19:07:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:07:12,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1318 transitions. [2020-01-16 19:07:12,443 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1318 transitions. Word has length 22 [2020-01-16 19:07:12,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:12,444 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1318 transitions. [2020-01-16 19:07:12,444 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1318 transitions. [2020-01-16 19:07:12,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:12,444 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:12,444 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:12,444 INFO L426 AbstractCegarLoop]: === Iteration 1233 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:12,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:12,445 INFO L82 PathProgramCache]: Analyzing trace with hash -732805688, now seen corresponding path program 1227 times [2020-01-16 19:07:12,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:12,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626188321] [2020-01-16 19:07:12,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:12,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-01-16 19:07:12,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626188321] [2020-01-16 19:07:12,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:12,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:12,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120558121] [2020-01-16 19:07:12,718 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:12,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:12,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:12,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:12,718 INFO L87 Difference]: Start difference. First operand 383 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:07:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:12,795 INFO L93 Difference]: Finished difference Result 594 states and 1735 transitions. [2020-01-16 19:07:12,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:12,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:12,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:12,797 INFO L225 Difference]: With dead ends: 594 [2020-01-16 19:07:12,797 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:07:12,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:07:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 386. [2020-01-16 19:07:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:07:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1322 transitions. [2020-01-16 19:07:12,805 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1322 transitions. Word has length 22 [2020-01-16 19:07:12,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:12,805 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1322 transitions. [2020-01-16 19:07:12,805 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:12,805 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1322 transitions. [2020-01-16 19:07:12,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:12,806 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:12,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, 1, 1, 1] [2020-01-16 19:07:12,806 INFO L426 AbstractCegarLoop]: === Iteration 1234 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:12,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:12,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1695009350, now seen corresponding path program 1228 times [2020-01-16 19:07:12,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:12,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181219939] [2020-01-16 19:07:12,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:13,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181219939] [2020-01-16 19:07:13,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:13,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:13,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159991854] [2020-01-16 19:07:13,066 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:13,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:13,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:13,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:13,066 INFO L87 Difference]: Start difference. First operand 386 states and 1322 transitions. Second operand 9 states. [2020-01-16 19:07:13,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:13,171 INFO L93 Difference]: Finished difference Result 588 states and 1721 transitions. [2020-01-16 19:07:13,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:13,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:13,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:13,172 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:07:13,172 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:07:13,173 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:13,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:07:13,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 383. [2020-01-16 19:07:13,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:07:13,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1316 transitions. [2020-01-16 19:07:13,181 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1316 transitions. Word has length 22 [2020-01-16 19:07:13,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:13,181 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1316 transitions. [2020-01-16 19:07:13,181 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1316 transitions. [2020-01-16 19:07:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:13,182 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:13,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, 1, 1, 1] [2020-01-16 19:07:13,182 INFO L426 AbstractCegarLoop]: === Iteration 1235 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:13,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:13,182 INFO L82 PathProgramCache]: Analyzing trace with hash -678083462, now seen corresponding path program 1229 times [2020-01-16 19:07:13,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:13,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366761743] [2020-01-16 19:07:13,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:13,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-01-16 19:07:13,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366761743] [2020-01-16 19:07:13,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:13,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:13,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016373309] [2020-01-16 19:07:13,464 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:13,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:13,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:13,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:13,465 INFO L87 Difference]: Start difference. First operand 383 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:07:13,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:13,544 INFO L93 Difference]: Finished difference Result 578 states and 1702 transitions. [2020-01-16 19:07:13,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:13,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:13,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:13,545 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:07:13,545 INFO L226 Difference]: Without dead ends: 569 [2020-01-16 19:07:13,546 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-01-16 19:07:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 384. [2020-01-16 19:07:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:07:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-01-16 19:07:13,554 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-01-16 19:07:13,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:13,554 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-01-16 19:07:13,554 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:13,554 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-01-16 19:07:13,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:13,555 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:13,555 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:13,555 INFO L426 AbstractCegarLoop]: === Iteration 1236 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:13,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:13,555 INFO L82 PathProgramCache]: Analyzing trace with hash 932857496, now seen corresponding path program 1230 times [2020-01-16 19:07:13,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:13,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783680767] [2020-01-16 19:07:13,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:13,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-01-16 19:07:13,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783680767] [2020-01-16 19:07:13,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:13,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:13,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72803627] [2020-01-16 19:07:13,840 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:13,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:13,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:13,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:13,840 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:07:13,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:13,943 INFO L93 Difference]: Finished difference Result 579 states and 1703 transitions. [2020-01-16 19:07:13,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:13,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:13,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:13,944 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:07:13,945 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:07:13,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:13,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:07:13,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 381. [2020-01-16 19:07:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:07:13,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1312 transitions. [2020-01-16 19:07:13,954 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1312 transitions. Word has length 22 [2020-01-16 19:07:13,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:13,954 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1312 transitions. [2020-01-16 19:07:13,954 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:13,954 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1312 transitions. [2020-01-16 19:07:13,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:13,955 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:13,955 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:13,955 INFO L426 AbstractCegarLoop]: === Iteration 1237 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:13,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:13,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2098637710, now seen corresponding path program 1231 times [2020-01-16 19:07:13,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:13,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216246492] [2020-01-16 19:07:13,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:14,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-01-16 19:07:14,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216246492] [2020-01-16 19:07:14,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:14,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:14,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014802388] [2020-01-16 19:07:14,223 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:14,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:14,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:14,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:14,223 INFO L87 Difference]: Start difference. First operand 381 states and 1312 transitions. Second operand 9 states. [2020-01-16 19:07:14,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:14,316 INFO L93 Difference]: Finished difference Result 594 states and 1736 transitions. [2020-01-16 19:07:14,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:14,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:14,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:14,317 INFO L225 Difference]: With dead ends: 594 [2020-01-16 19:07:14,318 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:07:14,318 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:14,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:07:14,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 385. [2020-01-16 19:07:14,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:07:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1320 transitions. [2020-01-16 19:07:14,326 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1320 transitions. Word has length 22 [2020-01-16 19:07:14,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:14,326 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1320 transitions. [2020-01-16 19:07:14,326 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:14,326 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1320 transitions. [2020-01-16 19:07:14,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:14,327 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:14,327 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:14,327 INFO L426 AbstractCegarLoop]: === Iteration 1238 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:14,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:14,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1537569218, now seen corresponding path program 1232 times [2020-01-16 19:07:14,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:14,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569121076] [2020-01-16 19:07:14,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:14,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:14,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569121076] [2020-01-16 19:07:14,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:14,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:14,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850692309] [2020-01-16 19:07:14,592 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:14,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:14,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:14,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:14,593 INFO L87 Difference]: Start difference. First operand 385 states and 1320 transitions. Second operand 9 states. [2020-01-16 19:07:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:14,684 INFO L93 Difference]: Finished difference Result 587 states and 1721 transitions. [2020-01-16 19:07:14,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:14,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:14,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:14,685 INFO L225 Difference]: With dead ends: 587 [2020-01-16 19:07:14,686 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:07:14,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:14,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:07:14,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 383. [2020-01-16 19:07:14,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:07:14,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1316 transitions. [2020-01-16 19:07:14,695 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1316 transitions. Word has length 22 [2020-01-16 19:07:14,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:14,695 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1316 transitions. [2020-01-16 19:07:14,695 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:14,696 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1316 transitions. [2020-01-16 19:07:14,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:14,696 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:14,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, 1, 1, 1] [2020-01-16 19:07:14,696 INFO L426 AbstractCegarLoop]: === Iteration 1239 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:14,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:14,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1608584264, now seen corresponding path program 1233 times [2020-01-16 19:07:14,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:14,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387284920] [2020-01-16 19:07:14,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:14,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-01-16 19:07:14,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387284920] [2020-01-16 19:07:14,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:14,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:14,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731088912] [2020-01-16 19:07:14,984 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:14,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:14,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:14,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:14,985 INFO L87 Difference]: Start difference. First operand 383 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:07:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:15,066 INFO L93 Difference]: Finished difference Result 592 states and 1735 transitions. [2020-01-16 19:07:15,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:15,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:15,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:15,068 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:07:15,068 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:07:15,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:15,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:07:15,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 388. [2020-01-16 19:07:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:07:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1324 transitions. [2020-01-16 19:07:15,078 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1324 transitions. Word has length 22 [2020-01-16 19:07:15,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:15,078 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1324 transitions. [2020-01-16 19:07:15,078 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1324 transitions. [2020-01-16 19:07:15,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:15,078 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:15,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, 1, 1, 1] [2020-01-16 19:07:15,079 INFO L426 AbstractCegarLoop]: === Iteration 1240 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:15,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:15,079 INFO L82 PathProgramCache]: Analyzing trace with hash -664466374, now seen corresponding path program 1234 times [2020-01-16 19:07:15,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:15,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322667460] [2020-01-16 19:07:15,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:15,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322667460] [2020-01-16 19:07:15,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:15,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:15,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864572285] [2020-01-16 19:07:15,361 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:15,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:15,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:15,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:15,362 INFO L87 Difference]: Start difference. First operand 388 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:07:15,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:15,467 INFO L93 Difference]: Finished difference Result 579 states and 1715 transitions. [2020-01-16 19:07:15,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:15,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:15,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:15,469 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:07:15,469 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:07:15,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:15,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:07:15,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 383. [2020-01-16 19:07:15,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:07:15,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1314 transitions. [2020-01-16 19:07:15,478 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1314 transitions. Word has length 22 [2020-01-16 19:07:15,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:15,478 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1314 transitions. [2020-01-16 19:07:15,478 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1314 transitions. [2020-01-16 19:07:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:15,479 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:15,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, 1, 1, 1] [2020-01-16 19:07:15,479 INFO L426 AbstractCegarLoop]: === Iteration 1241 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:15,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:15,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1663306490, now seen corresponding path program 1235 times [2020-01-16 19:07:15,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:15,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944133630] [2020-01-16 19:07:15,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:15,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-01-16 19:07:15,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944133630] [2020-01-16 19:07:15,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:15,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:15,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839988088] [2020-01-16 19:07:15,767 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:15,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:15,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:15,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:15,768 INFO L87 Difference]: Start difference. First operand 383 states and 1314 transitions. Second operand 9 states. [2020-01-16 19:07:15,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:15,852 INFO L93 Difference]: Finished difference Result 581 states and 1709 transitions. [2020-01-16 19:07:15,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:15,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:15,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:15,854 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:07:15,854 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:07:15,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:15,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:07:15,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 384. [2020-01-16 19:07:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:07:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1315 transitions. [2020-01-16 19:07:15,863 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1315 transitions. Word has length 22 [2020-01-16 19:07:15,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:15,863 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1315 transitions. [2020-01-16 19:07:15,863 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1315 transitions. [2020-01-16 19:07:15,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:15,863 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:15,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, 1, 1, 1] [2020-01-16 19:07:15,864 INFO L426 AbstractCegarLoop]: === Iteration 1242 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:15,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:15,864 INFO L82 PathProgramCache]: Analyzing trace with hash -2096431004, now seen corresponding path program 1236 times [2020-01-16 19:07:15,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:15,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24222532] [2020-01-16 19:07:15,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:16,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24222532] [2020-01-16 19:07:16,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:16,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:16,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021491602] [2020-01-16 19:07:16,144 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:16,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:16,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:16,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:16,145 INFO L87 Difference]: Start difference. First operand 384 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:07:16,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:16,245 INFO L93 Difference]: Finished difference Result 575 states and 1706 transitions. [2020-01-16 19:07:16,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:16,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:16,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:16,247 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:07:16,247 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:07:16,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:16,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:07:16,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 381. [2020-01-16 19:07:16,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:07:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1310 transitions. [2020-01-16 19:07:16,256 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1310 transitions. Word has length 22 [2020-01-16 19:07:16,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:16,257 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1310 transitions. [2020-01-16 19:07:16,257 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1310 transitions. [2020-01-16 19:07:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:16,257 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:16,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, 1, 1, 1] [2020-01-16 19:07:16,257 INFO L426 AbstractCegarLoop]: === Iteration 1243 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:16,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:16,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1773041486, now seen corresponding path program 1237 times [2020-01-16 19:07:16,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:16,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129855699] [2020-01-16 19:07:16,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:16,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-01-16 19:07:16,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129855699] [2020-01-16 19:07:16,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:16,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:16,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118333415] [2020-01-16 19:07:16,529 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:16,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:16,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:16,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:16,530 INFO L87 Difference]: Start difference. First operand 381 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:07:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:16,607 INFO L93 Difference]: Finished difference Result 599 states and 1748 transitions. [2020-01-16 19:07:16,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:16,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:16,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:16,608 INFO L225 Difference]: With dead ends: 599 [2020-01-16 19:07:16,608 INFO L226 Difference]: Without dead ends: 583 [2020-01-16 19:07:16,609 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:16,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-01-16 19:07:16,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 387. [2020-01-16 19:07:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:07:16,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1324 transitions. [2020-01-16 19:07:16,617 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1324 transitions. Word has length 22 [2020-01-16 19:07:16,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:16,618 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1324 transitions. [2020-01-16 19:07:16,618 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:16,618 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1324 transitions. [2020-01-16 19:07:16,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:16,618 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:16,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, 1, 1, 1] [2020-01-16 19:07:16,618 INFO L426 AbstractCegarLoop]: === Iteration 1244 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:16,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:16,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1559722148, now seen corresponding path program 1238 times [2020-01-16 19:07:16,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:16,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155010630] [2020-01-16 19:07:16,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:16,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-01-16 19:07:16,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155010630] [2020-01-16 19:07:16,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:16,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:16,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466634042] [2020-01-16 19:07:16,886 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:16,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:16,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:16,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:16,887 INFO L87 Difference]: Start difference. First operand 387 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:07:16,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:16,998 INFO L93 Difference]: Finished difference Result 593 states and 1734 transitions. [2020-01-16 19:07:16,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:16,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:16,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:16,999 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:07:17,000 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:07:17,000 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:17,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:07:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 384. [2020-01-16 19:07:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:07:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1317 transitions. [2020-01-16 19:07:17,008 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1317 transitions. Word has length 22 [2020-01-16 19:07:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:17,008 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1317 transitions. [2020-01-16 19:07:17,008 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1317 transitions. [2020-01-16 19:07:17,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:17,009 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:17,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, 1, 1, 1] [2020-01-16 19:07:17,009 INFO L426 AbstractCegarLoop]: === Iteration 1245 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:17,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:17,009 INFO L82 PathProgramCache]: Analyzing trace with hash -760348954, now seen corresponding path program 1239 times [2020-01-16 19:07:17,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:17,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982914848] [2020-01-16 19:07:17,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:17,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:17,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982914848] [2020-01-16 19:07:17,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:17,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:17,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802955799] [2020-01-16 19:07:17,282 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:17,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:17,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:17,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:17,283 INFO L87 Difference]: Start difference. First operand 384 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:07:17,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:17,354 INFO L93 Difference]: Finished difference Result 595 states and 1741 transitions. [2020-01-16 19:07:17,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:17,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:17,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:17,355 INFO L225 Difference]: With dead ends: 595 [2020-01-16 19:07:17,355 INFO L226 Difference]: Without dead ends: 579 [2020-01-16 19:07:17,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:17,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-01-16 19:07:17,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 389. [2020-01-16 19:07:17,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:07:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1325 transitions. [2020-01-16 19:07:17,364 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1325 transitions. Word has length 22 [2020-01-16 19:07:17,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:17,364 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1325 transitions. [2020-01-16 19:07:17,364 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:17,364 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1325 transitions. [2020-01-16 19:07:17,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:17,365 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:17,365 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:17,365 INFO L426 AbstractCegarLoop]: === Iteration 1246 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:17,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:17,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1261567704, now seen corresponding path program 1240 times [2020-01-16 19:07:17,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:17,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998398911] [2020-01-16 19:07:17,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:17,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-01-16 19:07:17,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998398911] [2020-01-16 19:07:17,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:17,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:17,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989517231] [2020-01-16 19:07:17,639 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:17,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:17,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:17,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:17,640 INFO L87 Difference]: Start difference. First operand 389 states and 1325 transitions. Second operand 9 states. [2020-01-16 19:07:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:17,746 INFO L93 Difference]: Finished difference Result 582 states and 1721 transitions. [2020-01-16 19:07:17,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:17,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:17,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:17,748 INFO L225 Difference]: With dead ends: 582 [2020-01-16 19:07:17,748 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:07:17,748 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:17,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:07:17,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 384. [2020-01-16 19:07:17,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:07:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1314 transitions. [2020-01-16 19:07:17,757 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1314 transitions. Word has length 22 [2020-01-16 19:07:17,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:17,758 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1314 transitions. [2020-01-16 19:07:17,758 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:17,758 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1314 transitions. [2020-01-16 19:07:17,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:17,758 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:17,758 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:17,758 INFO L426 AbstractCegarLoop]: === Iteration 1247 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:17,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:17,759 INFO L82 PathProgramCache]: Analyzing trace with hash -43769984, now seen corresponding path program 1241 times [2020-01-16 19:07:17,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:17,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458574773] [2020-01-16 19:07:17,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:18,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458574773] [2020-01-16 19:07:18,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:18,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:18,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239648637] [2020-01-16 19:07:18,024 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:18,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:18,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:18,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:18,025 INFO L87 Difference]: Start difference. First operand 384 states and 1314 transitions. Second operand 9 states. [2020-01-16 19:07:18,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:18,125 INFO L93 Difference]: Finished difference Result 586 states and 1719 transitions. [2020-01-16 19:07:18,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:18,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:18,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:18,126 INFO L225 Difference]: With dead ends: 586 [2020-01-16 19:07:18,127 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:07:18,127 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:18,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:07:18,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 386. [2020-01-16 19:07:18,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:07:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1317 transitions. [2020-01-16 19:07:18,135 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1317 transitions. Word has length 22 [2020-01-16 19:07:18,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:18,135 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1317 transitions. [2020-01-16 19:07:18,136 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1317 transitions. [2020-01-16 19:07:18,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:18,136 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:18,136 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:18,136 INFO L426 AbstractCegarLoop]: === Iteration 1248 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:18,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:18,137 INFO L82 PathProgramCache]: Analyzing trace with hash -217017676, now seen corresponding path program 1242 times [2020-01-16 19:07:18,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:18,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154002002] [2020-01-16 19:07:18,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:18,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-01-16 19:07:18,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154002002] [2020-01-16 19:07:18,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:18,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:18,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793118967] [2020-01-16 19:07:18,405 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:18,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:18,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:18,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:18,405 INFO L87 Difference]: Start difference. First operand 386 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:07:18,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:18,509 INFO L93 Difference]: Finished difference Result 579 states and 1713 transitions. [2020-01-16 19:07:18,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:18,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:18,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:18,511 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:07:18,511 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:07:18,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:18,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:07:18,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 381. [2020-01-16 19:07:18,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:07:18,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1308 transitions. [2020-01-16 19:07:18,520 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1308 transitions. Word has length 22 [2020-01-16 19:07:18,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:18,521 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1308 transitions. [2020-01-16 19:07:18,521 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1308 transitions. [2020-01-16 19:07:18,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:18,521 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:18,521 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:18,521 INFO L426 AbstractCegarLoop]: === Iteration 1249 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:18,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:18,522 INFO L82 PathProgramCache]: Analyzing trace with hash -235184322, now seen corresponding path program 1243 times [2020-01-16 19:07:18,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:18,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482254053] [2020-01-16 19:07:18,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:18,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-01-16 19:07:18,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482254053] [2020-01-16 19:07:18,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:18,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:18,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385943728] [2020-01-16 19:07:18,810 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:18,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:18,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:18,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:18,811 INFO L87 Difference]: Start difference. First operand 381 states and 1308 transitions. Second operand 9 states. [2020-01-16 19:07:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:18,891 INFO L93 Difference]: Finished difference Result 570 states and 1684 transitions. [2020-01-16 19:07:18,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:18,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:18,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:18,893 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:07:18,893 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:07:18,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:07:18,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 383. [2020-01-16 19:07:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:07:18,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1312 transitions. [2020-01-16 19:07:18,902 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1312 transitions. Word has length 22 [2020-01-16 19:07:18,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:18,902 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1312 transitions. [2020-01-16 19:07:18,902 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1312 transitions. [2020-01-16 19:07:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:18,903 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:18,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, 1, 1, 1] [2020-01-16 19:07:18,903 INFO L426 AbstractCegarLoop]: === Iteration 1250 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:18,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:18,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1375756636, now seen corresponding path program 1244 times [2020-01-16 19:07:18,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:18,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341473326] [2020-01-16 19:07:18,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:19,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341473326] [2020-01-16 19:07:19,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:19,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:19,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191211161] [2020-01-16 19:07:19,182 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:19,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:19,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:19,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:19,182 INFO L87 Difference]: Start difference. First operand 383 states and 1312 transitions. Second operand 9 states. [2020-01-16 19:07:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:19,286 INFO L93 Difference]: Finished difference Result 571 states and 1685 transitions. [2020-01-16 19:07:19,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:19,286 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:19,287 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:07:19,287 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:07:19,288 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:19,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:07:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-01-16 19:07:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1310 transitions. [2020-01-16 19:07:19,296 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1310 transitions. Word has length 22 [2020-01-16 19:07:19,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:19,296 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1310 transitions. [2020-01-16 19:07:19,296 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:19,297 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1310 transitions. [2020-01-16 19:07:19,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:19,297 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:19,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, 1, 1, 1] [2020-01-16 19:07:19,297 INFO L426 AbstractCegarLoop]: === Iteration 1251 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:19,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:19,297 INFO L82 PathProgramCache]: Analyzing trace with hash 777508210, now seen corresponding path program 1245 times [2020-01-16 19:07:19,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:19,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716611997] [2020-01-16 19:07:19,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:19,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716611997] [2020-01-16 19:07:19,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:19,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:19,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991511544] [2020-01-16 19:07:19,575 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:19,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:19,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:19,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:19,575 INFO L87 Difference]: Start difference. First operand 382 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:07:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:19,654 INFO L93 Difference]: Finished difference Result 571 states and 1686 transitions. [2020-01-16 19:07:19,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:19,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:19,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:19,656 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:07:19,656 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:07:19,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:19,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:07:19,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 383. [2020-01-16 19:07:19,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:07:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1311 transitions. [2020-01-16 19:07:19,665 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1311 transitions. Word has length 22 [2020-01-16 19:07:19,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:19,665 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1311 transitions. [2020-01-16 19:07:19,665 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:19,665 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1311 transitions. [2020-01-16 19:07:19,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:19,666 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:19,666 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:19,666 INFO L426 AbstractCegarLoop]: === Iteration 1252 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:19,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:19,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1312738012, now seen corresponding path program 1246 times [2020-01-16 19:07:19,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:19,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724755575] [2020-01-16 19:07:19,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:19,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724755575] [2020-01-16 19:07:19,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:19,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:19,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125045046] [2020-01-16 19:07:19,937 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:19,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:19,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:19,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:19,937 INFO L87 Difference]: Start difference. First operand 383 states and 1311 transitions. Second operand 9 states. [2020-01-16 19:07:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:20,040 INFO L93 Difference]: Finished difference Result 565 states and 1683 transitions. [2020-01-16 19:07:20,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:20,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:20,041 INFO L225 Difference]: With dead ends: 565 [2020-01-16 19:07:20,041 INFO L226 Difference]: Without dead ends: 552 [2020-01-16 19:07:20,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-01-16 19:07:20,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 382. [2020-01-16 19:07:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1309 transitions. [2020-01-16 19:07:20,051 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1309 transitions. Word has length 22 [2020-01-16 19:07:20,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:20,051 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1309 transitions. [2020-01-16 19:07:20,051 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:20,051 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1309 transitions. [2020-01-16 19:07:20,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:20,052 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:20,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, 1, 1, 1] [2020-01-16 19:07:20,052 INFO L426 AbstractCegarLoop]: === Iteration 1253 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:20,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:20,052 INFO L82 PathProgramCache]: Analyzing trace with hash 788011314, now seen corresponding path program 1247 times [2020-01-16 19:07:20,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:20,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292017317] [2020-01-16 19:07:20,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:20,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-01-16 19:07:20,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292017317] [2020-01-16 19:07:20,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:20,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:20,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206138213] [2020-01-16 19:07:20,330 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:20,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:20,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:20,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:20,331 INFO L87 Difference]: Start difference. First operand 382 states and 1309 transitions. Second operand 9 states. [2020-01-16 19:07:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:20,432 INFO L93 Difference]: Finished difference Result 573 states and 1690 transitions. [2020-01-16 19:07:20,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:20,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:20,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:20,434 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:07:20,434 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:07:20,434 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:07:20,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 384. [2020-01-16 19:07:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:07:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1312 transitions. [2020-01-16 19:07:20,442 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1312 transitions. Word has length 22 [2020-01-16 19:07:20,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:20,443 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1312 transitions. [2020-01-16 19:07:20,443 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:20,443 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1312 transitions. [2020-01-16 19:07:20,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:20,443 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:20,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:20,443 INFO L426 AbstractCegarLoop]: === Iteration 1254 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:20,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:20,444 INFO L82 PathProgramCache]: Analyzing trace with hash -287699842, now seen corresponding path program 1248 times [2020-01-16 19:07:20,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:20,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940092081] [2020-01-16 19:07:20,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:20,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-01-16 19:07:20,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940092081] [2020-01-16 19:07:20,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:20,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:20,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632539508] [2020-01-16 19:07:20,713 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:20,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:20,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:20,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:20,713 INFO L87 Difference]: Start difference. First operand 384 states and 1312 transitions. Second operand 9 states. [2020-01-16 19:07:20,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:20,824 INFO L93 Difference]: Finished difference Result 566 states and 1684 transitions. [2020-01-16 19:07:20,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:20,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:20,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:20,826 INFO L225 Difference]: With dead ends: 566 [2020-01-16 19:07:20,826 INFO L226 Difference]: Without dead ends: 549 [2020-01-16 19:07:20,826 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-01-16 19:07:20,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 379. [2020-01-16 19:07:20,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:07:20,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1304 transitions. [2020-01-16 19:07:20,835 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1304 transitions. Word has length 22 [2020-01-16 19:07:20,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:20,835 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1304 transitions. [2020-01-16 19:07:20,835 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:20,835 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1304 transitions. [2020-01-16 19:07:20,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:20,835 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:20,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, 1, 1, 1] [2020-01-16 19:07:20,836 INFO L426 AbstractCegarLoop]: === Iteration 1255 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:20,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:20,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1067271706, now seen corresponding path program 1249 times [2020-01-16 19:07:20,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:20,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741800506] [2020-01-16 19:07:20,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:21,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741800506] [2020-01-16 19:07:21,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:21,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:21,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459198403] [2020-01-16 19:07:21,097 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:21,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:21,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:21,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:21,098 INFO L87 Difference]: Start difference. First operand 379 states and 1304 transitions. Second operand 9 states. [2020-01-16 19:07:21,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:21,180 INFO L93 Difference]: Finished difference Result 617 states and 1793 transitions. [2020-01-16 19:07:21,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:21,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:21,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:21,182 INFO L225 Difference]: With dead ends: 617 [2020-01-16 19:07:21,182 INFO L226 Difference]: Without dead ends: 601 [2020-01-16 19:07:21,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:21,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-01-16 19:07:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 387. [2020-01-16 19:07:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:07:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1325 transitions. [2020-01-16 19:07:21,191 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1325 transitions. Word has length 22 [2020-01-16 19:07:21,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:21,191 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1325 transitions. [2020-01-16 19:07:21,191 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:21,191 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1325 transitions. [2020-01-16 19:07:21,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:21,192 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:21,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, 1, 1, 1] [2020-01-16 19:07:21,192 INFO L426 AbstractCegarLoop]: === Iteration 1256 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:21,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:21,192 INFO L82 PathProgramCache]: Analyzing trace with hash -506203214, now seen corresponding path program 1250 times [2020-01-16 19:07:21,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:21,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064237796] [2020-01-16 19:07:21,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:21,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-01-16 19:07:21,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064237796] [2020-01-16 19:07:21,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:21,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:21,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079500292] [2020-01-16 19:07:21,458 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:21,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:21,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:21,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:21,458 INFO L87 Difference]: Start difference. First operand 387 states and 1325 transitions. Second operand 9 states. [2020-01-16 19:07:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:21,549 INFO L93 Difference]: Finished difference Result 610 states and 1778 transitions. [2020-01-16 19:07:21,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:21,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:21,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:21,551 INFO L225 Difference]: With dead ends: 610 [2020-01-16 19:07:21,551 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 19:07:21,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:21,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 19:07:21,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 385. [2020-01-16 19:07:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:07:21,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1321 transitions. [2020-01-16 19:07:21,560 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1321 transitions. Word has length 22 [2020-01-16 19:07:21,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:21,560 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1321 transitions. [2020-01-16 19:07:21,560 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:21,560 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1321 transitions. [2020-01-16 19:07:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:21,560 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:21,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, 1, 1, 1] [2020-01-16 19:07:21,561 INFO L426 AbstractCegarLoop]: === Iteration 1257 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:21,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:21,561 INFO L82 PathProgramCache]: Analyzing trace with hash -54579174, now seen corresponding path program 1251 times [2020-01-16 19:07:21,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:21,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939413348] [2020-01-16 19:07:21,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:21,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939413348] [2020-01-16 19:07:21,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:21,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:21,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222816845] [2020-01-16 19:07:21,841 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:21,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:21,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:21,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:21,841 INFO L87 Difference]: Start difference. First operand 385 states and 1321 transitions. Second operand 9 states. [2020-01-16 19:07:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:21,950 INFO L93 Difference]: Finished difference Result 628 states and 1817 transitions. [2020-01-16 19:07:21,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:21,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:21,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:21,952 INFO L225 Difference]: With dead ends: 628 [2020-01-16 19:07:21,952 INFO L226 Difference]: Without dead ends: 612 [2020-01-16 19:07:21,952 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:21,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-01-16 19:07:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 393. [2020-01-16 19:07:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:07:21,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1334 transitions. [2020-01-16 19:07:21,961 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1334 transitions. Word has length 22 [2020-01-16 19:07:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:21,961 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1334 transitions. [2020-01-16 19:07:21,961 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1334 transitions. [2020-01-16 19:07:21,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:21,962 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:21,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, 1, 1, 1] [2020-01-16 19:07:21,962 INFO L426 AbstractCegarLoop]: === Iteration 1258 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:21,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:21,962 INFO L82 PathProgramCache]: Analyzing trace with hash -184549620, now seen corresponding path program 1252 times [2020-01-16 19:07:21,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:21,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431354453] [2020-01-16 19:07:21,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:22,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431354453] [2020-01-16 19:07:22,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:22,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:22,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60400921] [2020-01-16 19:07:22,231 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:22,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:22,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:22,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:22,231 INFO L87 Difference]: Start difference. First operand 393 states and 1334 transitions. Second operand 9 states. [2020-01-16 19:07:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:22,346 INFO L93 Difference]: Finished difference Result 626 states and 1807 transitions. [2020-01-16 19:07:22,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:22,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:22,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:22,348 INFO L225 Difference]: With dead ends: 626 [2020-01-16 19:07:22,348 INFO L226 Difference]: Without dead ends: 604 [2020-01-16 19:07:22,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:22,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-01-16 19:07:22,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 385. [2020-01-16 19:07:22,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:07:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1318 transitions. [2020-01-16 19:07:22,357 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1318 transitions. Word has length 22 [2020-01-16 19:07:22,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:22,357 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1318 transitions. [2020-01-16 19:07:22,357 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1318 transitions. [2020-01-16 19:07:22,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:22,357 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:22,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, 1, 1, 1] [2020-01-16 19:07:22,358 INFO L426 AbstractCegarLoop]: === Iteration 1259 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:22,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:22,358 INFO L82 PathProgramCache]: Analyzing trace with hash 143052, now seen corresponding path program 1253 times [2020-01-16 19:07:22,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:22,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399112220] [2020-01-16 19:07:22,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:22,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:22,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399112220] [2020-01-16 19:07:22,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:22,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:22,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470922671] [2020-01-16 19:07:22,623 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:22,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:22,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:22,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:22,623 INFO L87 Difference]: Start difference. First operand 385 states and 1318 transitions. Second operand 9 states. [2020-01-16 19:07:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:22,729 INFO L93 Difference]: Finished difference Result 607 states and 1770 transitions. [2020-01-16 19:07:22,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:22,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:22,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:22,731 INFO L225 Difference]: With dead ends: 607 [2020-01-16 19:07:22,731 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:07:22,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:22,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:07:22,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 386. [2020-01-16 19:07:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:07:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1319 transitions. [2020-01-16 19:07:22,739 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1319 transitions. Word has length 22 [2020-01-16 19:07:22,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:22,739 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1319 transitions. [2020-01-16 19:07:22,740 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1319 transitions. [2020-01-16 19:07:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:22,740 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:22,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, 1, 1, 1] [2020-01-16 19:07:22,740 INFO L426 AbstractCegarLoop]: === Iteration 1260 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:22,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:22,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1075568104, now seen corresponding path program 1254 times [2020-01-16 19:07:22,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:22,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613316331] [2020-01-16 19:07:22,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:22,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613316331] [2020-01-16 19:07:22,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:22,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:22,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662724240] [2020-01-16 19:07:22,994 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:22,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:22,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:22,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:22,994 INFO L87 Difference]: Start difference. First operand 386 states and 1319 transitions. Second operand 9 states. [2020-01-16 19:07:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:23,124 INFO L93 Difference]: Finished difference Result 612 states and 1779 transitions. [2020-01-16 19:07:23,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:23,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:23,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:23,126 INFO L225 Difference]: With dead ends: 612 [2020-01-16 19:07:23,126 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:07:23,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:23,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:07:23,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 382. [2020-01-16 19:07:23,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:23,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1312 transitions. [2020-01-16 19:07:23,135 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1312 transitions. Word has length 22 [2020-01-16 19:07:23,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:23,135 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1312 transitions. [2020-01-16 19:07:23,135 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1312 transitions. [2020-01-16 19:07:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:23,136 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:23,136 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:23,136 INFO L426 AbstractCegarLoop]: === Iteration 1261 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:23,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:23,136 INFO L82 PathProgramCache]: Analyzing trace with hash 858762372, now seen corresponding path program 1255 times [2020-01-16 19:07:23,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:23,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299783927] [2020-01-16 19:07:23,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:23,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-01-16 19:07:23,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299783927] [2020-01-16 19:07:23,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:23,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:23,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119500373] [2020-01-16 19:07:23,402 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:23,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:23,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:23,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:23,403 INFO L87 Difference]: Start difference. First operand 382 states and 1312 transitions. Second operand 9 states. [2020-01-16 19:07:23,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:23,492 INFO L93 Difference]: Finished difference Result 609 states and 1773 transitions. [2020-01-16 19:07:23,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:23,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:23,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:23,494 INFO L225 Difference]: With dead ends: 609 [2020-01-16 19:07:23,494 INFO L226 Difference]: Without dead ends: 593 [2020-01-16 19:07:23,494 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:23,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-01-16 19:07:23,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 386. [2020-01-16 19:07:23,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:07:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1320 transitions. [2020-01-16 19:07:23,503 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1320 transitions. Word has length 22 [2020-01-16 19:07:23,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:23,503 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1320 transitions. [2020-01-16 19:07:23,503 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:23,504 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1320 transitions. [2020-01-16 19:07:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:23,504 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:23,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, 1, 1, 1] [2020-01-16 19:07:23,504 INFO L426 AbstractCegarLoop]: === Iteration 1262 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:23,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:23,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1419830864, now seen corresponding path program 1256 times [2020-01-16 19:07:23,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:23,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923511324] [2020-01-16 19:07:23,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:23,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-01-16 19:07:23,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923511324] [2020-01-16 19:07:23,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:23,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:23,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821994022] [2020-01-16 19:07:23,769 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:23,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:23,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:23,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:23,769 INFO L87 Difference]: Start difference. First operand 386 states and 1320 transitions. Second operand 9 states. [2020-01-16 19:07:23,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:23,857 INFO L93 Difference]: Finished difference Result 602 states and 1758 transitions. [2020-01-16 19:07:23,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:23,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:23,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:23,858 INFO L225 Difference]: With dead ends: 602 [2020-01-16 19:07:23,858 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 19:07:23,859 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 19:07:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 384. [2020-01-16 19:07:23,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:07:23,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1316 transitions. [2020-01-16 19:07:23,867 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1316 transitions. Word has length 22 [2020-01-16 19:07:23,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:23,867 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1316 transitions. [2020-01-16 19:07:23,868 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:23,868 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1316 transitions. [2020-01-16 19:07:23,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:23,868 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:23,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, 1, 1, 1] [2020-01-16 19:07:23,868 INFO L426 AbstractCegarLoop]: === Iteration 1263 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:23,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:23,868 INFO L82 PathProgramCache]: Analyzing trace with hash 271017050, now seen corresponding path program 1257 times [2020-01-16 19:07:23,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:23,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922147798] [2020-01-16 19:07:23,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:24,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922147798] [2020-01-16 19:07:24,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:24,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:24,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459265090] [2020-01-16 19:07:24,145 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:24,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:24,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:24,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:24,145 INFO L87 Difference]: Start difference. First operand 384 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:07:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:24,250 INFO L93 Difference]: Finished difference Result 607 states and 1772 transitions. [2020-01-16 19:07:24,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:24,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:24,251 INFO L225 Difference]: With dead ends: 607 [2020-01-16 19:07:24,251 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 19:07:24,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:24,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 19:07:24,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 389. [2020-01-16 19:07:24,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:07:24,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1324 transitions. [2020-01-16 19:07:24,261 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1324 transitions. Word has length 22 [2020-01-16 19:07:24,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:24,261 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1324 transitions. [2020-01-16 19:07:24,261 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1324 transitions. [2020-01-16 19:07:24,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:24,262 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:24,262 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:24,262 INFO L426 AbstractCegarLoop]: === Iteration 1264 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:24,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:24,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2002033588, now seen corresponding path program 1258 times [2020-01-16 19:07:24,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:24,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494696484] [2020-01-16 19:07:24,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:24,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494696484] [2020-01-16 19:07:24,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:24,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:24,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144175583] [2020-01-16 19:07:24,528 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:24,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:24,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:24,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:24,529 INFO L87 Difference]: Start difference. First operand 389 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:07:24,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:24,637 INFO L93 Difference]: Finished difference Result 594 states and 1752 transitions. [2020-01-16 19:07:24,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:24,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:24,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:24,639 INFO L225 Difference]: With dead ends: 594 [2020-01-16 19:07:24,639 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:07:24,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:24,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:07:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 384. [2020-01-16 19:07:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:07:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1314 transitions. [2020-01-16 19:07:24,649 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1314 transitions. Word has length 22 [2020-01-16 19:07:24,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:24,649 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1314 transitions. [2020-01-16 19:07:24,649 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:24,649 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1314 transitions. [2020-01-16 19:07:24,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:24,650 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:24,650 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:24,650 INFO L426 AbstractCegarLoop]: === Iteration 1265 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:24,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:24,650 INFO L82 PathProgramCache]: Analyzing trace with hash 325739276, now seen corresponding path program 1259 times [2020-01-16 19:07:24,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:24,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119629415] [2020-01-16 19:07:24,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:24,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-01-16 19:07:24,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119629415] [2020-01-16 19:07:24,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:24,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:24,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512688903] [2020-01-16 19:07:24,926 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:24,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:24,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:24,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:24,927 INFO L87 Difference]: Start difference. First operand 384 states and 1314 transitions. Second operand 9 states. [2020-01-16 19:07:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:25,032 INFO L93 Difference]: Finished difference Result 596 states and 1746 transitions. [2020-01-16 19:07:25,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:25,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:25,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:25,034 INFO L225 Difference]: With dead ends: 596 [2020-01-16 19:07:25,034 INFO L226 Difference]: Without dead ends: 587 [2020-01-16 19:07:25,034 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-01-16 19:07:25,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 385. [2020-01-16 19:07:25,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:07:25,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1315 transitions. [2020-01-16 19:07:25,044 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1315 transitions. Word has length 22 [2020-01-16 19:07:25,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:25,044 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1315 transitions. [2020-01-16 19:07:25,044 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:25,044 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1315 transitions. [2020-01-16 19:07:25,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:25,045 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:25,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, 1, 1, 1] [2020-01-16 19:07:25,045 INFO L426 AbstractCegarLoop]: === Iteration 1266 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:25,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:25,045 INFO L82 PathProgramCache]: Analyzing trace with hash 860969078, now seen corresponding path program 1260 times [2020-01-16 19:07:25,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:25,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168477676] [2020-01-16 19:07:25,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:25,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-01-16 19:07:25,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168477676] [2020-01-16 19:07:25,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:25,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:25,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217960043] [2020-01-16 19:07:25,308 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:25,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:25,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:25,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:25,308 INFO L87 Difference]: Start difference. First operand 385 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:07:25,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:25,435 INFO L93 Difference]: Finished difference Result 590 states and 1743 transitions. [2020-01-16 19:07:25,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:25,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:25,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:25,437 INFO L225 Difference]: With dead ends: 590 [2020-01-16 19:07:25,437 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:07:25,437 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:25,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:07:25,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 382. [2020-01-16 19:07:25,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1310 transitions. [2020-01-16 19:07:25,446 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1310 transitions. Word has length 22 [2020-01-16 19:07:25,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:25,447 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1310 transitions. [2020-01-16 19:07:25,447 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1310 transitions. [2020-01-16 19:07:25,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:25,447 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:25,447 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:25,447 INFO L426 AbstractCegarLoop]: === Iteration 1267 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:25,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:25,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1094814972, now seen corresponding path program 1261 times [2020-01-16 19:07:25,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:25,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602138847] [2020-01-16 19:07:25,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:25,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602138847] [2020-01-16 19:07:25,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:25,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:25,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668947581] [2020-01-16 19:07:25,735 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:25,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:25,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:25,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:25,735 INFO L87 Difference]: Start difference. First operand 382 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:07:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:25,820 INFO L93 Difference]: Finished difference Result 632 states and 1830 transitions. [2020-01-16 19:07:25,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:25,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:25,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:25,821 INFO L225 Difference]: With dead ends: 632 [2020-01-16 19:07:25,821 INFO L226 Difference]: Without dead ends: 616 [2020-01-16 19:07:25,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:25,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-01-16 19:07:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 396. [2020-01-16 19:07:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-01-16 19:07:25,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1343 transitions. [2020-01-16 19:07:25,831 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1343 transitions. Word has length 22 [2020-01-16 19:07:25,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:25,831 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 1343 transitions. [2020-01-16 19:07:25,831 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:25,831 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1343 transitions. [2020-01-16 19:07:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:25,831 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:25,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, 1, 1, 1] [2020-01-16 19:07:25,831 INFO L426 AbstractCegarLoop]: === Iteration 1268 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:25,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1224785418, now seen corresponding path program 1262 times [2020-01-16 19:07:25,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:25,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608137533] [2020-01-16 19:07:25,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:26,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-01-16 19:07:26,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608137533] [2020-01-16 19:07:26,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:26,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:26,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079505469] [2020-01-16 19:07:26,101 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:26,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:26,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:26,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:26,101 INFO L87 Difference]: Start difference. First operand 396 states and 1343 transitions. Second operand 9 states. [2020-01-16 19:07:26,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:26,234 INFO L93 Difference]: Finished difference Result 630 states and 1820 transitions. [2020-01-16 19:07:26,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:26,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:26,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:26,236 INFO L225 Difference]: With dead ends: 630 [2020-01-16 19:07:26,236 INFO L226 Difference]: Without dead ends: 608 [2020-01-16 19:07:26,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:26,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-01-16 19:07:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 388. [2020-01-16 19:07:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:07:26,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1324 transitions. [2020-01-16 19:07:26,245 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1324 transitions. Word has length 22 [2020-01-16 19:07:26,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:26,245 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1324 transitions. [2020-01-16 19:07:26,245 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1324 transitions. [2020-01-16 19:07:26,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:26,246 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:26,246 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:26,246 INFO L426 AbstractCegarLoop]: === Iteration 1269 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:26,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:26,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1599714470, now seen corresponding path program 1263 times [2020-01-16 19:07:26,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:26,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257587116] [2020-01-16 19:07:26,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:26,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-01-16 19:07:26,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257587116] [2020-01-16 19:07:26,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:26,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:26,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608376662] [2020-01-16 19:07:26,528 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:26,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:26,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:26,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:26,529 INFO L87 Difference]: Start difference. First operand 388 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:07:26,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:26,609 INFO L93 Difference]: Finished difference Result 619 states and 1799 transitions. [2020-01-16 19:07:26,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:26,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:26,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:26,611 INFO L225 Difference]: With dead ends: 619 [2020-01-16 19:07:26,611 INFO L226 Difference]: Without dead ends: 603 [2020-01-16 19:07:26,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:26,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-01-16 19:07:26,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 393. [2020-01-16 19:07:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:07:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1332 transitions. [2020-01-16 19:07:26,621 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1332 transitions. Word has length 22 [2020-01-16 19:07:26,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:26,621 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1332 transitions. [2020-01-16 19:07:26,621 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:26,621 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1332 transitions. [2020-01-16 19:07:26,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:26,622 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:26,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, 1, 1, 1] [2020-01-16 19:07:26,622 INFO L426 AbstractCegarLoop]: === Iteration 1270 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:26,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:26,622 INFO L82 PathProgramCache]: Analyzing trace with hash -673336168, now seen corresponding path program 1264 times [2020-01-16 19:07:26,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:26,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330264454] [2020-01-16 19:07:26,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:26,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-01-16 19:07:26,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330264454] [2020-01-16 19:07:26,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:26,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:26,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982487913] [2020-01-16 19:07:26,889 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:26,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:26,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:26,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:26,890 INFO L87 Difference]: Start difference. First operand 393 states and 1332 transitions. Second operand 9 states. [2020-01-16 19:07:27,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:27,008 INFO L93 Difference]: Finished difference Result 606 states and 1779 transitions. [2020-01-16 19:07:27,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:27,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:27,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:27,010 INFO L225 Difference]: With dead ends: 606 [2020-01-16 19:07:27,010 INFO L226 Difference]: Without dead ends: 589 [2020-01-16 19:07:27,010 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:27,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-01-16 19:07:27,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 388. [2020-01-16 19:07:27,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:07:27,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1319 transitions. [2020-01-16 19:07:27,019 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1319 transitions. Word has length 22 [2020-01-16 19:07:27,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:27,019 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1319 transitions. [2020-01-16 19:07:27,019 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:27,020 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1319 transitions. [2020-01-16 19:07:27,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:27,020 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:27,020 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:27,020 INFO L426 AbstractCegarLoop]: === Iteration 1271 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:27,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:27,020 INFO L82 PathProgramCache]: Analyzing trace with hash -2141390750, now seen corresponding path program 1265 times [2020-01-16 19:07:27,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:27,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817220989] [2020-01-16 19:07:27,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:27,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-01-16 19:07:27,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817220989] [2020-01-16 19:07:27,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:27,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:27,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859020000] [2020-01-16 19:07:27,286 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:27,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:27,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:27,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:27,286 INFO L87 Difference]: Start difference. First operand 388 states and 1319 transitions. Second operand 9 states. [2020-01-16 19:07:27,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:27,393 INFO L93 Difference]: Finished difference Result 616 states and 1789 transitions. [2020-01-16 19:07:27,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:27,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:27,394 INFO L225 Difference]: With dead ends: 616 [2020-01-16 19:07:27,395 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:07:27,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:07:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 392. [2020-01-16 19:07:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-01-16 19:07:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1326 transitions. [2020-01-16 19:07:27,404 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1326 transitions. Word has length 22 [2020-01-16 19:07:27,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:27,404 INFO L478 AbstractCegarLoop]: Abstraction has 392 states and 1326 transitions. [2020-01-16 19:07:27,404 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1326 transitions. [2020-01-16 19:07:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:27,404 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:27,404 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:27,404 INFO L426 AbstractCegarLoop]: === Iteration 1272 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:27,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:27,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1282516220, now seen corresponding path program 1266 times [2020-01-16 19:07:27,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:27,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731264287] [2020-01-16 19:07:27,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:27,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-01-16 19:07:27,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731264287] [2020-01-16 19:07:27,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:27,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:27,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517638977] [2020-01-16 19:07:27,678 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:27,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:27,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:27,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:27,678 INFO L87 Difference]: Start difference. First operand 392 states and 1326 transitions. Second operand 9 states. [2020-01-16 19:07:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:27,785 INFO L93 Difference]: Finished difference Result 605 states and 1773 transitions. [2020-01-16 19:07:27,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:27,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:27,787 INFO L225 Difference]: With dead ends: 605 [2020-01-16 19:07:27,787 INFO L226 Difference]: Without dead ends: 583 [2020-01-16 19:07:27,787 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:27,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-01-16 19:07:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 382. [2020-01-16 19:07:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:27,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1307 transitions. [2020-01-16 19:07:27,797 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1307 transitions. Word has length 22 [2020-01-16 19:07:27,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:27,797 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1307 transitions. [2020-01-16 19:07:27,797 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1307 transitions. [2020-01-16 19:07:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:27,797 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:27,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, 1, 1, 1] [2020-01-16 19:07:27,798 INFO L426 AbstractCegarLoop]: === Iteration 1273 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:27,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:27,798 INFO L82 PathProgramCache]: Analyzing trace with hash 443042192, now seen corresponding path program 1267 times [2020-01-16 19:07:27,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:27,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277064204] [2020-01-16 19:07:27,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:28,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-01-16 19:07:28,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277064204] [2020-01-16 19:07:28,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:28,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:28,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568376621] [2020-01-16 19:07:28,059 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:28,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:28,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:28,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:28,060 INFO L87 Difference]: Start difference. First operand 382 states and 1307 transitions. Second operand 9 states. [2020-01-16 19:07:28,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:28,146 INFO L93 Difference]: Finished difference Result 595 states and 1742 transitions. [2020-01-16 19:07:28,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:28,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:28,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:28,148 INFO L225 Difference]: With dead ends: 595 [2020-01-16 19:07:28,148 INFO L226 Difference]: Without dead ends: 586 [2020-01-16 19:07:28,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-01-16 19:07:28,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 384. [2020-01-16 19:07:28,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:07:28,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1311 transitions. [2020-01-16 19:07:28,156 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1311 transitions. Word has length 22 [2020-01-16 19:07:28,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:28,157 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1311 transitions. [2020-01-16 19:07:28,157 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:28,157 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1311 transitions. [2020-01-16 19:07:28,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:28,157 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:28,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, 1, 1, 1] [2020-01-16 19:07:28,157 INFO L426 AbstractCegarLoop]: === Iteration 1274 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:28,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:28,158 INFO L82 PathProgramCache]: Analyzing trace with hash -632668964, now seen corresponding path program 1268 times [2020-01-16 19:07:28,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:28,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553052650] [2020-01-16 19:07:28,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:28,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-01-16 19:07:28,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553052650] [2020-01-16 19:07:28,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:28,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:28,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413899925] [2020-01-16 19:07:28,416 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:28,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:28,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:28,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:28,417 INFO L87 Difference]: Start difference. First operand 384 states and 1311 transitions. Second operand 9 states. [2020-01-16 19:07:28,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:28,524 INFO L93 Difference]: Finished difference Result 600 states and 1751 transitions. [2020-01-16 19:07:28,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:28,525 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:28,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:28,526 INFO L225 Difference]: With dead ends: 600 [2020-01-16 19:07:28,526 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 19:07:28,526 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:28,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 19:07:28,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 383. [2020-01-16 19:07:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:07:28,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1309 transitions. [2020-01-16 19:07:28,536 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1309 transitions. Word has length 22 [2020-01-16 19:07:28,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:28,536 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1309 transitions. [2020-01-16 19:07:28,536 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1309 transitions. [2020-01-16 19:07:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:28,536 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:28,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, 1, 1, 1] [2020-01-16 19:07:28,537 INFO L426 AbstractCegarLoop]: === Iteration 1275 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:28,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:28,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1157395662, now seen corresponding path program 1269 times [2020-01-16 19:07:28,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:28,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800927828] [2020-01-16 19:07:28,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:28,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800927828] [2020-01-16 19:07:28,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:28,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:28,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758988923] [2020-01-16 19:07:28,803 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:28,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:28,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:28,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:28,803 INFO L87 Difference]: Start difference. First operand 383 states and 1309 transitions. Second operand 9 states. [2020-01-16 19:07:28,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:28,892 INFO L93 Difference]: Finished difference Result 592 states and 1736 transitions. [2020-01-16 19:07:28,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:28,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:28,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:28,894 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:07:28,894 INFO L226 Difference]: Without dead ends: 583 [2020-01-16 19:07:28,894 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:28,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-01-16 19:07:28,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 384. [2020-01-16 19:07:28,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:07:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1310 transitions. [2020-01-16 19:07:28,904 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1310 transitions. Word has length 22 [2020-01-16 19:07:28,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:28,904 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1310 transitions. [2020-01-16 19:07:28,904 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:28,904 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1310 transitions. [2020-01-16 19:07:28,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:28,905 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:28,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, 1, 1, 1] [2020-01-16 19:07:28,905 INFO L426 AbstractCegarLoop]: === Iteration 1276 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:28,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:28,905 INFO L82 PathProgramCache]: Analyzing trace with hash -622165860, now seen corresponding path program 1270 times [2020-01-16 19:07:28,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:28,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790972172] [2020-01-16 19:07:28,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:29,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790972172] [2020-01-16 19:07:29,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:29,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:29,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978558499] [2020-01-16 19:07:29,174 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:29,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:29,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:29,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:29,174 INFO L87 Difference]: Start difference. First operand 384 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:07:29,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:29,284 INFO L93 Difference]: Finished difference Result 586 states and 1733 transitions. [2020-01-16 19:07:29,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:29,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:29,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:29,286 INFO L225 Difference]: With dead ends: 586 [2020-01-16 19:07:29,286 INFO L226 Difference]: Without dead ends: 573 [2020-01-16 19:07:29,287 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-01-16 19:07:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 383. [2020-01-16 19:07:29,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:07:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1308 transitions. [2020-01-16 19:07:29,296 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1308 transitions. Word has length 22 [2020-01-16 19:07:29,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:29,296 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1308 transitions. [2020-01-16 19:07:29,296 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1308 transitions. [2020-01-16 19:07:29,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:29,297 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:29,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, 1, 1, 1] [2020-01-16 19:07:29,297 INFO L426 AbstractCegarLoop]: === Iteration 1277 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:29,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:29,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1220414286, now seen corresponding path program 1271 times [2020-01-16 19:07:29,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:29,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150237719] [2020-01-16 19:07:29,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:29,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-01-16 19:07:29,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150237719] [2020-01-16 19:07:29,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:29,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:29,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482820890] [2020-01-16 19:07:29,557 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:29,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:29,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:29,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:29,557 INFO L87 Difference]: Start difference. First operand 383 states and 1308 transitions. Second operand 9 states. [2020-01-16 19:07:29,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:29,666 INFO L93 Difference]: Finished difference Result 600 states and 1754 transitions. [2020-01-16 19:07:29,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:29,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:29,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:29,668 INFO L225 Difference]: With dead ends: 600 [2020-01-16 19:07:29,668 INFO L226 Difference]: Without dead ends: 586 [2020-01-16 19:07:29,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-01-16 19:07:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 387. [2020-01-16 19:07:29,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:07:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1315 transitions. [2020-01-16 19:07:29,678 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1315 transitions. Word has length 22 [2020-01-16 19:07:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:29,678 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1315 transitions. [2020-01-16 19:07:29,678 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1315 transitions. [2020-01-16 19:07:29,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:29,679 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:29,679 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:29,679 INFO L426 AbstractCegarLoop]: === Iteration 1278 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:29,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:29,679 INFO L82 PathProgramCache]: Analyzing trace with hash 390526672, now seen corresponding path program 1272 times [2020-01-16 19:07:29,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:29,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224361880] [2020-01-16 19:07:29,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:29,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-01-16 19:07:29,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224361880] [2020-01-16 19:07:29,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:29,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:29,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854492809] [2020-01-16 19:07:29,945 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:29,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:29,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:29,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:29,946 INFO L87 Difference]: Start difference. First operand 387 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:07:30,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:30,077 INFO L93 Difference]: Finished difference Result 589 states and 1738 transitions. [2020-01-16 19:07:30,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:30,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:30,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:30,079 INFO L225 Difference]: With dead ends: 589 [2020-01-16 19:07:30,079 INFO L226 Difference]: Without dead ends: 569 [2020-01-16 19:07:30,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:30,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-01-16 19:07:30,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 379. [2020-01-16 19:07:30,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:07:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1301 transitions. [2020-01-16 19:07:30,089 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1301 transitions. Word has length 22 [2020-01-16 19:07:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:30,089 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1301 transitions. [2020-01-16 19:07:30,089 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1301 transitions. [2020-01-16 19:07:30,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:30,089 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:30,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, 1, 1, 1] [2020-01-16 19:07:30,090 INFO L426 AbstractCegarLoop]: === Iteration 1279 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:30,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:30,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1164161208, now seen corresponding path program 1273 times [2020-01-16 19:07:30,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:30,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523216132] [2020-01-16 19:07:30,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:30,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-01-16 19:07:30,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523216132] [2020-01-16 19:07:30,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:30,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:30,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877128702] [2020-01-16 19:07:30,339 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:30,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:30,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:30,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:30,339 INFO L87 Difference]: Start difference. First operand 379 states and 1301 transitions. Second operand 9 states. [2020-01-16 19:07:30,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:30,434 INFO L93 Difference]: Finished difference Result 630 states and 1831 transitions. [2020-01-16 19:07:30,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:30,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:30,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:30,436 INFO L225 Difference]: With dead ends: 630 [2020-01-16 19:07:30,436 INFO L226 Difference]: Without dead ends: 614 [2020-01-16 19:07:30,436 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:30,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-01-16 19:07:30,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 390. [2020-01-16 19:07:30,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-01-16 19:07:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1333 transitions. [2020-01-16 19:07:30,446 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1333 transitions. Word has length 22 [2020-01-16 19:07:30,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:30,446 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 1333 transitions. [2020-01-16 19:07:30,446 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:30,446 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1333 transitions. [2020-01-16 19:07:30,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:30,447 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:30,447 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:30,447 INFO L426 AbstractCegarLoop]: === Iteration 1280 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:30,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:30,447 INFO L82 PathProgramCache]: Analyzing trace with hash -2126364870, now seen corresponding path program 1274 times [2020-01-16 19:07:30,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:30,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979340423] [2020-01-16 19:07:30,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:30,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979340423] [2020-01-16 19:07:30,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:30,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:30,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654773132] [2020-01-16 19:07:30,699 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:30,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:30,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:30,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:30,700 INFO L87 Difference]: Start difference. First operand 390 states and 1333 transitions. Second operand 9 states. [2020-01-16 19:07:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:30,808 INFO L93 Difference]: Finished difference Result 624 states and 1817 transitions. [2020-01-16 19:07:30,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:30,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:30,809 INFO L225 Difference]: With dead ends: 624 [2020-01-16 19:07:30,810 INFO L226 Difference]: Without dead ends: 611 [2020-01-16 19:07:30,810 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:30,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-01-16 19:07:30,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 387. [2020-01-16 19:07:30,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:07:30,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1326 transitions. [2020-01-16 19:07:30,820 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1326 transitions. Word has length 22 [2020-01-16 19:07:30,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:30,820 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1326 transitions. [2020-01-16 19:07:30,820 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:30,820 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1326 transitions. [2020-01-16 19:07:30,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:30,821 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:30,821 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:30,821 INFO L426 AbstractCegarLoop]: === Iteration 1281 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:30,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:30,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1448969178, now seen corresponding path program 1275 times [2020-01-16 19:07:30,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:30,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323958996] [2020-01-16 19:07:30,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:31,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-01-16 19:07:31,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323958996] [2020-01-16 19:07:31,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:31,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:31,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848580472] [2020-01-16 19:07:31,087 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:31,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:31,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:31,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:31,088 INFO L87 Difference]: Start difference. First operand 387 states and 1326 transitions. Second operand 9 states. [2020-01-16 19:07:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:31,171 INFO L93 Difference]: Finished difference Result 639 states and 1849 transitions. [2020-01-16 19:07:31,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:31,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:31,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:31,173 INFO L225 Difference]: With dead ends: 639 [2020-01-16 19:07:31,173 INFO L226 Difference]: Without dead ends: 623 [2020-01-16 19:07:31,173 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:31,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-01-16 19:07:31,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 395. [2020-01-16 19:07:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-01-16 19:07:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1339 transitions. [2020-01-16 19:07:31,183 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1339 transitions. Word has length 22 [2020-01-16 19:07:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:31,183 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 1339 transitions. [2020-01-16 19:07:31,183 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1339 transitions. [2020-01-16 19:07:31,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:31,184 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:31,184 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:31,184 INFO L426 AbstractCegarLoop]: === Iteration 1282 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:31,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:31,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1318998732, now seen corresponding path program 1276 times [2020-01-16 19:07:31,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:31,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129442452] [2020-01-16 19:07:31,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:31,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-01-16 19:07:31,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129442452] [2020-01-16 19:07:31,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:31,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:31,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473454924] [2020-01-16 19:07:31,448 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:31,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:31,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:31,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:31,448 INFO L87 Difference]: Start difference. First operand 395 states and 1339 transitions. Second operand 9 states. [2020-01-16 19:07:31,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:31,562 INFO L93 Difference]: Finished difference Result 637 states and 1839 transitions. [2020-01-16 19:07:31,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:31,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:31,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:31,564 INFO L225 Difference]: With dead ends: 637 [2020-01-16 19:07:31,564 INFO L226 Difference]: Without dead ends: 615 [2020-01-16 19:07:31,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:31,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-01-16 19:07:31,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 387. [2020-01-16 19:07:31,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:07:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1322 transitions. [2020-01-16 19:07:31,573 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1322 transitions. Word has length 22 [2020-01-16 19:07:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:31,573 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1322 transitions. [2020-01-16 19:07:31,574 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1322 transitions. [2020-01-16 19:07:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:31,574 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:31,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, 1, 1, 1] [2020-01-16 19:07:31,574 INFO L426 AbstractCegarLoop]: === Iteration 1283 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:31,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:31,574 INFO L82 PathProgramCache]: Analyzing trace with hash 554607190, now seen corresponding path program 1277 times [2020-01-16 19:07:31,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:31,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562735044] [2020-01-16 19:07:31,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:31,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-01-16 19:07:31,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562735044] [2020-01-16 19:07:31,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:31,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:31,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447827215] [2020-01-16 19:07:31,821 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:31,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:31,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:31,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:31,822 INFO L87 Difference]: Start difference. First operand 387 states and 1322 transitions. Second operand 9 states. [2020-01-16 19:07:31,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:31,931 INFO L93 Difference]: Finished difference Result 621 states and 1808 transitions. [2020-01-16 19:07:31,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:31,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:31,933 INFO L225 Difference]: With dead ends: 621 [2020-01-16 19:07:31,933 INFO L226 Difference]: Without dead ends: 611 [2020-01-16 19:07:31,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:31,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-01-16 19:07:31,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 389. [2020-01-16 19:07:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:07:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1325 transitions. [2020-01-16 19:07:31,943 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1325 transitions. Word has length 22 [2020-01-16 19:07:31,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:31,943 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1325 transitions. [2020-01-16 19:07:31,943 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1325 transitions. [2020-01-16 19:07:31,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:31,943 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:31,944 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:31,944 INFO L426 AbstractCegarLoop]: === Iteration 1284 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:31,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:31,944 INFO L82 PathProgramCache]: Analyzing trace with hash -363343000, now seen corresponding path program 1278 times [2020-01-16 19:07:31,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:31,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977483090] [2020-01-16 19:07:31,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:32,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-01-16 19:07:32,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977483090] [2020-01-16 19:07:32,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:32,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:32,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911829699] [2020-01-16 19:07:32,191 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:32,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:32,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:32,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:32,191 INFO L87 Difference]: Start difference. First operand 389 states and 1325 transitions. Second operand 9 states. [2020-01-16 19:07:32,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:32,305 INFO L93 Difference]: Finished difference Result 625 states and 1814 transitions. [2020-01-16 19:07:32,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:32,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:32,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:32,306 INFO L225 Difference]: With dead ends: 625 [2020-01-16 19:07:32,307 INFO L226 Difference]: Without dead ends: 605 [2020-01-16 19:07:32,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:32,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-01-16 19:07:32,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 383. [2020-01-16 19:07:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:07:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1313 transitions. [2020-01-16 19:07:32,315 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1313 transitions. Word has length 22 [2020-01-16 19:07:32,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:32,315 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1313 transitions. [2020-01-16 19:07:32,315 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1313 transitions. [2020-01-16 19:07:32,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:32,316 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:32,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, 1, 1, 1] [2020-01-16 19:07:32,316 INFO L426 AbstractCegarLoop]: === Iteration 1285 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:32,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:32,316 INFO L82 PathProgramCache]: Analyzing trace with hash 761872870, now seen corresponding path program 1279 times [2020-01-16 19:07:32,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:32,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484463992] [2020-01-16 19:07:32,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:32,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-01-16 19:07:32,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484463992] [2020-01-16 19:07:32,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:32,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:32,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175196435] [2020-01-16 19:07:32,562 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:32,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:32,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:32,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:32,562 INFO L87 Difference]: Start difference. First operand 383 states and 1313 transitions. Second operand 9 states. [2020-01-16 19:07:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:32,646 INFO L93 Difference]: Finished difference Result 621 states and 1807 transitions. [2020-01-16 19:07:32,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:32,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:32,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:32,648 INFO L225 Difference]: With dead ends: 621 [2020-01-16 19:07:32,648 INFO L226 Difference]: Without dead ends: 605 [2020-01-16 19:07:32,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:32,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-01-16 19:07:32,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 389. [2020-01-16 19:07:32,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:07:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1327 transitions. [2020-01-16 19:07:32,657 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1327 transitions. Word has length 22 [2020-01-16 19:07:32,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:32,657 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1327 transitions. [2020-01-16 19:07:32,657 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:32,657 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1327 transitions. [2020-01-16 19:07:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:32,658 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:32,658 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:32,658 INFO L426 AbstractCegarLoop]: === Iteration 1286 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:32,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:32,658 INFO L82 PathProgramCache]: Analyzing trace with hash -200330792, now seen corresponding path program 1280 times [2020-01-16 19:07:32,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:32,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360214940] [2020-01-16 19:07:32,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:32,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-01-16 19:07:32,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360214940] [2020-01-16 19:07:32,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:32,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:32,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998554077] [2020-01-16 19:07:32,902 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:32,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:32,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:32,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:32,903 INFO L87 Difference]: Start difference. First operand 389 states and 1327 transitions. Second operand 9 states. [2020-01-16 19:07:33,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:33,016 INFO L93 Difference]: Finished difference Result 615 states and 1793 transitions. [2020-01-16 19:07:33,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:33,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:33,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:33,018 INFO L225 Difference]: With dead ends: 615 [2020-01-16 19:07:33,018 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:07:33,018 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:07:33,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 386. [2020-01-16 19:07:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:07:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1320 transitions. [2020-01-16 19:07:33,028 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1320 transitions. Word has length 22 [2020-01-16 19:07:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:33,028 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1320 transitions. [2020-01-16 19:07:33,028 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1320 transitions. [2020-01-16 19:07:33,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:33,028 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:33,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:33,028 INFO L426 AbstractCegarLoop]: === Iteration 1287 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:33,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:33,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1774565402, now seen corresponding path program 1281 times [2020-01-16 19:07:33,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:33,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548022494] [2020-01-16 19:07:33,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:33,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-01-16 19:07:33,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548022494] [2020-01-16 19:07:33,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:33,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:33,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785760416] [2020-01-16 19:07:33,291 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:33,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:33,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:33,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:33,291 INFO L87 Difference]: Start difference. First operand 386 states and 1320 transitions. Second operand 9 states. [2020-01-16 19:07:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:33,391 INFO L93 Difference]: Finished difference Result 617 states and 1800 transitions. [2020-01-16 19:07:33,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:33,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:33,393 INFO L225 Difference]: With dead ends: 617 [2020-01-16 19:07:33,393 INFO L226 Difference]: Without dead ends: 601 [2020-01-16 19:07:33,393 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-01-16 19:07:33,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 391. [2020-01-16 19:07:33,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-01-16 19:07:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1328 transitions. [2020-01-16 19:07:33,402 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1328 transitions. Word has length 22 [2020-01-16 19:07:33,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:33,402 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 1328 transitions. [2020-01-16 19:07:33,402 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1328 transitions. [2020-01-16 19:07:33,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:33,402 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:33,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, 1, 1, 1] [2020-01-16 19:07:33,403 INFO L426 AbstractCegarLoop]: === Iteration 1288 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:33,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:33,403 INFO L82 PathProgramCache]: Analyzing trace with hash -498485236, now seen corresponding path program 1282 times [2020-01-16 19:07:33,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:33,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659461834] [2020-01-16 19:07:33,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:33,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:33,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659461834] [2020-01-16 19:07:33,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:33,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:33,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004486412] [2020-01-16 19:07:33,663 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:33,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:33,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:33,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:33,663 INFO L87 Difference]: Start difference. First operand 391 states and 1328 transitions. Second operand 9 states. [2020-01-16 19:07:33,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:33,798 INFO L93 Difference]: Finished difference Result 604 states and 1780 transitions. [2020-01-16 19:07:33,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:33,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:33,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:33,800 INFO L225 Difference]: With dead ends: 604 [2020-01-16 19:07:33,800 INFO L226 Difference]: Without dead ends: 587 [2020-01-16 19:07:33,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-01-16 19:07:33,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 386. [2020-01-16 19:07:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:07:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1317 transitions. [2020-01-16 19:07:33,809 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1317 transitions. Word has length 22 [2020-01-16 19:07:33,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:33,809 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1317 transitions. [2020-01-16 19:07:33,809 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:33,809 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1317 transitions. [2020-01-16 19:07:33,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:33,810 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:33,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, 1, 1, 1] [2020-01-16 19:07:33,810 INFO L426 AbstractCegarLoop]: === Iteration 1289 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:33,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:33,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1803822924, now seen corresponding path program 1283 times [2020-01-16 19:07:33,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:33,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588883543] [2020-01-16 19:07:33,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:34,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-01-16 19:07:34,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588883543] [2020-01-16 19:07:34,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:34,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:34,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773298439] [2020-01-16 19:07:34,063 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:34,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:34,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:34,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:34,064 INFO L87 Difference]: Start difference. First operand 386 states and 1317 transitions. Second operand 9 states. [2020-01-16 19:07:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:34,173 INFO L93 Difference]: Finished difference Result 608 states and 1778 transitions. [2020-01-16 19:07:34,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:34,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:34,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:34,174 INFO L225 Difference]: With dead ends: 608 [2020-01-16 19:07:34,175 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:07:34,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:34,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:07:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 388. [2020-01-16 19:07:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-01-16 19:07:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1320 transitions. [2020-01-16 19:07:34,184 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1320 transitions. Word has length 22 [2020-01-16 19:07:34,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:34,184 INFO L478 AbstractCegarLoop]: Abstraction has 388 states and 1320 transitions. [2020-01-16 19:07:34,184 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:34,184 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1320 transitions. [2020-01-16 19:07:34,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:34,185 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:34,185 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:34,185 INFO L426 AbstractCegarLoop]: === Iteration 1290 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:34,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:34,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1977070616, now seen corresponding path program 1284 times [2020-01-16 19:07:34,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:34,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938100761] [2020-01-16 19:07:34,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:34,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938100761] [2020-01-16 19:07:34,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:34,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:34,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819046925] [2020-01-16 19:07:34,447 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:34,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:34,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:34,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:34,447 INFO L87 Difference]: Start difference. First operand 388 states and 1320 transitions. Second operand 9 states. [2020-01-16 19:07:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:34,567 INFO L93 Difference]: Finished difference Result 601 states and 1772 transitions. [2020-01-16 19:07:34,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:34,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:34,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:34,569 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:07:34,569 INFO L226 Difference]: Without dead ends: 584 [2020-01-16 19:07:34,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:34,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-01-16 19:07:34,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 383. [2020-01-16 19:07:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:07:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1310 transitions. [2020-01-16 19:07:34,578 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1310 transitions. Word has length 22 [2020-01-16 19:07:34,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:34,578 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1310 transitions. [2020-01-16 19:07:34,578 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1310 transitions. [2020-01-16 19:07:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:34,579 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:34,579 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:34,579 INFO L426 AbstractCegarLoop]: === Iteration 1291 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:34,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:34,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1517300698, now seen corresponding path program 1285 times [2020-01-16 19:07:34,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:34,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389090936] [2020-01-16 19:07:34,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:34,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:34,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389090936] [2020-01-16 19:07:34,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:34,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:34,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925501014] [2020-01-16 19:07:34,849 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:34,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:34,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:34,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:34,850 INFO L87 Difference]: Start difference. First operand 383 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:07:34,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:34,956 INFO L93 Difference]: Finished difference Result 639 states and 1849 transitions. [2020-01-16 19:07:34,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:34,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:34,958 INFO L225 Difference]: With dead ends: 639 [2020-01-16 19:07:34,958 INFO L226 Difference]: Without dead ends: 623 [2020-01-16 19:07:34,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:34,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-01-16 19:07:34,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 397. [2020-01-16 19:07:34,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-01-16 19:07:34,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1343 transitions. [2020-01-16 19:07:34,968 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1343 transitions. Word has length 22 [2020-01-16 19:07:34,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:34,968 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 1343 transitions. [2020-01-16 19:07:34,968 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:34,968 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1343 transitions. [2020-01-16 19:07:34,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:34,969 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:34,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, 1, 1, 1] [2020-01-16 19:07:34,969 INFO L426 AbstractCegarLoop]: === Iteration 1292 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:34,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:34,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1647271144, now seen corresponding path program 1286 times [2020-01-16 19:07:34,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:34,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505415821] [2020-01-16 19:07:34,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:35,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-01-16 19:07:35,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505415821] [2020-01-16 19:07:35,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:35,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:35,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644582661] [2020-01-16 19:07:35,242 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:35,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:35,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:35,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:35,243 INFO L87 Difference]: Start difference. First operand 397 states and 1343 transitions. Second operand 9 states. [2020-01-16 19:07:35,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:35,349 INFO L93 Difference]: Finished difference Result 637 states and 1839 transitions. [2020-01-16 19:07:35,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:35,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:35,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:35,350 INFO L225 Difference]: With dead ends: 637 [2020-01-16 19:07:35,350 INFO L226 Difference]: Without dead ends: 615 [2020-01-16 19:07:35,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:35,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-01-16 19:07:35,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 389. [2020-01-16 19:07:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:07:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1324 transitions. [2020-01-16 19:07:35,359 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1324 transitions. Word has length 22 [2020-01-16 19:07:35,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:35,360 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1324 transitions. [2020-01-16 19:07:35,360 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:35,360 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1324 transitions. [2020-01-16 19:07:35,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:35,360 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:35,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, 1, 1, 1] [2020-01-16 19:07:35,360 INFO L426 AbstractCegarLoop]: === Iteration 1293 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:35,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:35,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1177228744, now seen corresponding path program 1287 times [2020-01-16 19:07:35,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:35,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769159654] [2020-01-16 19:07:35,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:35,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:35,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769159654] [2020-01-16 19:07:35,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:35,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:35,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966553775] [2020-01-16 19:07:35,630 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:35,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:35,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:35,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:35,631 INFO L87 Difference]: Start difference. First operand 389 states and 1324 transitions. Second operand 9 states. [2020-01-16 19:07:35,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:35,715 INFO L93 Difference]: Finished difference Result 626 states and 1818 transitions. [2020-01-16 19:07:35,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:35,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:35,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:35,717 INFO L225 Difference]: With dead ends: 626 [2020-01-16 19:07:35,717 INFO L226 Difference]: Without dead ends: 610 [2020-01-16 19:07:35,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-01-16 19:07:35,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 394. [2020-01-16 19:07:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-01-16 19:07:35,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1332 transitions. [2020-01-16 19:07:35,727 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1332 transitions. Word has length 22 [2020-01-16 19:07:35,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:35,727 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 1332 transitions. [2020-01-16 19:07:35,727 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:35,727 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1332 transitions. [2020-01-16 19:07:35,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:35,728 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:35,728 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:35,728 INFO L426 AbstractCegarLoop]: === Iteration 1294 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:35,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:35,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1095821894, now seen corresponding path program 1288 times [2020-01-16 19:07:35,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:35,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135400047] [2020-01-16 19:07:35,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:35,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135400047] [2020-01-16 19:07:35,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:35,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:35,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669466718] [2020-01-16 19:07:35,994 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:35,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:35,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:35,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:35,994 INFO L87 Difference]: Start difference. First operand 394 states and 1332 transitions. Second operand 9 states. [2020-01-16 19:07:36,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:36,103 INFO L93 Difference]: Finished difference Result 613 states and 1798 transitions. [2020-01-16 19:07:36,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:36,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:36,105 INFO L225 Difference]: With dead ends: 613 [2020-01-16 19:07:36,105 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 19:07:36,105 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:36,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 19:07:36,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 389. [2020-01-16 19:07:36,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:07:36,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1319 transitions. [2020-01-16 19:07:36,115 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1319 transitions. Word has length 22 [2020-01-16 19:07:36,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:36,115 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1319 transitions. [2020-01-16 19:07:36,115 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:36,115 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1319 transitions. [2020-01-16 19:07:36,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:36,115 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:36,116 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:36,116 INFO L426 AbstractCegarLoop]: === Iteration 1295 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:36,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:36,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1731090820, now seen corresponding path program 1289 times [2020-01-16 19:07:36,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:36,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661785776] [2020-01-16 19:07:36,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:36,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-01-16 19:07:36,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661785776] [2020-01-16 19:07:36,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:36,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:36,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706143934] [2020-01-16 19:07:36,369 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:36,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:36,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:36,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:36,369 INFO L87 Difference]: Start difference. First operand 389 states and 1319 transitions. Second operand 9 states. [2020-01-16 19:07:36,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:36,509 INFO L93 Difference]: Finished difference Result 623 states and 1808 transitions. [2020-01-16 19:07:36,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:36,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:36,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:36,511 INFO L225 Difference]: With dead ends: 623 [2020-01-16 19:07:36,511 INFO L226 Difference]: Without dead ends: 609 [2020-01-16 19:07:36,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:36,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-01-16 19:07:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 393. [2020-01-16 19:07:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-01-16 19:07:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1326 transitions. [2020-01-16 19:07:36,520 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1326 transitions. Word has length 22 [2020-01-16 19:07:36,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:36,521 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 1326 transitions. [2020-01-16 19:07:36,521 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1326 transitions. [2020-01-16 19:07:36,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:36,521 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:36,521 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:36,521 INFO L426 AbstractCegarLoop]: === Iteration 1296 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:36,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:36,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1705001946, now seen corresponding path program 1290 times [2020-01-16 19:07:36,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:36,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210645718] [2020-01-16 19:07:36,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:36,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210645718] [2020-01-16 19:07:36,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:36,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:36,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097008807] [2020-01-16 19:07:36,780 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:36,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:36,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:36,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:36,780 INFO L87 Difference]: Start difference. First operand 393 states and 1326 transitions. Second operand 9 states. [2020-01-16 19:07:36,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:36,896 INFO L93 Difference]: Finished difference Result 612 states and 1792 transitions. [2020-01-16 19:07:36,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:36,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:36,898 INFO L225 Difference]: With dead ends: 612 [2020-01-16 19:07:36,898 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 19:07:36,898 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 19:07:36,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 383. [2020-01-16 19:07:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:07:36,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1306 transitions. [2020-01-16 19:07:36,907 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1306 transitions. Word has length 22 [2020-01-16 19:07:36,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:36,907 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1306 transitions. [2020-01-16 19:07:36,907 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:36,907 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1306 transitions. [2020-01-16 19:07:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:36,908 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:36,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, 1, 1, 1] [2020-01-16 19:07:36,908 INFO L426 AbstractCegarLoop]: === Iteration 1297 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:36,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:36,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1909008646, now seen corresponding path program 1291 times [2020-01-16 19:07:36,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:36,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229769170] [2020-01-16 19:07:36,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:37,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-01-16 19:07:37,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229769170] [2020-01-16 19:07:37,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:37,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:37,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904302741] [2020-01-16 19:07:37,141 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:37,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:37,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:37,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:37,141 INFO L87 Difference]: Start difference. First operand 383 states and 1306 transitions. Second operand 9 states. [2020-01-16 19:07:37,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:37,260 INFO L93 Difference]: Finished difference Result 608 states and 1776 transitions. [2020-01-16 19:07:37,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:37,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:37,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:37,262 INFO L225 Difference]: With dead ends: 608 [2020-01-16 19:07:37,262 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:07:37,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:37,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:07:37,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 387. [2020-01-16 19:07:37,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:07:37,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1316 transitions. [2020-01-16 19:07:37,272 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1316 transitions. Word has length 22 [2020-01-16 19:07:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:37,272 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1316 transitions. [2020-01-16 19:07:37,272 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:37,272 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1316 transitions. [2020-01-16 19:07:37,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:37,273 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:37,273 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:37,273 INFO L426 AbstractCegarLoop]: === Iteration 1298 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:37,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:37,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1468008460, now seen corresponding path program 1292 times [2020-01-16 19:07:37,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:37,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88042733] [2020-01-16 19:07:37,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:37,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-01-16 19:07:37,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88042733] [2020-01-16 19:07:37,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:37,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:37,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566620755] [2020-01-16 19:07:37,505 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:37,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:37,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:37,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:37,505 INFO L87 Difference]: Start difference. First operand 387 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:07:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:37,619 INFO L93 Difference]: Finished difference Result 612 states and 1782 transitions. [2020-01-16 19:07:37,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:37,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:37,620 INFO L225 Difference]: With dead ends: 612 [2020-01-16 19:07:37,621 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 19:07:37,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:37,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 19:07:37,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 385. [2020-01-16 19:07:37,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:07:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1311 transitions. [2020-01-16 19:07:37,629 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1311 transitions. Word has length 22 [2020-01-16 19:07:37,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:37,629 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1311 transitions. [2020-01-16 19:07:37,630 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1311 transitions. [2020-01-16 19:07:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:37,630 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:37,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, 1, 1, 1] [2020-01-16 19:07:37,630 INFO L426 AbstractCegarLoop]: === Iteration 1299 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:37,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:37,630 INFO L82 PathProgramCache]: Analyzing trace with hash -298067688, now seen corresponding path program 1293 times [2020-01-16 19:07:37,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:37,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157695922] [2020-01-16 19:07:37,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:37,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-01-16 19:07:37,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157695922] [2020-01-16 19:07:37,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:37,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:37,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845332453] [2020-01-16 19:07:37,869 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:37,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:37,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:37,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:37,869 INFO L87 Difference]: Start difference. First operand 385 states and 1311 transitions. Second operand 9 states. [2020-01-16 19:07:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:37,980 INFO L93 Difference]: Finished difference Result 604 states and 1767 transitions. [2020-01-16 19:07:37,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:37,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:37,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:37,982 INFO L225 Difference]: With dead ends: 604 [2020-01-16 19:07:37,982 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:07:37,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:37,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:07:37,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 387. [2020-01-16 19:07:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-01-16 19:07:37,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1314 transitions. [2020-01-16 19:07:37,999 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1314 transitions. Word has length 22 [2020-01-16 19:07:37,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:37,999 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 1314 transitions. [2020-01-16 19:07:37,999 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:37,999 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1314 transitions. [2020-01-16 19:07:37,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:37,999 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:37,999 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:38,000 INFO L426 AbstractCegarLoop]: === Iteration 1300 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:38,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:38,000 INFO L82 PathProgramCache]: Analyzing trace with hash -471315380, now seen corresponding path program 1294 times [2020-01-16 19:07:38,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:38,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804921632] [2020-01-16 19:07:38,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:38,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:38,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804921632] [2020-01-16 19:07:38,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:38,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:38,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523879817] [2020-01-16 19:07:38,237 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:38,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:38,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:38,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:38,237 INFO L87 Difference]: Start difference. First operand 387 states and 1314 transitions. Second operand 9 states. [2020-01-16 19:07:38,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:38,352 INFO L93 Difference]: Finished difference Result 597 states and 1761 transitions. [2020-01-16 19:07:38,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:38,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:38,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:38,354 INFO L225 Difference]: With dead ends: 597 [2020-01-16 19:07:38,354 INFO L226 Difference]: Without dead ends: 583 [2020-01-16 19:07:38,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:38,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-01-16 19:07:38,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 385. [2020-01-16 19:07:38,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:07:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1309 transitions. [2020-01-16 19:07:38,363 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1309 transitions. Word has length 22 [2020-01-16 19:07:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:38,364 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1309 transitions. [2020-01-16 19:07:38,364 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1309 transitions. [2020-01-16 19:07:38,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:38,364 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:38,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:38,364 INFO L426 AbstractCegarLoop]: === Iteration 1301 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:38,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:38,365 INFO L82 PathProgramCache]: Analyzing trace with hash 392297304, now seen corresponding path program 1295 times [2020-01-16 19:07:38,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:38,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498943999] [2020-01-16 19:07:38,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:38,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498943999] [2020-01-16 19:07:38,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:38,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:38,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384462171] [2020-01-16 19:07:38,601 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:38,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:38,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:38,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:38,601 INFO L87 Difference]: Start difference. First operand 385 states and 1309 transitions. Second operand 9 states. [2020-01-16 19:07:38,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:38,714 INFO L93 Difference]: Finished difference Result 610 states and 1779 transitions. [2020-01-16 19:07:38,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:38,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:38,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:38,715 INFO L225 Difference]: With dead ends: 610 [2020-01-16 19:07:38,716 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 19:07:38,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:38,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 19:07:38,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 389. [2020-01-16 19:07:38,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-01-16 19:07:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1316 transitions. [2020-01-16 19:07:38,724 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1316 transitions. Word has length 22 [2020-01-16 19:07:38,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:38,725 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 1316 transitions. [2020-01-16 19:07:38,725 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:38,725 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1316 transitions. [2020-01-16 19:07:38,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:38,725 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:38,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, 1, 1, 1] [2020-01-16 19:07:38,725 INFO L426 AbstractCegarLoop]: === Iteration 1302 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:38,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:38,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1136999802, now seen corresponding path program 1296 times [2020-01-16 19:07:38,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:38,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967580938] [2020-01-16 19:07:38,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:38,862 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-01-16 19:07:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:39,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967580938] [2020-01-16 19:07:39,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:39,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:39,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562775816] [2020-01-16 19:07:39,068 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:39,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:39,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:39,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:39,068 INFO L87 Difference]: Start difference. First operand 389 states and 1316 transitions. Second operand 9 states. [2020-01-16 19:07:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:39,188 INFO L93 Difference]: Finished difference Result 599 states and 1763 transitions. [2020-01-16 19:07:39,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:39,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:39,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:39,190 INFO L225 Difference]: With dead ends: 599 [2020-01-16 19:07:39,190 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:07:39,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:39,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:07:39,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 379. [2020-01-16 19:07:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:07:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-01-16 19:07:39,199 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-01-16 19:07:39,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:39,199 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-01-16 19:07:39,199 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-01-16 19:07:39,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:39,200 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:39,200 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:39,200 INFO L426 AbstractCegarLoop]: === Iteration 1303 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:39,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:39,200 INFO L82 PathProgramCache]: Analyzing trace with hash -893761222, now seen corresponding path program 1297 times [2020-01-16 19:07:39,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:39,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770383870] [2020-01-16 19:07:39,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:39,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:39,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770383870] [2020-01-16 19:07:39,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:39,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:39,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975018030] [2020-01-16 19:07:39,467 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:39,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:39,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:39,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:39,467 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:07:39,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:39,564 INFO L93 Difference]: Finished difference Result 565 states and 1669 transitions. [2020-01-16 19:07:39,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:39,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:39,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:39,566 INFO L225 Difference]: With dead ends: 565 [2020-01-16 19:07:39,566 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:07:39,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:39,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:07:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 382. [2020-01-16 19:07:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:39,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1306 transitions. [2020-01-16 19:07:39,575 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1306 transitions. Word has length 22 [2020-01-16 19:07:39,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:39,575 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1306 transitions. [2020-01-16 19:07:39,575 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:39,575 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1306 transitions. [2020-01-16 19:07:39,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:39,576 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:39,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, 1, 1, 1] [2020-01-16 19:07:39,576 INFO L426 AbstractCegarLoop]: === Iteration 1304 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:39,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:39,576 INFO L82 PathProgramCache]: Analyzing trace with hash 717179736, now seen corresponding path program 1298 times [2020-01-16 19:07:39,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:39,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86122994] [2020-01-16 19:07:39,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:39,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-01-16 19:07:39,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86122994] [2020-01-16 19:07:39,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:39,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:39,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437773738] [2020-01-16 19:07:39,843 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:39,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:39,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:39,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:39,843 INFO L87 Difference]: Start difference. First operand 382 states and 1306 transitions. Second operand 9 states. [2020-01-16 19:07:39,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:39,950 INFO L93 Difference]: Finished difference Result 566 states and 1670 transitions. [2020-01-16 19:07:39,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:39,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:39,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:39,951 INFO L225 Difference]: With dead ends: 566 [2020-01-16 19:07:39,951 INFO L226 Difference]: Without dead ends: 555 [2020-01-16 19:07:39,952 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:39,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-01-16 19:07:39,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 381. [2020-01-16 19:07:39,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:07:39,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1304 transitions. [2020-01-16 19:07:39,960 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1304 transitions. Word has length 22 [2020-01-16 19:07:39,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:39,960 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1304 transitions. [2020-01-16 19:07:39,960 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1304 transitions. [2020-01-16 19:07:39,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:39,961 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:39,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, 1, 1, 1] [2020-01-16 19:07:39,961 INFO L426 AbstractCegarLoop]: === Iteration 1305 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:39,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:39,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1719369164, now seen corresponding path program 1299 times [2020-01-16 19:07:39,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:39,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588519925] [2020-01-16 19:07:39,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:40,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-01-16 19:07:40,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588519925] [2020-01-16 19:07:40,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:40,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:40,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522164406] [2020-01-16 19:07:40,215 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:40,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:40,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:40,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:40,215 INFO L87 Difference]: Start difference. First operand 381 states and 1304 transitions. Second operand 9 states. [2020-01-16 19:07:40,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:40,296 INFO L93 Difference]: Finished difference Result 569 states and 1676 transitions. [2020-01-16 19:07:40,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:40,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:40,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:40,297 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:07:40,298 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:07:40,298 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:07:40,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-01-16 19:07:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:40,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1305 transitions. [2020-01-16 19:07:40,306 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1305 transitions. Word has length 22 [2020-01-16 19:07:40,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:40,306 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1305 transitions. [2020-01-16 19:07:40,306 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1305 transitions. [2020-01-16 19:07:40,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:40,307 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:40,307 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:40,307 INFO L426 AbstractCegarLoop]: === Iteration 1306 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:40,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:40,307 INFO L82 PathProgramCache]: Analyzing trace with hash 643658008, now seen corresponding path program 1300 times [2020-01-16 19:07:40,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:40,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482969422] [2020-01-16 19:07:40,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:40,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482969422] [2020-01-16 19:07:40,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:40,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:40,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264659157] [2020-01-16 19:07:40,552 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:40,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:40,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:40,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:40,552 INFO L87 Difference]: Start difference. First operand 382 states and 1305 transitions. Second operand 9 states. [2020-01-16 19:07:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:40,664 INFO L93 Difference]: Finished difference Result 574 states and 1685 transitions. [2020-01-16 19:07:40,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:40,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:40,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:40,665 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:07:40,666 INFO L226 Difference]: Without dead ends: 559 [2020-01-16 19:07:40,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:40,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-01-16 19:07:40,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 381. [2020-01-16 19:07:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:07:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1303 transitions. [2020-01-16 19:07:40,674 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1303 transitions. Word has length 22 [2020-01-16 19:07:40,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:40,674 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1303 transitions. [2020-01-16 19:07:40,674 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:40,674 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1303 transitions. [2020-01-16 19:07:40,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:40,675 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:40,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, 1, 1, 1] [2020-01-16 19:07:40,675 INFO L426 AbstractCegarLoop]: === Iteration 1307 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:40,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:40,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1729872268, now seen corresponding path program 1301 times [2020-01-16 19:07:40,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:40,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498214318] [2020-01-16 19:07:40,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:40,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-01-16 19:07:40,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498214318] [2020-01-16 19:07:40,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:40,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:40,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014455598] [2020-01-16 19:07:40,919 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:40,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:40,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:40,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:40,919 INFO L87 Difference]: Start difference. First operand 381 states and 1303 transitions. Second operand 9 states. [2020-01-16 19:07:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:41,024 INFO L93 Difference]: Finished difference Result 572 states and 1682 transitions. [2020-01-16 19:07:41,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:41,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:41,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:41,026 INFO L225 Difference]: With dead ends: 572 [2020-01-16 19:07:41,026 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:07:41,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:41,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:07:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 383. [2020-01-16 19:07:41,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:07:41,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1306 transitions. [2020-01-16 19:07:41,036 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1306 transitions. Word has length 22 [2020-01-16 19:07:41,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:41,036 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1306 transitions. [2020-01-16 19:07:41,036 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:41,036 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1306 transitions. [2020-01-16 19:07:41,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:41,037 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:41,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, 1, 1, 1] [2020-01-16 19:07:41,037 INFO L426 AbstractCegarLoop]: === Iteration 1308 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:41,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:41,037 INFO L82 PathProgramCache]: Analyzing trace with hash -956779846, now seen corresponding path program 1302 times [2020-01-16 19:07:41,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:41,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835572972] [2020-01-16 19:07:41,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:41,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-01-16 19:07:41,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835572972] [2020-01-16 19:07:41,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:41,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:41,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280905149] [2020-01-16 19:07:41,280 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:41,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:41,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:41,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:41,281 INFO L87 Difference]: Start difference. First operand 383 states and 1306 transitions. Second operand 9 states. [2020-01-16 19:07:41,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:41,384 INFO L93 Difference]: Finished difference Result 576 states and 1688 transitions. [2020-01-16 19:07:41,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:41,384 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:41,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:41,385 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:07:41,385 INFO L226 Difference]: Without dead ends: 559 [2020-01-16 19:07:41,386 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:41,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-01-16 19:07:41,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 380. [2020-01-16 19:07:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:07:41,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-01-16 19:07:41,395 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-01-16 19:07:41,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:41,395 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-01-16 19:07:41,395 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:41,395 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-01-16 19:07:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:41,396 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:41,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, 1, 1, 1] [2020-01-16 19:07:41,396 INFO L426 AbstractCegarLoop]: === Iteration 1309 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:41,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:41,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1032272856, now seen corresponding path program 1303 times [2020-01-16 19:07:41,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:41,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413854893] [2020-01-16 19:07:41,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:41,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-01-16 19:07:41,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413854893] [2020-01-16 19:07:41,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:41,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:41,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829470576] [2020-01-16 19:07:41,671 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:41,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:41,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:41,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:41,671 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-01-16 19:07:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:41,758 INFO L93 Difference]: Finished difference Result 562 states and 1662 transitions. [2020-01-16 19:07:41,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:41,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:41,760 INFO L225 Difference]: With dead ends: 562 [2020-01-16 19:07:41,760 INFO L226 Difference]: Without dead ends: 553 [2020-01-16 19:07:41,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:41,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-01-16 19:07:41,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 382. [2020-01-16 19:07:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:41,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1305 transitions. [2020-01-16 19:07:41,768 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1305 transitions. Word has length 22 [2020-01-16 19:07:41,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:41,768 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1305 transitions. [2020-01-16 19:07:41,768 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:41,769 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1305 transitions. [2020-01-16 19:07:41,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:41,769 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:41,769 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:41,769 INFO L426 AbstractCegarLoop]: === Iteration 1310 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:41,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:41,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1651753482, now seen corresponding path program 1304 times [2020-01-16 19:07:41,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:41,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30733894] [2020-01-16 19:07:41,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:42,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:42,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30733894] [2020-01-16 19:07:42,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:42,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:42,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898045935] [2020-01-16 19:07:42,041 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:42,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:42,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:42,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:42,041 INFO L87 Difference]: Start difference. First operand 382 states and 1305 transitions. Second operand 9 states. [2020-01-16 19:07:42,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:42,146 INFO L93 Difference]: Finished difference Result 563 states and 1663 transitions. [2020-01-16 19:07:42,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:42,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:42,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:42,148 INFO L225 Difference]: With dead ends: 563 [2020-01-16 19:07:42,148 INFO L226 Difference]: Without dead ends: 552 [2020-01-16 19:07:42,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-01-16 19:07:42,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 381. [2020-01-16 19:07:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:07:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1303 transitions. [2020-01-16 19:07:42,157 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1303 transitions. Word has length 22 [2020-01-16 19:07:42,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:42,158 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1303 transitions. [2020-01-16 19:07:42,158 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:42,158 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1303 transitions. [2020-01-16 19:07:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:42,158 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:42,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, 1, 1, 1] [2020-01-16 19:07:42,158 INFO L426 AbstractCegarLoop]: === Iteration 1311 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:42,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:42,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2044965388, now seen corresponding path program 1305 times [2020-01-16 19:07:42,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:42,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432395403] [2020-01-16 19:07:42,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:42,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-01-16 19:07:42,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432395403] [2020-01-16 19:07:42,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:42,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:42,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034216502] [2020-01-16 19:07:42,424 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:42,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:42,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:42,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:42,425 INFO L87 Difference]: Start difference. First operand 381 states and 1303 transitions. Second operand 9 states. [2020-01-16 19:07:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:42,503 INFO L93 Difference]: Finished difference Result 563 states and 1664 transitions. [2020-01-16 19:07:42,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:42,504 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:42,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:42,505 INFO L225 Difference]: With dead ends: 563 [2020-01-16 19:07:42,505 INFO L226 Difference]: Without dead ends: 554 [2020-01-16 19:07:42,505 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:42,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-01-16 19:07:42,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 382. [2020-01-16 19:07:42,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:42,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1304 transitions. [2020-01-16 19:07:42,514 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1304 transitions. Word has length 22 [2020-01-16 19:07:42,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:42,514 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1304 transitions. [2020-01-16 19:07:42,514 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:42,514 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1304 transitions. [2020-01-16 19:07:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:42,514 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:42,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, 1, 1, 1] [2020-01-16 19:07:42,515 INFO L426 AbstractCegarLoop]: === Iteration 1312 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:42,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:42,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1714772106, now seen corresponding path program 1306 times [2020-01-16 19:07:42,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:42,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640080967] [2020-01-16 19:07:42,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:42,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-01-16 19:07:42,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640080967] [2020-01-16 19:07:42,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:42,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:42,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626172478] [2020-01-16 19:07:42,776 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:42,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:42,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:42,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:42,777 INFO L87 Difference]: Start difference. First operand 382 states and 1304 transitions. Second operand 9 states. [2020-01-16 19:07:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:42,877 INFO L93 Difference]: Finished difference Result 557 states and 1661 transitions. [2020-01-16 19:07:42,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:42,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:42,878 INFO L225 Difference]: With dead ends: 557 [2020-01-16 19:07:42,878 INFO L226 Difference]: Without dead ends: 544 [2020-01-16 19:07:42,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:42,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-01-16 19:07:42,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 381. [2020-01-16 19:07:42,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:07:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1302 transitions. [2020-01-16 19:07:42,887 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1302 transitions. Word has length 22 [2020-01-16 19:07:42,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:42,887 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1302 transitions. [2020-01-16 19:07:42,887 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:42,887 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1302 transitions. [2020-01-16 19:07:42,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:42,888 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:42,888 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:42,888 INFO L426 AbstractCegarLoop]: === Iteration 1313 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:42,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:42,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2055468492, now seen corresponding path program 1307 times [2020-01-16 19:07:42,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:42,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70412924] [2020-01-16 19:07:42,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:43,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70412924] [2020-01-16 19:07:43,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:43,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:43,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571687] [2020-01-16 19:07:43,147 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:43,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:43,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:43,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:43,148 INFO L87 Difference]: Start difference. First operand 381 states and 1302 transitions. Second operand 9 states. [2020-01-16 19:07:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:43,247 INFO L93 Difference]: Finished difference Result 565 states and 1668 transitions. [2020-01-16 19:07:43,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:43,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:43,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:43,249 INFO L225 Difference]: With dead ends: 565 [2020-01-16 19:07:43,249 INFO L226 Difference]: Without dead ends: 555 [2020-01-16 19:07:43,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:43,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-01-16 19:07:43,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 383. [2020-01-16 19:07:43,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:07:43,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1305 transitions. [2020-01-16 19:07:43,258 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1305 transitions. Word has length 22 [2020-01-16 19:07:43,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:43,258 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1305 transitions. [2020-01-16 19:07:43,258 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:43,258 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1305 transitions. [2020-01-16 19:07:43,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:43,259 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:43,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, 1, 1, 1] [2020-01-16 19:07:43,259 INFO L426 AbstractCegarLoop]: === Iteration 1314 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:43,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:43,259 INFO L82 PathProgramCache]: Analyzing trace with hash 979757336, now seen corresponding path program 1308 times [2020-01-16 19:07:43,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:43,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725163745] [2020-01-16 19:07:43,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:43,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-01-16 19:07:43,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725163745] [2020-01-16 19:07:43,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:43,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:43,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837222655] [2020-01-16 19:07:43,517 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:43,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:43,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:43,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:43,518 INFO L87 Difference]: Start difference. First operand 383 states and 1305 transitions. Second operand 9 states. [2020-01-16 19:07:43,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:43,626 INFO L93 Difference]: Finished difference Result 558 states and 1662 transitions. [2020-01-16 19:07:43,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:43,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:43,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:43,628 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:07:43,628 INFO L226 Difference]: Without dead ends: 543 [2020-01-16 19:07:43,628 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:43,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-01-16 19:07:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 380. [2020-01-16 19:07:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:07:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1300 transitions. [2020-01-16 19:07:43,636 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1300 transitions. Word has length 22 [2020-01-16 19:07:43,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:43,637 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1300 transitions. [2020-01-16 19:07:43,637 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1300 transitions. [2020-01-16 19:07:43,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:43,637 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:43,637 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:43,637 INFO L426 AbstractCegarLoop]: === Iteration 1315 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:43,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:43,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1246900712, now seen corresponding path program 1309 times [2020-01-16 19:07:43,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:43,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151453195] [2020-01-16 19:07:43,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:43,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-01-16 19:07:43,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151453195] [2020-01-16 19:07:43,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:43,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:43,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825821264] [2020-01-16 19:07:43,886 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:43,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:43,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:43,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:43,886 INFO L87 Difference]: Start difference. First operand 380 states and 1300 transitions. Second operand 9 states. [2020-01-16 19:07:43,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:43,962 INFO L93 Difference]: Finished difference Result 572 states and 1683 transitions. [2020-01-16 19:07:43,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:43,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:43,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:43,963 INFO L225 Difference]: With dead ends: 572 [2020-01-16 19:07:43,963 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:07:43,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:43,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:07:43,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 382. [2020-01-16 19:07:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1304 transitions. [2020-01-16 19:07:43,972 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1304 transitions. Word has length 22 [2020-01-16 19:07:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:43,972 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1304 transitions. [2020-01-16 19:07:43,972 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1304 transitions. [2020-01-16 19:07:43,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:43,973 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:43,973 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:43,973 INFO L426 AbstractCegarLoop]: === Iteration 1316 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:43,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:43,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1972355428, now seen corresponding path program 1310 times [2020-01-16 19:07:43,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:43,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727253865] [2020-01-16 19:07:43,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:44,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-01-16 19:07:44,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727253865] [2020-01-16 19:07:44,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:44,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:44,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436100216] [2020-01-16 19:07:44,215 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:44,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:44,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:44,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:44,216 INFO L87 Difference]: Start difference. First operand 382 states and 1304 transitions. Second operand 9 states. [2020-01-16 19:07:44,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:44,324 INFO L93 Difference]: Finished difference Result 577 states and 1692 transitions. [2020-01-16 19:07:44,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:44,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:44,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:44,325 INFO L225 Difference]: With dead ends: 577 [2020-01-16 19:07:44,325 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:07:44,326 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:44,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:07:44,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 381. [2020-01-16 19:07:44,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:07:44,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1302 transitions. [2020-01-16 19:07:44,333 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1302 transitions. Word has length 22 [2020-01-16 19:07:44,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:44,334 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1302 transitions. [2020-01-16 19:07:44,334 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:44,334 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1302 transitions. [2020-01-16 19:07:44,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:44,334 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:44,334 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:44,334 INFO L426 AbstractCegarLoop]: === Iteration 1317 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:44,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:44,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1447628730, now seen corresponding path program 1311 times [2020-01-16 19:07:44,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:44,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427182014] [2020-01-16 19:07:44,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:44,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-01-16 19:07:44,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427182014] [2020-01-16 19:07:44,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:44,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:44,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816480390] [2020-01-16 19:07:44,591 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:44,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:44,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:44,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:44,591 INFO L87 Difference]: Start difference. First operand 381 states and 1302 transitions. Second operand 9 states. [2020-01-16 19:07:44,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:44,675 INFO L93 Difference]: Finished difference Result 569 states and 1677 transitions. [2020-01-16 19:07:44,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:44,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:44,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:44,677 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:07:44,677 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:07:44,677 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:44,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:07:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 382. [2020-01-16 19:07:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1303 transitions. [2020-01-16 19:07:44,685 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1303 transitions. Word has length 22 [2020-01-16 19:07:44,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:44,685 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1303 transitions. [2020-01-16 19:07:44,685 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:44,685 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1303 transitions. [2020-01-16 19:07:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:44,686 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:44,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, 1, 1, 1] [2020-01-16 19:07:44,686 INFO L426 AbstractCegarLoop]: === Iteration 1318 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:44,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1982858532, now seen corresponding path program 1312 times [2020-01-16 19:07:44,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:44,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070857413] [2020-01-16 19:07:44,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:44,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-01-16 19:07:44,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070857413] [2020-01-16 19:07:44,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:44,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:44,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084488120] [2020-01-16 19:07:44,935 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:44,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:44,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:44,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:44,935 INFO L87 Difference]: Start difference. First operand 382 states and 1303 transitions. Second operand 9 states. [2020-01-16 19:07:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:45,037 INFO L93 Difference]: Finished difference Result 563 states and 1674 transitions. [2020-01-16 19:07:45,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:45,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:45,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:45,038 INFO L225 Difference]: With dead ends: 563 [2020-01-16 19:07:45,039 INFO L226 Difference]: Without dead ends: 550 [2020-01-16 19:07:45,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:45,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-01-16 19:07:45,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 381. [2020-01-16 19:07:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:07:45,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1301 transitions. [2020-01-16 19:07:45,047 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1301 transitions. Word has length 22 [2020-01-16 19:07:45,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:45,047 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1301 transitions. [2020-01-16 19:07:45,047 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:45,047 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1301 transitions. [2020-01-16 19:07:45,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:45,047 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:45,048 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:45,048 INFO L426 AbstractCegarLoop]: === Iteration 1319 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:45,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:45,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1384610106, now seen corresponding path program 1313 times [2020-01-16 19:07:45,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:45,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659757314] [2020-01-16 19:07:45,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:45,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659757314] [2020-01-16 19:07:45,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:45,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:45,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606603290] [2020-01-16 19:07:45,295 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:45,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:45,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:45,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:45,296 INFO L87 Difference]: Start difference. First operand 381 states and 1301 transitions. Second operand 9 states. [2020-01-16 19:07:45,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:45,396 INFO L93 Difference]: Finished difference Result 577 states and 1695 transitions. [2020-01-16 19:07:45,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:45,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:45,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:45,398 INFO L225 Difference]: With dead ends: 577 [2020-01-16 19:07:45,398 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:07:45,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:45,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:07:45,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 385. [2020-01-16 19:07:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:07:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1308 transitions. [2020-01-16 19:07:45,408 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1308 transitions. Word has length 22 [2020-01-16 19:07:45,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:45,408 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1308 transitions. [2020-01-16 19:07:45,408 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:45,408 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1308 transitions. [2020-01-16 19:07:45,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:45,408 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:45,408 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:45,408 INFO L426 AbstractCegarLoop]: === Iteration 1320 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:45,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:45,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1299416232, now seen corresponding path program 1314 times [2020-01-16 19:07:45,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:45,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136660855] [2020-01-16 19:07:45,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:45,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136660855] [2020-01-16 19:07:45,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:45,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:45,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827709438] [2020-01-16 19:07:45,657 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:45,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:45,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:45,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:45,658 INFO L87 Difference]: Start difference. First operand 385 states and 1308 transitions. Second operand 9 states. [2020-01-16 19:07:45,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:45,760 INFO L93 Difference]: Finished difference Result 566 states and 1679 transitions. [2020-01-16 19:07:45,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:45,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:45,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:45,762 INFO L225 Difference]: With dead ends: 566 [2020-01-16 19:07:45,762 INFO L226 Difference]: Without dead ends: 549 [2020-01-16 19:07:45,762 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-01-16 19:07:45,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 380. [2020-01-16 19:07:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:07:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1299 transitions. [2020-01-16 19:07:45,771 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1299 transitions. Word has length 22 [2020-01-16 19:07:45,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:45,771 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1299 transitions. [2020-01-16 19:07:45,771 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:45,771 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1299 transitions. [2020-01-16 19:07:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:45,771 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:45,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, 1, 1, 1] [2020-01-16 19:07:45,772 INFO L426 AbstractCegarLoop]: === Iteration 1321 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:45,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:45,772 INFO L82 PathProgramCache]: Analyzing trace with hash 689636470, now seen corresponding path program 1315 times [2020-01-16 19:07:45,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:45,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941962831] [2020-01-16 19:07:45,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:46,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-01-16 19:07:46,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941962831] [2020-01-16 19:07:46,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:46,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:46,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743727999] [2020-01-16 19:07:46,002 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:46,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:46,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:46,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:46,002 INFO L87 Difference]: Start difference. First operand 380 states and 1299 transitions. Second operand 9 states. [2020-01-16 19:07:46,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:46,105 INFO L93 Difference]: Finished difference Result 578 states and 1698 transitions. [2020-01-16 19:07:46,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:46,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:46,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:46,107 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:07:46,107 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:07:46,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:07:46,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 384. [2020-01-16 19:07:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:07:46,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1309 transitions. [2020-01-16 19:07:46,117 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1309 transitions. Word has length 22 [2020-01-16 19:07:46,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:46,117 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1309 transitions. [2020-01-16 19:07:46,117 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:46,117 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1309 transitions. [2020-01-16 19:07:46,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:46,118 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:46,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, 1, 1, 1] [2020-01-16 19:07:46,118 INFO L426 AbstractCegarLoop]: === Iteration 1322 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:46,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:46,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1997015644, now seen corresponding path program 1316 times [2020-01-16 19:07:46,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:46,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103955770] [2020-01-16 19:07:46,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:46,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103955770] [2020-01-16 19:07:46,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:46,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:46,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190855249] [2020-01-16 19:07:46,348 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:46,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:46,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:46,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:46,348 INFO L87 Difference]: Start difference. First operand 384 states and 1309 transitions. Second operand 9 states. [2020-01-16 19:07:46,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:46,448 INFO L93 Difference]: Finished difference Result 582 states and 1704 transitions. [2020-01-16 19:07:46,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:46,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:46,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:46,450 INFO L225 Difference]: With dead ends: 582 [2020-01-16 19:07:46,450 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:07:46,450 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:46,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:07:46,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 382. [2020-01-16 19:07:46,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:46,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1304 transitions. [2020-01-16 19:07:46,459 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1304 transitions. Word has length 22 [2020-01-16 19:07:46,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:46,460 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1304 transitions. [2020-01-16 19:07:46,460 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:46,460 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1304 transitions. [2020-01-16 19:07:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:46,460 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:46,460 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:46,460 INFO L426 AbstractCegarLoop]: === Iteration 1323 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:46,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:46,460 INFO L82 PathProgramCache]: Analyzing trace with hash -910801384, now seen corresponding path program 1317 times [2020-01-16 19:07:46,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:46,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937619017] [2020-01-16 19:07:46,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:46,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-01-16 19:07:46,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937619017] [2020-01-16 19:07:46,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:46,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:46,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468340308] [2020-01-16 19:07:46,699 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:46,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:46,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:46,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:46,699 INFO L87 Difference]: Start difference. First operand 382 states and 1304 transitions. Second operand 9 states. [2020-01-16 19:07:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:46,812 INFO L93 Difference]: Finished difference Result 574 states and 1689 transitions. [2020-01-16 19:07:46,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:46,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:46,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:46,814 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:07:46,814 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 19:07:46,814 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:46,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 19:07:46,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 384. [2020-01-16 19:07:46,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:07:46,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1307 transitions. [2020-01-16 19:07:46,823 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1307 transitions. Word has length 22 [2020-01-16 19:07:46,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:46,823 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1307 transitions. [2020-01-16 19:07:46,824 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:46,824 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1307 transitions. [2020-01-16 19:07:46,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:46,824 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:46,824 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:46,824 INFO L426 AbstractCegarLoop]: === Iteration 1324 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:46,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:46,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1986512540, now seen corresponding path program 1318 times [2020-01-16 19:07:46,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:46,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862787535] [2020-01-16 19:07:46,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:47,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862787535] [2020-01-16 19:07:47,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:47,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:47,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989173823] [2020-01-16 19:07:47,063 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:47,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:47,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:47,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:47,064 INFO L87 Difference]: Start difference. First operand 384 states and 1307 transitions. Second operand 9 states. [2020-01-16 19:07:47,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:47,174 INFO L93 Difference]: Finished difference Result 567 states and 1683 transitions. [2020-01-16 19:07:47,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:47,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:47,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:47,176 INFO L225 Difference]: With dead ends: 567 [2020-01-16 19:07:47,176 INFO L226 Difference]: Without dead ends: 553 [2020-01-16 19:07:47,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:47,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-01-16 19:07:47,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 382. [2020-01-16 19:07:47,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:47,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1302 transitions. [2020-01-16 19:07:47,185 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1302 transitions. Word has length 22 [2020-01-16 19:07:47,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:47,185 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1302 transitions. [2020-01-16 19:07:47,185 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:47,185 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1302 transitions. [2020-01-16 19:07:47,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:47,186 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:47,186 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:47,186 INFO L426 AbstractCegarLoop]: === Iteration 1325 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:47,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:47,186 INFO L82 PathProgramCache]: Analyzing trace with hash -984323112, now seen corresponding path program 1319 times [2020-01-16 19:07:47,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:47,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078090773] [2020-01-16 19:07:47,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:47,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-01-16 19:07:47,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078090773] [2020-01-16 19:07:47,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:47,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:47,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513557310] [2020-01-16 19:07:47,425 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:47,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:47,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:47,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:47,425 INFO L87 Difference]: Start difference. First operand 382 states and 1302 transitions. Second operand 9 states. [2020-01-16 19:07:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:47,525 INFO L93 Difference]: Finished difference Result 580 states and 1701 transitions. [2020-01-16 19:07:47,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:47,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:47,527 INFO L225 Difference]: With dead ends: 580 [2020-01-16 19:07:47,527 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:07:47,527 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:47,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:07:47,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 386. [2020-01-16 19:07:47,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:07:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1309 transitions. [2020-01-16 19:07:47,536 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1309 transitions. Word has length 22 [2020-01-16 19:07:47,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:47,536 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1309 transitions. [2020-01-16 19:07:47,536 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:47,536 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1309 transitions. [2020-01-16 19:07:47,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:47,536 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:47,536 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:47,537 INFO L426 AbstractCegarLoop]: === Iteration 1326 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:47,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:47,537 INFO L82 PathProgramCache]: Analyzing trace with hash 626617846, now seen corresponding path program 1320 times [2020-01-16 19:07:47,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:47,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117576723] [2020-01-16 19:07:47,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:47,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-01-16 19:07:47,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117576723] [2020-01-16 19:07:47,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:47,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:47,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892186800] [2020-01-16 19:07:47,771 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:47,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:47,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:47,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:47,772 INFO L87 Difference]: Start difference. First operand 386 states and 1309 transitions. Second operand 9 states. [2020-01-16 19:07:47,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:47,882 INFO L93 Difference]: Finished difference Result 569 states and 1685 transitions. [2020-01-16 19:07:47,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:47,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:47,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:47,884 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:07:47,885 INFO L226 Difference]: Without dead ends: 547 [2020-01-16 19:07:47,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:47,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-01-16 19:07:47,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 376. [2020-01-16 19:07:47,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:07:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1292 transitions. [2020-01-16 19:07:47,901 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1292 transitions. Word has length 22 [2020-01-16 19:07:47,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:47,902 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1292 transitions. [2020-01-16 19:07:47,902 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:47,902 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1292 transitions. [2020-01-16 19:07:47,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:47,902 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:47,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, 1, 1, 1] [2020-01-16 19:07:47,903 INFO L426 AbstractCegarLoop]: === Iteration 1327 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:47,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:47,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1616354142, now seen corresponding path program 1321 times [2020-01-16 19:07:47,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:47,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053478137] [2020-01-16 19:07:47,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:48,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-01-16 19:07:48,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053478137] [2020-01-16 19:07:48,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:48,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:48,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317169085] [2020-01-16 19:07:48,183 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:48,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:48,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:48,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:48,183 INFO L87 Difference]: Start difference. First operand 376 states and 1292 transitions. Second operand 9 states. [2020-01-16 19:07:48,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:48,284 INFO L93 Difference]: Finished difference Result 533 states and 1590 transitions. [2020-01-16 19:07:48,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:48,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:48,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:48,286 INFO L225 Difference]: With dead ends: 533 [2020-01-16 19:07:48,286 INFO L226 Difference]: Without dead ends: 522 [2020-01-16 19:07:48,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-01-16 19:07:48,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 380. [2020-01-16 19:07:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:07:48,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1305 transitions. [2020-01-16 19:07:48,295 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1305 transitions. Word has length 22 [2020-01-16 19:07:48,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:48,296 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1305 transitions. [2020-01-16 19:07:48,296 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:48,296 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1305 transitions. [2020-01-16 19:07:48,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:48,296 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:48,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, 1, 1, 1] [2020-01-16 19:07:48,296 INFO L426 AbstractCegarLoop]: === Iteration 1328 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:48,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:48,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1233096144, now seen corresponding path program 1322 times [2020-01-16 19:07:48,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:48,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755341415] [2020-01-16 19:07:48,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:48,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-01-16 19:07:48,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755341415] [2020-01-16 19:07:48,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:48,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:48,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784949906] [2020-01-16 19:07:48,580 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:48,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:48,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:48,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:48,580 INFO L87 Difference]: Start difference. First operand 380 states and 1305 transitions. Second operand 9 states. [2020-01-16 19:07:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:48,665 INFO L93 Difference]: Finished difference Result 531 states and 1585 transitions. [2020-01-16 19:07:48,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:48,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:48,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:48,667 INFO L225 Difference]: With dead ends: 531 [2020-01-16 19:07:48,667 INFO L226 Difference]: Without dead ends: 521 [2020-01-16 19:07:48,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-01-16 19:07:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 379. [2020-01-16 19:07:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:07:48,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1303 transitions. [2020-01-16 19:07:48,676 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1303 transitions. Word has length 22 [2020-01-16 19:07:48,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:48,676 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1303 transitions. [2020-01-16 19:07:48,676 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:48,676 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1303 transitions. [2020-01-16 19:07:48,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:48,677 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:48,677 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:48,677 INFO L426 AbstractCegarLoop]: === Iteration 1329 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:48,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:48,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1078175300, now seen corresponding path program 1323 times [2020-01-16 19:07:48,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:48,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483781701] [2020-01-16 19:07:48,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:48,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:48,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483781701] [2020-01-16 19:07:48,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:48,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:48,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711824469] [2020-01-16 19:07:48,958 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:48,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:48,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:48,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:48,958 INFO L87 Difference]: Start difference. First operand 379 states and 1303 transitions. Second operand 9 states. [2020-01-16 19:07:49,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:49,071 INFO L93 Difference]: Finished difference Result 535 states and 1594 transitions. [2020-01-16 19:07:49,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:49,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:49,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:49,073 INFO L225 Difference]: With dead ends: 535 [2020-01-16 19:07:49,073 INFO L226 Difference]: Without dead ends: 524 [2020-01-16 19:07:49,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:49,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-01-16 19:07:49,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 381. [2020-01-16 19:07:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:07:49,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1306 transitions. [2020-01-16 19:07:49,082 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1306 transitions. Word has length 22 [2020-01-16 19:07:49,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:49,082 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1306 transitions. [2020-01-16 19:07:49,082 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:49,082 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1306 transitions. [2020-01-16 19:07:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:49,083 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:49,083 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:49,083 INFO L426 AbstractCegarLoop]: === Iteration 1330 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:49,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:49,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1331268052, now seen corresponding path program 1324 times [2020-01-16 19:07:49,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:49,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372001958] [2020-01-16 19:07:49,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:49,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372001958] [2020-01-16 19:07:49,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:49,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:49,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899178698] [2020-01-16 19:07:49,371 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:49,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:49,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:49,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:49,372 INFO L87 Difference]: Start difference. First operand 381 states and 1306 transitions. Second operand 9 states. [2020-01-16 19:07:49,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:49,484 INFO L93 Difference]: Finished difference Result 534 states and 1590 transitions. [2020-01-16 19:07:49,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:49,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:49,485 INFO L225 Difference]: With dead ends: 534 [2020-01-16 19:07:49,485 INFO L226 Difference]: Without dead ends: 522 [2020-01-16 19:07:49,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:49,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-01-16 19:07:49,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 379. [2020-01-16 19:07:49,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:07:49,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1302 transitions. [2020-01-16 19:07:49,495 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1302 transitions. Word has length 22 [2020-01-16 19:07:49,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:49,495 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1302 transitions. [2020-01-16 19:07:49,495 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1302 transitions. [2020-01-16 19:07:49,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:49,496 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:49,496 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:49,496 INFO L426 AbstractCegarLoop]: === Iteration 1331 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:49,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:49,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1967779564, now seen corresponding path program 1325 times [2020-01-16 19:07:49,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:49,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976184811] [2020-01-16 19:07:49,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:49,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-01-16 19:07:49,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976184811] [2020-01-16 19:07:49,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:49,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:49,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077854483] [2020-01-16 19:07:49,787 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:49,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:49,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:49,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:49,787 INFO L87 Difference]: Start difference. First operand 379 states and 1302 transitions. Second operand 9 states. [2020-01-16 19:07:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:49,865 INFO L93 Difference]: Finished difference Result 530 states and 1582 transitions. [2020-01-16 19:07:49,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:49,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:49,867 INFO L225 Difference]: With dead ends: 530 [2020-01-16 19:07:49,867 INFO L226 Difference]: Without dead ends: 521 [2020-01-16 19:07:49,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-01-16 19:07:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 380. [2020-01-16 19:07:49,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:07:49,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1303 transitions. [2020-01-16 19:07:49,875 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1303 transitions. Word has length 22 [2020-01-16 19:07:49,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:49,876 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1303 transitions. [2020-01-16 19:07:49,876 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:49,876 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1303 transitions. [2020-01-16 19:07:49,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:49,876 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:49,876 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:49,876 INFO L426 AbstractCegarLoop]: === Iteration 1332 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:49,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:49,877 INFO L82 PathProgramCache]: Analyzing trace with hash -356838606, now seen corresponding path program 1326 times [2020-01-16 19:07:49,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:49,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840409262] [2020-01-16 19:07:49,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:50,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840409262] [2020-01-16 19:07:50,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:50,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:50,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393530382] [2020-01-16 19:07:50,165 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:50,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:50,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:50,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:50,165 INFO L87 Difference]: Start difference. First operand 380 states and 1303 transitions. Second operand 9 states. [2020-01-16 19:07:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:50,280 INFO L93 Difference]: Finished difference Result 531 states and 1583 transitions. [2020-01-16 19:07:50,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:50,280 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:50,282 INFO L225 Difference]: With dead ends: 531 [2020-01-16 19:07:50,282 INFO L226 Difference]: Without dead ends: 519 [2020-01-16 19:07:50,282 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:50,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-01-16 19:07:50,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 378. [2020-01-16 19:07:50,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:07:50,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1300 transitions. [2020-01-16 19:07:50,291 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1300 transitions. Word has length 22 [2020-01-16 19:07:50,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:50,291 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1300 transitions. [2020-01-16 19:07:50,291 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1300 transitions. [2020-01-16 19:07:50,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:50,292 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:50,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, 1, 1, 1] [2020-01-16 19:07:50,292 INFO L426 AbstractCegarLoop]: === Iteration 1333 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:50,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:50,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2081276496, now seen corresponding path program 1327 times [2020-01-16 19:07:50,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:50,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264817657] [2020-01-16 19:07:50,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:50,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264817657] [2020-01-16 19:07:50,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:50,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:50,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678076986] [2020-01-16 19:07:50,568 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:50,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:50,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:50,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:50,569 INFO L87 Difference]: Start difference. First operand 378 states and 1300 transitions. Second operand 9 states. [2020-01-16 19:07:50,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:50,686 INFO L93 Difference]: Finished difference Result 538 states and 1600 transitions. [2020-01-16 19:07:50,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:50,686 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:50,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:50,687 INFO L225 Difference]: With dead ends: 538 [2020-01-16 19:07:50,688 INFO L226 Difference]: Without dead ends: 527 [2020-01-16 19:07:50,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2020-01-16 19:07:50,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 380. [2020-01-16 19:07:50,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:07:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1304 transitions. [2020-01-16 19:07:50,696 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1304 transitions. Word has length 22 [2020-01-16 19:07:50,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:50,697 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1304 transitions. [2020-01-16 19:07:50,697 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1304 transitions. [2020-01-16 19:07:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:50,697 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:50,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, 1, 1, 1] [2020-01-16 19:07:50,697 INFO L426 AbstractCegarLoop]: === Iteration 1334 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:50,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:50,698 INFO L82 PathProgramCache]: Analyzing trace with hash 635759486, now seen corresponding path program 1328 times [2020-01-16 19:07:50,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:50,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19706642] [2020-01-16 19:07:50,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:50,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:50,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19706642] [2020-01-16 19:07:50,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:50,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:50,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523113616] [2020-01-16 19:07:50,974 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:50,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:50,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:50,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:50,974 INFO L87 Difference]: Start difference. First operand 380 states and 1304 transitions. Second operand 9 states. [2020-01-16 19:07:51,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:51,064 INFO L93 Difference]: Finished difference Result 536 states and 1595 transitions. [2020-01-16 19:07:51,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:51,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:51,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:51,066 INFO L225 Difference]: With dead ends: 536 [2020-01-16 19:07:51,066 INFO L226 Difference]: Without dead ends: 526 [2020-01-16 19:07:51,066 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:51,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-01-16 19:07:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 379. [2020-01-16 19:07:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:07:51,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1302 transitions. [2020-01-16 19:07:51,075 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1302 transitions. Word has length 22 [2020-01-16 19:07:51,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:51,075 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1302 transitions. [2020-01-16 19:07:51,076 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:51,076 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1302 transitions. [2020-01-16 19:07:51,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:51,076 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:51,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, 1, 1, 1] [2020-01-16 19:07:51,076 INFO L426 AbstractCegarLoop]: === Iteration 1335 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:51,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:51,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1200998268, now seen corresponding path program 1329 times [2020-01-16 19:07:51,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:51,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673461760] [2020-01-16 19:07:51,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:51,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-01-16 19:07:51,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673461760] [2020-01-16 19:07:51,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:51,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:51,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800607546] [2020-01-16 19:07:51,374 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:51,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:51,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:51,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:51,375 INFO L87 Difference]: Start difference. First operand 379 states and 1302 transitions. Second operand 9 states. [2020-01-16 19:07:51,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:51,481 INFO L93 Difference]: Finished difference Result 545 states and 1615 transitions. [2020-01-16 19:07:51,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:51,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:51,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:51,482 INFO L225 Difference]: With dead ends: 545 [2020-01-16 19:07:51,483 INFO L226 Difference]: Without dead ends: 534 [2020-01-16 19:07:51,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:51,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-01-16 19:07:51,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 382. [2020-01-16 19:07:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1307 transitions. [2020-01-16 19:07:51,497 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1307 transitions. Word has length 22 [2020-01-16 19:07:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:51,497 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1307 transitions. [2020-01-16 19:07:51,497 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1307 transitions. [2020-01-16 19:07:51,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:51,498 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:51,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:51,498 INFO L426 AbstractCegarLoop]: === Iteration 1336 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:51,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:51,498 INFO L82 PathProgramCache]: Analyzing trace with hash 185036862, now seen corresponding path program 1330 times [2020-01-16 19:07:51,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:51,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905308686] [2020-01-16 19:07:51,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:51,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905308686] [2020-01-16 19:07:51,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:51,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:51,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85155373] [2020-01-16 19:07:51,773 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:51,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:51,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:51,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:51,774 INFO L87 Difference]: Start difference. First operand 382 states and 1307 transitions. Second operand 9 states. [2020-01-16 19:07:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:51,881 INFO L93 Difference]: Finished difference Result 548 states and 1618 transitions. [2020-01-16 19:07:51,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:51,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:51,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:51,882 INFO L225 Difference]: With dead ends: 548 [2020-01-16 19:07:51,882 INFO L226 Difference]: Without dead ends: 531 [2020-01-16 19:07:51,883 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:51,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-01-16 19:07:51,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 379. [2020-01-16 19:07:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:07:51,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1301 transitions. [2020-01-16 19:07:51,890 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1301 transitions. Word has length 22 [2020-01-16 19:07:51,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:51,891 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1301 transitions. [2020-01-16 19:07:51,891 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:51,891 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1301 transitions. [2020-01-16 19:07:51,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:51,891 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:51,891 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:51,891 INFO L426 AbstractCegarLoop]: === Iteration 1337 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:51,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:51,891 INFO L82 PathProgramCache]: Analyzing trace with hash 48014164, now seen corresponding path program 1331 times [2020-01-16 19:07:51,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:51,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041398904] [2020-01-16 19:07:51,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:52,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:52,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041398904] [2020-01-16 19:07:52,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:52,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:52,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929005048] [2020-01-16 19:07:52,163 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:52,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:52,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:52,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:52,163 INFO L87 Difference]: Start difference. First operand 379 states and 1301 transitions. Second operand 9 states. [2020-01-16 19:07:52,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:52,243 INFO L93 Difference]: Finished difference Result 539 states and 1600 transitions. [2020-01-16 19:07:52,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:52,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:52,244 INFO L225 Difference]: With dead ends: 539 [2020-01-16 19:07:52,244 INFO L226 Difference]: Without dead ends: 530 [2020-01-16 19:07:52,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:52,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-01-16 19:07:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 380. [2020-01-16 19:07:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:07:52,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1302 transitions. [2020-01-16 19:07:52,253 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1302 transitions. Word has length 22 [2020-01-16 19:07:52,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:52,253 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1302 transitions. [2020-01-16 19:07:52,253 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1302 transitions. [2020-01-16 19:07:52,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:52,254 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:52,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, 1, 1, 1] [2020-01-16 19:07:52,254 INFO L426 AbstractCegarLoop]: === Iteration 1338 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:52,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:52,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1027696992, now seen corresponding path program 1332 times [2020-01-16 19:07:52,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:52,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371220138] [2020-01-16 19:07:52,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:52,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-01-16 19:07:52,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371220138] [2020-01-16 19:07:52,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:52,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:52,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766152145] [2020-01-16 19:07:52,520 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:52,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:52,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:52,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:52,520 INFO L87 Difference]: Start difference. First operand 380 states and 1302 transitions. Second operand 9 states. [2020-01-16 19:07:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:52,632 INFO L93 Difference]: Finished difference Result 544 states and 1609 transitions. [2020-01-16 19:07:52,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:52,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:52,634 INFO L225 Difference]: With dead ends: 544 [2020-01-16 19:07:52,634 INFO L226 Difference]: Without dead ends: 528 [2020-01-16 19:07:52,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-01-16 19:07:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 378. [2020-01-16 19:07:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:07:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1299 transitions. [2020-01-16 19:07:52,643 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1299 transitions. Word has length 22 [2020-01-16 19:07:52,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:52,643 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1299 transitions. [2020-01-16 19:07:52,643 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1299 transitions. [2020-01-16 19:07:52,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:52,643 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:52,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, 1, 1, 1] [2020-01-16 19:07:52,644 INFO L426 AbstractCegarLoop]: === Iteration 1339 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:52,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:52,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1888094576, now seen corresponding path program 1333 times [2020-01-16 19:07:52,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:52,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704735358] [2020-01-16 19:07:52,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:52,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:52,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704735358] [2020-01-16 19:07:52,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:52,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:52,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986707764] [2020-01-16 19:07:52,928 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:52,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:52,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:52,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:52,928 INFO L87 Difference]: Start difference. First operand 378 states and 1299 transitions. Second operand 9 states. [2020-01-16 19:07:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:53,044 INFO L93 Difference]: Finished difference Result 544 states and 1616 transitions. [2020-01-16 19:07:53,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:53,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:53,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:53,045 INFO L225 Difference]: With dead ends: 544 [2020-01-16 19:07:53,046 INFO L226 Difference]: Without dead ends: 533 [2020-01-16 19:07:53,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:53,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-01-16 19:07:53,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 382. [2020-01-16 19:07:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:53,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1309 transitions. [2020-01-16 19:07:53,055 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1309 transitions. Word has length 22 [2020-01-16 19:07:53,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:53,055 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1309 transitions. [2020-01-16 19:07:53,055 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1309 transitions. [2020-01-16 19:07:53,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:53,056 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:53,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, 1, 1, 1] [2020-01-16 19:07:53,056 INFO L426 AbstractCegarLoop]: === Iteration 1340 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:53,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:53,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1635001824, now seen corresponding path program 1334 times [2020-01-16 19:07:53,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:53,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456390804] [2020-01-16 19:07:53,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:53,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-01-16 19:07:53,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456390804] [2020-01-16 19:07:53,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:53,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:53,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090500388] [2020-01-16 19:07:53,329 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:53,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:53,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:53,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:53,330 INFO L87 Difference]: Start difference. First operand 382 states and 1309 transitions. Second operand 9 states. [2020-01-16 19:07:53,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:53,431 INFO L93 Difference]: Finished difference Result 543 states and 1612 transitions. [2020-01-16 19:07:53,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:53,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:53,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:53,433 INFO L225 Difference]: With dead ends: 543 [2020-01-16 19:07:53,433 INFO L226 Difference]: Without dead ends: 531 [2020-01-16 19:07:53,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-01-16 19:07:53,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 380. [2020-01-16 19:07:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:07:53,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1304 transitions. [2020-01-16 19:07:53,442 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1304 transitions. Word has length 22 [2020-01-16 19:07:53,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:53,442 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1304 transitions. [2020-01-16 19:07:53,442 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:53,442 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1304 transitions. [2020-01-16 19:07:53,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:53,443 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:53,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:53,443 INFO L426 AbstractCegarLoop]: === Iteration 1341 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:53,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:53,443 INFO L82 PathProgramCache]: Analyzing trace with hash 725035810, now seen corresponding path program 1335 times [2020-01-16 19:07:53,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:53,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423838355] [2020-01-16 19:07:53,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:53,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-01-16 19:07:53,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423838355] [2020-01-16 19:07:53,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:53,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:53,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013515777] [2020-01-16 19:07:53,714 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:53,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:53,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:53,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:53,714 INFO L87 Difference]: Start difference. First operand 380 states and 1304 transitions. Second operand 9 states. [2020-01-16 19:07:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:53,811 INFO L93 Difference]: Finished difference Result 549 states and 1625 transitions. [2020-01-16 19:07:53,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:53,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:53,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:53,812 INFO L225 Difference]: With dead ends: 549 [2020-01-16 19:07:53,812 INFO L226 Difference]: Without dead ends: 538 [2020-01-16 19:07:53,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:53,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-01-16 19:07:53,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 383. [2020-01-16 19:07:53,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:07:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1309 transitions. [2020-01-16 19:07:53,821 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1309 transitions. Word has length 22 [2020-01-16 19:07:53,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:53,821 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1309 transitions. [2020-01-16 19:07:53,821 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:53,821 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1309 transitions. [2020-01-16 19:07:53,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:53,822 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:53,822 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:53,822 INFO L426 AbstractCegarLoop]: === Iteration 1342 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:53,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:53,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2111070940, now seen corresponding path program 1336 times [2020-01-16 19:07:53,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:53,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813940519] [2020-01-16 19:07:53,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:54,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-01-16 19:07:54,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813940519] [2020-01-16 19:07:54,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:54,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:54,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178575165] [2020-01-16 19:07:54,097 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:54,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:54,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:54,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:54,098 INFO L87 Difference]: Start difference. First operand 383 states and 1309 transitions. Second operand 9 states. [2020-01-16 19:07:54,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:54,201 INFO L93 Difference]: Finished difference Result 552 states and 1628 transitions. [2020-01-16 19:07:54,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:54,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:54,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:54,203 INFO L225 Difference]: With dead ends: 552 [2020-01-16 19:07:54,203 INFO L226 Difference]: Without dead ends: 535 [2020-01-16 19:07:54,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:54,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-01-16 19:07:54,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 380. [2020-01-16 19:07:54,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:07:54,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1302 transitions. [2020-01-16 19:07:54,212 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1302 transitions. Word has length 22 [2020-01-16 19:07:54,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:54,212 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1302 transitions. [2020-01-16 19:07:54,213 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:54,213 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1302 transitions. [2020-01-16 19:07:54,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:54,213 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:54,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, 1, 1, 1] [2020-01-16 19:07:54,213 INFO L426 AbstractCegarLoop]: === Iteration 1343 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:54,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:54,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2119055616, now seen corresponding path program 1337 times [2020-01-16 19:07:54,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:54,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276441741] [2020-01-16 19:07:54,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:54,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-01-16 19:07:54,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276441741] [2020-01-16 19:07:54,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:54,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:54,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797567390] [2020-01-16 19:07:54,475 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:54,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:54,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:54,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:54,475 INFO L87 Difference]: Start difference. First operand 380 states and 1302 transitions. Second operand 9 states. [2020-01-16 19:07:54,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:54,592 INFO L93 Difference]: Finished difference Result 546 states and 1616 transitions. [2020-01-16 19:07:54,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:54,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:54,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:54,593 INFO L225 Difference]: With dead ends: 546 [2020-01-16 19:07:54,594 INFO L226 Difference]: Without dead ends: 536 [2020-01-16 19:07:54,594 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:54,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-01-16 19:07:54,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 382. [2020-01-16 19:07:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:07:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1305 transitions. [2020-01-16 19:07:54,602 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1305 transitions. Word has length 22 [2020-01-16 19:07:54,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:54,603 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1305 transitions. [2020-01-16 19:07:54,603 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1305 transitions. [2020-01-16 19:07:54,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:54,603 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:54,603 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:54,603 INFO L426 AbstractCegarLoop]: === Iteration 1344 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:54,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:54,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1201105426, now seen corresponding path program 1338 times [2020-01-16 19:07:54,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:54,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385361138] [2020-01-16 19:07:54,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:54,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-01-16 19:07:54,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385361138] [2020-01-16 19:07:54,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:54,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:54,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394774543] [2020-01-16 19:07:54,895 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:54,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:54,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:54,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:54,896 INFO L87 Difference]: Start difference. First operand 382 states and 1305 transitions. Second operand 9 states. [2020-01-16 19:07:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:54,999 INFO L93 Difference]: Finished difference Result 550 states and 1622 transitions. [2020-01-16 19:07:55,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:55,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:55,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:55,001 INFO L225 Difference]: With dead ends: 550 [2020-01-16 19:07:55,001 INFO L226 Difference]: Without dead ends: 532 [2020-01-16 19:07:55,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:55,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-01-16 19:07:55,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 378. [2020-01-16 19:07:55,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:07:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1298 transitions. [2020-01-16 19:07:55,010 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1298 transitions. Word has length 22 [2020-01-16 19:07:55,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:55,011 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1298 transitions. [2020-01-16 19:07:55,011 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:55,011 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1298 transitions. [2020-01-16 19:07:55,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:55,012 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:55,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, 1, 1, 1] [2020-01-16 19:07:55,012 INFO L426 AbstractCegarLoop]: === Iteration 1345 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:55,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:55,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1286951934, now seen corresponding path program 1339 times [2020-01-16 19:07:55,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:55,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303440849] [2020-01-16 19:07:55,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:55,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-01-16 19:07:55,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303440849] [2020-01-16 19:07:55,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:55,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:55,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000953643] [2020-01-16 19:07:55,302 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:55,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:55,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:55,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:55,303 INFO L87 Difference]: Start difference. First operand 378 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:07:55,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:55,396 INFO L93 Difference]: Finished difference Result 533 states and 1587 transitions. [2020-01-16 19:07:55,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:55,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:55,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:55,398 INFO L225 Difference]: With dead ends: 533 [2020-01-16 19:07:55,398 INFO L226 Difference]: Without dead ends: 524 [2020-01-16 19:07:55,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:55,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-01-16 19:07:55,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 380. [2020-01-16 19:07:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:07:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1302 transitions. [2020-01-16 19:07:55,407 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1302 transitions. Word has length 22 [2020-01-16 19:07:55,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:55,408 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1302 transitions. [2020-01-16 19:07:55,408 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1302 transitions. [2020-01-16 19:07:55,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:55,409 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:55,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, 1, 1, 1] [2020-01-16 19:07:55,409 INFO L426 AbstractCegarLoop]: === Iteration 1346 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:55,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:55,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1397074404, now seen corresponding path program 1340 times [2020-01-16 19:07:55,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:55,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999475286] [2020-01-16 19:07:55,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:55,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999475286] [2020-01-16 19:07:55,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:55,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:55,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623723706] [2020-01-16 19:07:55,690 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:55,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:55,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:55,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:55,690 INFO L87 Difference]: Start difference. First operand 380 states and 1302 transitions. Second operand 9 states. [2020-01-16 19:07:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:55,790 INFO L93 Difference]: Finished difference Result 534 states and 1588 transitions. [2020-01-16 19:07:55,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:55,791 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:55,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:55,792 INFO L225 Difference]: With dead ends: 534 [2020-01-16 19:07:55,792 INFO L226 Difference]: Without dead ends: 523 [2020-01-16 19:07:55,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:55,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-01-16 19:07:55,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 379. [2020-01-16 19:07:55,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:07:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1300 transitions. [2020-01-16 19:07:55,801 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1300 transitions. Word has length 22 [2020-01-16 19:07:55,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:55,801 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1300 transitions. [2020-01-16 19:07:55,801 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:55,801 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1300 transitions. [2020-01-16 19:07:55,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:55,802 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:55,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, 1, 1, 1] [2020-01-16 19:07:55,802 INFO L426 AbstractCegarLoop]: === Iteration 1347 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:55,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:55,802 INFO L82 PathProgramCache]: Analyzing trace with hash -394884976, now seen corresponding path program 1341 times [2020-01-16 19:07:55,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:55,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696378702] [2020-01-16 19:07:55,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:56,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696378702] [2020-01-16 19:07:56,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:56,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:56,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027007767] [2020-01-16 19:07:56,066 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:56,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:56,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:56,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:56,067 INFO L87 Difference]: Start difference. First operand 379 states and 1300 transitions. Second operand 9 states. [2020-01-16 19:07:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:56,143 INFO L93 Difference]: Finished difference Result 537 states and 1594 transitions. [2020-01-16 19:07:56,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:56,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:56,145 INFO L225 Difference]: With dead ends: 537 [2020-01-16 19:07:56,145 INFO L226 Difference]: Without dead ends: 528 [2020-01-16 19:07:56,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:56,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-01-16 19:07:56,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 380. [2020-01-16 19:07:56,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:07:56,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-01-16 19:07:56,154 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-01-16 19:07:56,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:56,155 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-01-16 19:07:56,155 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:56,155 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-01-16 19:07:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:56,155 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:56,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, 1, 1, 1] [2020-01-16 19:07:56,156 INFO L426 AbstractCegarLoop]: === Iteration 1348 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:56,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:56,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1470596132, now seen corresponding path program 1342 times [2020-01-16 19:07:56,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:56,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992044834] [2020-01-16 19:07:56,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:56,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992044834] [2020-01-16 19:07:56,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:56,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:56,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114670642] [2020-01-16 19:07:56,415 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:56,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:56,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:56,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:56,416 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-01-16 19:07:56,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:56,516 INFO L93 Difference]: Finished difference Result 542 states and 1603 transitions. [2020-01-16 19:07:56,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:56,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:56,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:56,518 INFO L225 Difference]: With dead ends: 542 [2020-01-16 19:07:56,518 INFO L226 Difference]: Without dead ends: 527 [2020-01-16 19:07:56,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:56,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2020-01-16 19:07:56,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 379. [2020-01-16 19:07:56,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:07:56,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1299 transitions. [2020-01-16 19:07:56,527 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1299 transitions. Word has length 22 [2020-01-16 19:07:56,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:56,527 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1299 transitions. [2020-01-16 19:07:56,527 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1299 transitions. [2020-01-16 19:07:56,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:56,528 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:56,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, 1, 1, 1] [2020-01-16 19:07:56,528 INFO L426 AbstractCegarLoop]: === Iteration 1349 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:56,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:56,528 INFO L82 PathProgramCache]: Analyzing trace with hash -384381872, now seen corresponding path program 1343 times [2020-01-16 19:07:56,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:56,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330678625] [2020-01-16 19:07:56,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:56,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-01-16 19:07:56,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330678625] [2020-01-16 19:07:56,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:56,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:56,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926238698] [2020-01-16 19:07:56,800 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:56,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:56,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:56,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:56,800 INFO L87 Difference]: Start difference. First operand 379 states and 1299 transitions. Second operand 9 states. [2020-01-16 19:07:56,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:56,898 INFO L93 Difference]: Finished difference Result 540 states and 1600 transitions. [2020-01-16 19:07:56,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:56,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:56,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:56,900 INFO L225 Difference]: With dead ends: 540 [2020-01-16 19:07:56,900 INFO L226 Difference]: Without dead ends: 530 [2020-01-16 19:07:56,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:56,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-01-16 19:07:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 381. [2020-01-16 19:07:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:07:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1302 transitions. [2020-01-16 19:07:56,908 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1302 transitions. Word has length 22 [2020-01-16 19:07:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:56,908 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1302 transitions. [2020-01-16 19:07:56,909 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1302 transitions. [2020-01-16 19:07:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:56,909 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:56,909 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:56,909 INFO L426 AbstractCegarLoop]: === Iteration 1350 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:56,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:56,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1223933310, now seen corresponding path program 1344 times [2020-01-16 19:07:56,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:56,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749616784] [2020-01-16 19:07:56,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:57,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-01-16 19:07:57,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749616784] [2020-01-16 19:07:57,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:57,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:57,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123385785] [2020-01-16 19:07:57,180 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:57,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:57,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:57,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:57,180 INFO L87 Difference]: Start difference. First operand 381 states and 1302 transitions. Second operand 9 states. [2020-01-16 19:07:57,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:57,282 INFO L93 Difference]: Finished difference Result 544 states and 1606 transitions. [2020-01-16 19:07:57,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:57,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:57,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:57,283 INFO L225 Difference]: With dead ends: 544 [2020-01-16 19:07:57,284 INFO L226 Difference]: Without dead ends: 526 [2020-01-16 19:07:57,284 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:57,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-01-16 19:07:57,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 377. [2020-01-16 19:07:57,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:07:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1296 transitions. [2020-01-16 19:07:57,292 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1296 transitions. Word has length 22 [2020-01-16 19:07:57,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:57,292 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1296 transitions. [2020-01-16 19:07:57,292 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:57,292 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1296 transitions. [2020-01-16 19:07:57,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:57,293 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:57,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, 1, 1, 1] [2020-01-16 19:07:57,293 INFO L426 AbstractCegarLoop]: === Iteration 1351 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:57,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:57,293 INFO L82 PathProgramCache]: Analyzing trace with hash -2038839868, now seen corresponding path program 1345 times [2020-01-16 19:07:57,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:57,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695206569] [2020-01-16 19:07:57,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:57,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-01-16 19:07:57,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695206569] [2020-01-16 19:07:57,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:57,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:57,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977331342] [2020-01-16 19:07:57,578 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:57,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:57,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:57,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:57,578 INFO L87 Difference]: Start difference. First operand 377 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:07:57,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:57,679 INFO L93 Difference]: Finished difference Result 530 states and 1582 transitions. [2020-01-16 19:07:57,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:57,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:57,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:57,680 INFO L225 Difference]: With dead ends: 530 [2020-01-16 19:07:57,681 INFO L226 Difference]: Without dead ends: 519 [2020-01-16 19:07:57,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:57,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-01-16 19:07:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 380. [2020-01-16 19:07:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:07:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1304 transitions. [2020-01-16 19:07:57,689 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1304 transitions. Word has length 22 [2020-01-16 19:07:57,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:57,689 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1304 transitions. [2020-01-16 19:07:57,689 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1304 transitions. [2020-01-16 19:07:57,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:57,690 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:57,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, 1, 1, 1] [2020-01-16 19:07:57,690 INFO L426 AbstractCegarLoop]: === Iteration 1352 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:57,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:57,690 INFO L82 PathProgramCache]: Analyzing trace with hash 810610418, now seen corresponding path program 1346 times [2020-01-16 19:07:57,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:57,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430550641] [2020-01-16 19:07:57,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:57,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430550641] [2020-01-16 19:07:57,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:57,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:57,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450643240] [2020-01-16 19:07:57,994 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:57,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:57,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:57,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:57,994 INFO L87 Difference]: Start difference. First operand 380 states and 1304 transitions. Second operand 9 states. [2020-01-16 19:07:58,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:58,100 INFO L93 Difference]: Finished difference Result 528 states and 1577 transitions. [2020-01-16 19:07:58,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:58,100 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:58,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:58,102 INFO L225 Difference]: With dead ends: 528 [2020-01-16 19:07:58,102 INFO L226 Difference]: Without dead ends: 518 [2020-01-16 19:07:58,102 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:58,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-01-16 19:07:58,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 379. [2020-01-16 19:07:58,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:07:58,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1302 transitions. [2020-01-16 19:07:58,109 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1302 transitions. Word has length 22 [2020-01-16 19:07:58,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:58,109 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1302 transitions. [2020-01-16 19:07:58,109 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:58,109 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1302 transitions. [2020-01-16 19:07:58,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:58,110 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:58,110 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:58,110 INFO L426 AbstractCegarLoop]: === Iteration 1353 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:58,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:58,110 INFO L82 PathProgramCache]: Analyzing trace with hash 655689574, now seen corresponding path program 1347 times [2020-01-16 19:07:58,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:58,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066691400] [2020-01-16 19:07:58,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:58,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066691400] [2020-01-16 19:07:58,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:58,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:58,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552223413] [2020-01-16 19:07:58,396 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:58,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:58,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:58,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:58,396 INFO L87 Difference]: Start difference. First operand 379 states and 1302 transitions. Second operand 9 states. [2020-01-16 19:07:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:58,514 INFO L93 Difference]: Finished difference Result 532 states and 1586 transitions. [2020-01-16 19:07:58,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:58,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:58,515 INFO L225 Difference]: With dead ends: 532 [2020-01-16 19:07:58,515 INFO L226 Difference]: Without dead ends: 521 [2020-01-16 19:07:58,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:58,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-01-16 19:07:58,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 381. [2020-01-16 19:07:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:07:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1305 transitions. [2020-01-16 19:07:58,524 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1305 transitions. Word has length 22 [2020-01-16 19:07:58,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:58,524 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1305 transitions. [2020-01-16 19:07:58,524 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:58,524 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1305 transitions. [2020-01-16 19:07:58,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:58,525 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:58,525 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:58,525 INFO L426 AbstractCegarLoop]: === Iteration 1354 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:58,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:58,525 INFO L82 PathProgramCache]: Analyzing trace with hash 908782326, now seen corresponding path program 1348 times [2020-01-16 19:07:58,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:58,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534285640] [2020-01-16 19:07:58,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:58,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534285640] [2020-01-16 19:07:58,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:58,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:58,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364035826] [2020-01-16 19:07:58,817 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:58,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:58,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:58,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:58,817 INFO L87 Difference]: Start difference. First operand 381 states and 1305 transitions. Second operand 9 states. [2020-01-16 19:07:58,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:58,931 INFO L93 Difference]: Finished difference Result 531 states and 1582 transitions. [2020-01-16 19:07:58,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:58,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:58,932 INFO L225 Difference]: With dead ends: 531 [2020-01-16 19:07:58,933 INFO L226 Difference]: Without dead ends: 519 [2020-01-16 19:07:58,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:58,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-01-16 19:07:58,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 379. [2020-01-16 19:07:58,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:07:58,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1301 transitions. [2020-01-16 19:07:58,941 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1301 transitions. Word has length 22 [2020-01-16 19:07:58,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:58,941 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1301 transitions. [2020-01-16 19:07:58,941 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:58,941 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1301 transitions. [2020-01-16 19:07:58,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:58,942 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:58,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:07:58,942 INFO L426 AbstractCegarLoop]: === Iteration 1355 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:58,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:58,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1904702006, now seen corresponding path program 1349 times [2020-01-16 19:07:58,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:58,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921220100] [2020-01-16 19:07:58,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:59,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-01-16 19:07:59,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921220100] [2020-01-16 19:07:59,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:59,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:59,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955263940] [2020-01-16 19:07:59,235 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:59,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:59,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:59,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:59,235 INFO L87 Difference]: Start difference. First operand 379 states and 1301 transitions. Second operand 9 states. [2020-01-16 19:07:59,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:59,315 INFO L93 Difference]: Finished difference Result 527 states and 1574 transitions. [2020-01-16 19:07:59,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:59,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:59,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:59,317 INFO L225 Difference]: With dead ends: 527 [2020-01-16 19:07:59,317 INFO L226 Difference]: Without dead ends: 518 [2020-01-16 19:07:59,317 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:59,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-01-16 19:07:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 380. [2020-01-16 19:07:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:07:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1302 transitions. [2020-01-16 19:07:59,332 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1302 transitions. Word has length 22 [2020-01-16 19:07:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:59,332 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1302 transitions. [2020-01-16 19:07:59,332 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:59,332 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1302 transitions. [2020-01-16 19:07:59,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:59,333 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:59,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, 1, 1, 1] [2020-01-16 19:07:59,333 INFO L426 AbstractCegarLoop]: === Iteration 1356 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:59,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:59,333 INFO L82 PathProgramCache]: Analyzing trace with hash -779324332, now seen corresponding path program 1350 times [2020-01-16 19:07:59,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:59,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917629058] [2020-01-16 19:07:59,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:07:59,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:07:59,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917629058] [2020-01-16 19:07:59,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:07:59,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:07:59,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083084149] [2020-01-16 19:07:59,624 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:07:59,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:07:59,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:07:59,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:07:59,625 INFO L87 Difference]: Start difference. First operand 380 states and 1302 transitions. Second operand 9 states. [2020-01-16 19:07:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:07:59,755 INFO L93 Difference]: Finished difference Result 528 states and 1575 transitions. [2020-01-16 19:07:59,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:07:59,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:07:59,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:07:59,757 INFO L225 Difference]: With dead ends: 528 [2020-01-16 19:07:59,757 INFO L226 Difference]: Without dead ends: 516 [2020-01-16 19:07:59,757 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:07:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2020-01-16 19:07:59,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 378. [2020-01-16 19:07:59,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:07:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1299 transitions. [2020-01-16 19:07:59,765 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1299 transitions. Word has length 22 [2020-01-16 19:07:59,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:07:59,765 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1299 transitions. [2020-01-16 19:07:59,765 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:07:59,765 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1299 transitions. [2020-01-16 19:07:59,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:07:59,766 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:07:59,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, 1, 1, 1] [2020-01-16 19:07:59,766 INFO L426 AbstractCegarLoop]: === Iteration 1357 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:07:59,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:07:59,766 INFO L82 PathProgramCache]: Analyzing trace with hash -710142448, now seen corresponding path program 1351 times [2020-01-16 19:07:59,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:07:59,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139836092] [2020-01-16 19:07:59,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:07:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:00,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-01-16 19:08:00,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139836092] [2020-01-16 19:08:00,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:00,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:00,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127044333] [2020-01-16 19:08:00,045 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:00,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:00,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:00,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:00,046 INFO L87 Difference]: Start difference. First operand 378 states and 1299 transitions. Second operand 9 states. [2020-01-16 19:08:00,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:00,162 INFO L93 Difference]: Finished difference Result 532 states and 1586 transitions. [2020-01-16 19:08:00,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:00,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:00,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:00,164 INFO L225 Difference]: With dead ends: 532 [2020-01-16 19:08:00,164 INFO L226 Difference]: Without dead ends: 521 [2020-01-16 19:08:00,164 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:00,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-01-16 19:08:00,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 380. [2020-01-16 19:08:00,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:00,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1303 transitions. [2020-01-16 19:08:00,173 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1303 transitions. Word has length 22 [2020-01-16 19:08:00,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:00,173 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1303 transitions. [2020-01-16 19:08:00,173 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:00,174 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1303 transitions. [2020-01-16 19:08:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:00,174 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:00,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, 1, 1, 1] [2020-01-16 19:08:00,174 INFO L426 AbstractCegarLoop]: === Iteration 1358 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:00,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:00,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2139307838, now seen corresponding path program 1352 times [2020-01-16 19:08:00,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:00,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239466866] [2020-01-16 19:08:00,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:00,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-01-16 19:08:00,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239466866] [2020-01-16 19:08:00,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:00,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:00,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39439475] [2020-01-16 19:08:00,457 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:00,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:00,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:00,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:00,457 INFO L87 Difference]: Start difference. First operand 380 states and 1303 transitions. Second operand 9 states. [2020-01-16 19:08:00,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:00,547 INFO L93 Difference]: Finished difference Result 530 states and 1581 transitions. [2020-01-16 19:08:00,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:00,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:00,549 INFO L225 Difference]: With dead ends: 530 [2020-01-16 19:08:00,549 INFO L226 Difference]: Without dead ends: 520 [2020-01-16 19:08:00,549 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:00,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2020-01-16 19:08:00,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 379. [2020-01-16 19:08:00,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1301 transitions. [2020-01-16 19:08:00,557 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1301 transitions. Word has length 22 [2020-01-16 19:08:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:00,557 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1301 transitions. [2020-01-16 19:08:00,558 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1301 transitions. [2020-01-16 19:08:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:00,558 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:00,558 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:00,558 INFO L426 AbstractCegarLoop]: === Iteration 1359 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:00,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:00,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1297887770, now seen corresponding path program 1353 times [2020-01-16 19:08:00,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:00,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321193135] [2020-01-16 19:08:00,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:00,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321193135] [2020-01-16 19:08:00,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:00,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:00,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553743584] [2020-01-16 19:08:00,845 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:00,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:00,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:00,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:00,846 INFO L87 Difference]: Start difference. First operand 379 states and 1301 transitions. Second operand 9 states. [2020-01-16 19:08:00,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:00,961 INFO L93 Difference]: Finished difference Result 534 states and 1592 transitions. [2020-01-16 19:08:00,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:00,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:00,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:00,963 INFO L225 Difference]: With dead ends: 534 [2020-01-16 19:08:00,963 INFO L226 Difference]: Without dead ends: 523 [2020-01-16 19:08:00,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:00,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-01-16 19:08:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 382. [2020-01-16 19:08:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:08:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1306 transitions. [2020-01-16 19:08:00,972 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1306 transitions. Word has length 22 [2020-01-16 19:08:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:00,972 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1306 transitions. [2020-01-16 19:08:00,972 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:00,972 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1306 transitions. [2020-01-16 19:08:00,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:00,973 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:00,973 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:00,973 INFO L426 AbstractCegarLoop]: === Iteration 1360 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:00,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:00,973 INFO L82 PathProgramCache]: Analyzing trace with hash -995869826, now seen corresponding path program 1354 times [2020-01-16 19:08:00,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:00,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039543127] [2020-01-16 19:08:00,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:01,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039543127] [2020-01-16 19:08:01,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:01,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:01,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392037264] [2020-01-16 19:08:01,255 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:01,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:01,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:01,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:01,256 INFO L87 Difference]: Start difference. First operand 382 states and 1306 transitions. Second operand 9 states. [2020-01-16 19:08:01,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:01,367 INFO L93 Difference]: Finished difference Result 526 states and 1583 transitions. [2020-01-16 19:08:01,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:01,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:01,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:01,369 INFO L225 Difference]: With dead ends: 526 [2020-01-16 19:08:01,369 INFO L226 Difference]: Without dead ends: 511 [2020-01-16 19:08:01,369 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:01,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2020-01-16 19:08:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 379. [2020-01-16 19:08:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1300 transitions. [2020-01-16 19:08:01,377 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1300 transitions. Word has length 22 [2020-01-16 19:08:01,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:01,377 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1300 transitions. [2020-01-16 19:08:01,377 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1300 transitions. [2020-01-16 19:08:01,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:01,378 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:01,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, 1, 1, 1] [2020-01-16 19:08:01,378 INFO L426 AbstractCegarLoop]: === Iteration 1361 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:01,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:01,378 INFO L82 PathProgramCache]: Analyzing trace with hash -48875338, now seen corresponding path program 1355 times [2020-01-16 19:08:01,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:01,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961707446] [2020-01-16 19:08:01,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:01,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-01-16 19:08:01,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961707446] [2020-01-16 19:08:01,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:01,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:01,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148343087] [2020-01-16 19:08:01,660 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:01,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:01,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:01,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:01,661 INFO L87 Difference]: Start difference. First operand 379 states and 1300 transitions. Second operand 9 states. [2020-01-16 19:08:01,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:01,752 INFO L93 Difference]: Finished difference Result 530 states and 1581 transitions. [2020-01-16 19:08:01,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:01,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:01,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:01,754 INFO L225 Difference]: With dead ends: 530 [2020-01-16 19:08:01,754 INFO L226 Difference]: Without dead ends: 521 [2020-01-16 19:08:01,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:01,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-01-16 19:08:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 380. [2020-01-16 19:08:01,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-01-16 19:08:01,763 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-01-16 19:08:01,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:01,763 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-01-16 19:08:01,763 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:01,763 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-01-16 19:08:01,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:01,764 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:01,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, 1, 1, 1] [2020-01-16 19:08:01,764 INFO L426 AbstractCegarLoop]: === Iteration 1362 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:01,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:01,764 INFO L82 PathProgramCache]: Analyzing trace with hash 486354464, now seen corresponding path program 1356 times [2020-01-16 19:08:01,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:01,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115020288] [2020-01-16 19:08:01,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:02,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-01-16 19:08:02,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115020288] [2020-01-16 19:08:02,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:02,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:02,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697807676] [2020-01-16 19:08:02,042 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:02,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:02,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:02,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:02,042 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-01-16 19:08:02,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:02,154 INFO L93 Difference]: Finished difference Result 524 states and 1578 transitions. [2020-01-16 19:08:02,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:02,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:02,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:02,155 INFO L225 Difference]: With dead ends: 524 [2020-01-16 19:08:02,156 INFO L226 Difference]: Without dead ends: 510 [2020-01-16 19:08:02,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:02,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2020-01-16 19:08:02,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 378. [2020-01-16 19:08:02,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:08:02,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1298 transitions. [2020-01-16 19:08:02,169 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1298 transitions. Word has length 22 [2020-01-16 19:08:02,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:02,169 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1298 transitions. [2020-01-16 19:08:02,169 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:02,169 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1298 transitions. [2020-01-16 19:08:02,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:02,170 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:02,170 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:02,170 INFO L426 AbstractCegarLoop]: === Iteration 1363 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:02,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:02,170 INFO L82 PathProgramCache]: Analyzing trace with hash -384546224, now seen corresponding path program 1357 times [2020-01-16 19:08:02,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:02,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125528659] [2020-01-16 19:08:02,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:02,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125528659] [2020-01-16 19:08:02,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:02,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:02,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390503738] [2020-01-16 19:08:02,453 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:02,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:02,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:02,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:02,454 INFO L87 Difference]: Start difference. First operand 378 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:08:02,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:02,570 INFO L93 Difference]: Finished difference Result 537 states and 1599 transitions. [2020-01-16 19:08:02,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:02,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:02,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:02,572 INFO L225 Difference]: With dead ends: 537 [2020-01-16 19:08:02,572 INFO L226 Difference]: Without dead ends: 526 [2020-01-16 19:08:02,572 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:02,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-01-16 19:08:02,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 382. [2020-01-16 19:08:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:08:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1308 transitions. [2020-01-16 19:08:02,581 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1308 transitions. Word has length 22 [2020-01-16 19:08:02,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:02,581 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1308 transitions. [2020-01-16 19:08:02,581 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1308 transitions. [2020-01-16 19:08:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:02,582 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:02,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, 1, 1, 1] [2020-01-16 19:08:02,582 INFO L426 AbstractCegarLoop]: === Iteration 1364 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:02,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:02,582 INFO L82 PathProgramCache]: Analyzing trace with hash -131453472, now seen corresponding path program 1358 times [2020-01-16 19:08:02,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:02,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677719140] [2020-01-16 19:08:02,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:02,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677719140] [2020-01-16 19:08:02,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:02,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:02,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874706207] [2020-01-16 19:08:02,865 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:02,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:02,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:02,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:02,866 INFO L87 Difference]: Start difference. First operand 382 states and 1308 transitions. Second operand 9 states. [2020-01-16 19:08:02,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:02,981 INFO L93 Difference]: Finished difference Result 536 states and 1595 transitions. [2020-01-16 19:08:02,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:02,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:02,983 INFO L225 Difference]: With dead ends: 536 [2020-01-16 19:08:02,983 INFO L226 Difference]: Without dead ends: 524 [2020-01-16 19:08:02,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:02,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-01-16 19:08:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 380. [2020-01-16 19:08:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1303 transitions. [2020-01-16 19:08:02,992 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1303 transitions. Word has length 22 [2020-01-16 19:08:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:02,992 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1303 transitions. [2020-01-16 19:08:02,992 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1303 transitions. [2020-01-16 19:08:02,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:02,993 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:02,993 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:02,993 INFO L426 AbstractCegarLoop]: === Iteration 1365 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:02,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:02,993 INFO L82 PathProgramCache]: Analyzing trace with hash 628146308, now seen corresponding path program 1359 times [2020-01-16 19:08:02,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:02,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503085087] [2020-01-16 19:08:02,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:03,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-01-16 19:08:03,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503085087] [2020-01-16 19:08:03,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:03,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:03,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085335971] [2020-01-16 19:08:03,267 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:03,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:03,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:03,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:03,267 INFO L87 Difference]: Start difference. First operand 380 states and 1303 transitions. Second operand 9 states. [2020-01-16 19:08:03,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:03,393 INFO L93 Difference]: Finished difference Result 537 states and 1599 transitions. [2020-01-16 19:08:03,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:03,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:03,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:03,395 INFO L225 Difference]: With dead ends: 537 [2020-01-16 19:08:03,395 INFO L226 Difference]: Without dead ends: 526 [2020-01-16 19:08:03,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:03,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-01-16 19:08:03,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 383. [2020-01-16 19:08:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:08:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1308 transitions. [2020-01-16 19:08:03,404 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1308 transitions. Word has length 22 [2020-01-16 19:08:03,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:03,404 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1308 transitions. [2020-01-16 19:08:03,404 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:03,404 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1308 transitions. [2020-01-16 19:08:03,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:03,405 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:03,405 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:03,405 INFO L426 AbstractCegarLoop]: === Iteration 1366 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:03,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:03,405 INFO L82 PathProgramCache]: Analyzing trace with hash 930164252, now seen corresponding path program 1360 times [2020-01-16 19:08:03,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:03,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219109920] [2020-01-16 19:08:03,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:03,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-01-16 19:08:03,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219109920] [2020-01-16 19:08:03,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:03,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:03,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484622337] [2020-01-16 19:08:03,692 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:03,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:03,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:03,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:03,692 INFO L87 Difference]: Start difference. First operand 383 states and 1308 transitions. Second operand 9 states. [2020-01-16 19:08:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:03,804 INFO L93 Difference]: Finished difference Result 529 states and 1590 transitions. [2020-01-16 19:08:03,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:03,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:03,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:03,806 INFO L225 Difference]: With dead ends: 529 [2020-01-16 19:08:03,806 INFO L226 Difference]: Without dead ends: 514 [2020-01-16 19:08:03,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-01-16 19:08:03,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 380. [2020-01-16 19:08:03,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:03,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-01-16 19:08:03,815 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-01-16 19:08:03,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:03,815 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-01-16 19:08:03,815 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:03,815 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-01-16 19:08:03,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:03,816 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:03,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, 1, 1, 1] [2020-01-16 19:08:03,816 INFO L426 AbstractCegarLoop]: === Iteration 1367 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:03,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:03,816 INFO L82 PathProgramCache]: Analyzing trace with hash -661860224, now seen corresponding path program 1361 times [2020-01-16 19:08:03,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:03,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184510574] [2020-01-16 19:08:03,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:04,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:04,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184510574] [2020-01-16 19:08:04,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:04,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:04,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281193184] [2020-01-16 19:08:04,089 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:04,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:04,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:04,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:04,090 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-01-16 19:08:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:04,203 INFO L93 Difference]: Finished difference Result 535 states and 1592 transitions. [2020-01-16 19:08:04,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:04,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:04,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:04,205 INFO L225 Difference]: With dead ends: 535 [2020-01-16 19:08:04,205 INFO L226 Difference]: Without dead ends: 525 [2020-01-16 19:08:04,205 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:04,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2020-01-16 19:08:04,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 382. [2020-01-16 19:08:04,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:08:04,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1304 transitions. [2020-01-16 19:08:04,213 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1304 transitions. Word has length 22 [2020-01-16 19:08:04,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:04,213 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1304 transitions. [2020-01-16 19:08:04,213 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:04,214 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1304 transitions. [2020-01-16 19:08:04,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:04,214 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:04,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, 1, 1, 1] [2020-01-16 19:08:04,214 INFO L426 AbstractCegarLoop]: === Iteration 1368 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:04,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:04,214 INFO L82 PathProgramCache]: Analyzing trace with hash -835107916, now seen corresponding path program 1362 times [2020-01-16 19:08:04,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:04,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003571387] [2020-01-16 19:08:04,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:04,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003571387] [2020-01-16 19:08:04,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:04,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:04,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125675927] [2020-01-16 19:08:04,484 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:04,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:04,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:04,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:04,484 INFO L87 Difference]: Start difference. First operand 382 states and 1304 transitions. Second operand 9 states. [2020-01-16 19:08:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:04,617 INFO L93 Difference]: Finished difference Result 528 states and 1586 transitions. [2020-01-16 19:08:04,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:04,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:04,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:04,619 INFO L225 Difference]: With dead ends: 528 [2020-01-16 19:08:04,619 INFO L226 Difference]: Without dead ends: 512 [2020-01-16 19:08:04,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:04,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2020-01-16 19:08:04,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 378. [2020-01-16 19:08:04,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:08:04,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1297 transitions. [2020-01-16 19:08:04,627 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1297 transitions. Word has length 22 [2020-01-16 19:08:04,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:04,627 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1297 transitions. [2020-01-16 19:08:04,628 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1297 transitions. [2020-01-16 19:08:04,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:04,628 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:04,628 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:04,628 INFO L426 AbstractCegarLoop]: === Iteration 1369 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:04,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:04,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1504467010, now seen corresponding path program 1363 times [2020-01-16 19:08:04,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:04,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485661848] [2020-01-16 19:08:04,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:04,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-01-16 19:08:04,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485661848] [2020-01-16 19:08:04,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:04,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:04,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974670547] [2020-01-16 19:08:04,918 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:04,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:04,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:04,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:04,918 INFO L87 Difference]: Start difference. First operand 378 states and 1297 transitions. Second operand 9 states. [2020-01-16 19:08:05,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:05,014 INFO L93 Difference]: Finished difference Result 527 states and 1573 transitions. [2020-01-16 19:08:05,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:05,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:05,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:05,015 INFO L225 Difference]: With dead ends: 527 [2020-01-16 19:08:05,015 INFO L226 Difference]: Without dead ends: 518 [2020-01-16 19:08:05,016 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-01-16 19:08:05,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 380. [2020-01-16 19:08:05,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:05,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-01-16 19:08:05,024 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-01-16 19:08:05,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:05,025 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-01-16 19:08:05,025 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:05,025 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-01-16 19:08:05,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:05,025 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:05,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, 1, 1, 1] [2020-01-16 19:08:05,026 INFO L426 AbstractCegarLoop]: === Iteration 1370 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:05,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:05,026 INFO L82 PathProgramCache]: Analyzing trace with hash 106473948, now seen corresponding path program 1364 times [2020-01-16 19:08:05,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:05,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010739486] [2020-01-16 19:08:05,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:05,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010739486] [2020-01-16 19:08:05,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:05,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:05,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575769183] [2020-01-16 19:08:05,313 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:05,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:05,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:05,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:05,313 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-01-16 19:08:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:05,430 INFO L93 Difference]: Finished difference Result 528 states and 1574 transitions. [2020-01-16 19:08:05,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:05,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:05,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:05,432 INFO L225 Difference]: With dead ends: 528 [2020-01-16 19:08:05,432 INFO L226 Difference]: Without dead ends: 517 [2020-01-16 19:08:05,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:05,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-01-16 19:08:05,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 379. [2020-01-16 19:08:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1299 transitions. [2020-01-16 19:08:05,441 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1299 transitions. Word has length 22 [2020-01-16 19:08:05,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:05,442 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1299 transitions. [2020-01-16 19:08:05,442 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1299 transitions. [2020-01-16 19:08:05,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:05,442 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:05,442 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:05,442 INFO L426 AbstractCegarLoop]: === Iteration 1371 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:05,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:05,442 INFO L82 PathProgramCache]: Analyzing trace with hash -491774478, now seen corresponding path program 1365 times [2020-01-16 19:08:05,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:05,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326734323] [2020-01-16 19:08:05,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:05,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-01-16 19:08:05,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326734323] [2020-01-16 19:08:05,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:05,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:05,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297593474] [2020-01-16 19:08:05,723 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:05,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:05,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:05,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:05,724 INFO L87 Difference]: Start difference. First operand 379 states and 1299 transitions. Second operand 9 states. [2020-01-16 19:08:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:05,811 INFO L93 Difference]: Finished difference Result 528 states and 1575 transitions. [2020-01-16 19:08:05,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:05,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:05,812 INFO L225 Difference]: With dead ends: 528 [2020-01-16 19:08:05,813 INFO L226 Difference]: Without dead ends: 519 [2020-01-16 19:08:05,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:05,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-01-16 19:08:05,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 380. [2020-01-16 19:08:05,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1300 transitions. [2020-01-16 19:08:05,821 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1300 transitions. Word has length 22 [2020-01-16 19:08:05,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:05,821 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1300 transitions. [2020-01-16 19:08:05,821 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1300 transitions. [2020-01-16 19:08:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:05,821 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:05,822 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:05,822 INFO L426 AbstractCegarLoop]: === Iteration 1372 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:05,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:05,822 INFO L82 PathProgramCache]: Analyzing trace with hash 43455324, now seen corresponding path program 1366 times [2020-01-16 19:08:05,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:05,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577411388] [2020-01-16 19:08:05,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:06,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-01-16 19:08:06,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577411388] [2020-01-16 19:08:06,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:06,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:06,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579263064] [2020-01-16 19:08:06,101 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:06,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:06,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:06,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:06,102 INFO L87 Difference]: Start difference. First operand 380 states and 1300 transitions. Second operand 9 states. [2020-01-16 19:08:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:06,218 INFO L93 Difference]: Finished difference Result 522 states and 1572 transitions. [2020-01-16 19:08:06,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:06,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:06,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:06,220 INFO L225 Difference]: With dead ends: 522 [2020-01-16 19:08:06,220 INFO L226 Difference]: Without dead ends: 509 [2020-01-16 19:08:06,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:06,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2020-01-16 19:08:06,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 379. [2020-01-16 19:08:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-01-16 19:08:06,227 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-01-16 19:08:06,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:06,227 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-01-16 19:08:06,227 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-01-16 19:08:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:06,228 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:06,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, 1, 1, 1] [2020-01-16 19:08:06,228 INFO L426 AbstractCegarLoop]: === Iteration 1373 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:06,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:06,228 INFO L82 PathProgramCache]: Analyzing trace with hash -481271374, now seen corresponding path program 1367 times [2020-01-16 19:08:06,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:06,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362407295] [2020-01-16 19:08:06,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:06,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-01-16 19:08:06,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362407295] [2020-01-16 19:08:06,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:06,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:06,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675205928] [2020-01-16 19:08:06,505 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:06,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:06,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:06,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:06,505 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:08:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:06,636 INFO L93 Difference]: Finished difference Result 530 states and 1579 transitions. [2020-01-16 19:08:06,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:06,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:06,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:06,645 INFO L225 Difference]: With dead ends: 530 [2020-01-16 19:08:06,645 INFO L226 Difference]: Without dead ends: 520 [2020-01-16 19:08:06,645 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:06,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2020-01-16 19:08:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 381. [2020-01-16 19:08:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:08:06,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1301 transitions. [2020-01-16 19:08:06,652 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1301 transitions. Word has length 22 [2020-01-16 19:08:06,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:06,653 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1301 transitions. [2020-01-16 19:08:06,653 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1301 transitions. [2020-01-16 19:08:06,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:06,653 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:06,653 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:06,653 INFO L426 AbstractCegarLoop]: === Iteration 1374 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:06,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:06,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1556982530, now seen corresponding path program 1368 times [2020-01-16 19:08:06,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:06,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64180776] [2020-01-16 19:08:06,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:06,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-01-16 19:08:06,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64180776] [2020-01-16 19:08:06,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:06,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:06,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234825413] [2020-01-16 19:08:06,927 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:06,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:06,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:06,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:06,927 INFO L87 Difference]: Start difference. First operand 381 states and 1301 transitions. Second operand 9 states. [2020-01-16 19:08:07,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:07,033 INFO L93 Difference]: Finished difference Result 523 states and 1573 transitions. [2020-01-16 19:08:07,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:07,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:07,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:07,035 INFO L225 Difference]: With dead ends: 523 [2020-01-16 19:08:07,035 INFO L226 Difference]: Without dead ends: 507 [2020-01-16 19:08:07,035 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:07,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2020-01-16 19:08:07,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 377. [2020-01-16 19:08:07,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:08:07,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1295 transitions. [2020-01-16 19:08:07,044 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1295 transitions. Word has length 22 [2020-01-16 19:08:07,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:07,044 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1295 transitions. [2020-01-16 19:08:07,044 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1295 transitions. [2020-01-16 19:08:07,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:07,045 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:07,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, 1, 1, 1] [2020-01-16 19:08:07,045 INFO L426 AbstractCegarLoop]: === Iteration 1375 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:07,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:07,045 INFO L82 PathProgramCache]: Analyzing trace with hash 321223556, now seen corresponding path program 1369 times [2020-01-16 19:08:07,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:07,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244129040] [2020-01-16 19:08:07,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:07,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244129040] [2020-01-16 19:08:07,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:07,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:07,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118669844] [2020-01-16 19:08:07,305 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:07,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:07,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:07,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:07,305 INFO L87 Difference]: Start difference. First operand 377 states and 1295 transitions. Second operand 9 states. [2020-01-16 19:08:07,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:07,423 INFO L93 Difference]: Finished difference Result 543 states and 1613 transitions. [2020-01-16 19:08:07,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:07,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:07,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:07,424 INFO L225 Difference]: With dead ends: 543 [2020-01-16 19:08:07,425 INFO L226 Difference]: Without dead ends: 532 [2020-01-16 19:08:07,425 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-01-16 19:08:07,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 380. [2020-01-16 19:08:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1303 transitions. [2020-01-16 19:08:07,433 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1303 transitions. Word has length 22 [2020-01-16 19:08:07,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:07,434 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1303 transitions. [2020-01-16 19:08:07,434 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:07,434 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1303 transitions. [2020-01-16 19:08:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:07,434 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:07,434 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:07,435 INFO L426 AbstractCegarLoop]: === Iteration 1376 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:07,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:07,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1124293454, now seen corresponding path program 1370 times [2020-01-16 19:08:07,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:07,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134853319] [2020-01-16 19:08:07,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:07,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-01-16 19:08:07,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134853319] [2020-01-16 19:08:07,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:07,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:07,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40885232] [2020-01-16 19:08:07,709 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:07,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:07,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:07,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:07,710 INFO L87 Difference]: Start difference. First operand 380 states and 1303 transitions. Second operand 9 states. [2020-01-16 19:08:07,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:07,805 INFO L93 Difference]: Finished difference Result 541 states and 1608 transitions. [2020-01-16 19:08:07,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:07,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:07,806 INFO L225 Difference]: With dead ends: 541 [2020-01-16 19:08:07,807 INFO L226 Difference]: Without dead ends: 531 [2020-01-16 19:08:07,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-01-16 19:08:07,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 379. [2020-01-16 19:08:07,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:07,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1301 transitions. [2020-01-16 19:08:07,815 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1301 transitions. Word has length 22 [2020-01-16 19:08:07,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:07,815 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1301 transitions. [2020-01-16 19:08:07,816 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:07,816 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1301 transitions. [2020-01-16 19:08:07,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:07,816 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:07,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, 1, 1, 1] [2020-01-16 19:08:07,816 INFO L426 AbstractCegarLoop]: === Iteration 1377 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:07,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:07,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1333916088, now seen corresponding path program 1371 times [2020-01-16 19:08:07,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:07,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187144707] [2020-01-16 19:08:07,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:08,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:08,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187144707] [2020-01-16 19:08:08,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:08,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:08,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103792049] [2020-01-16 19:08:08,073 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:08,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:08,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:08,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:08,074 INFO L87 Difference]: Start difference. First operand 379 states and 1301 transitions. Second operand 9 states. [2020-01-16 19:08:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:08,193 INFO L93 Difference]: Finished difference Result 550 states and 1628 transitions. [2020-01-16 19:08:08,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:08,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:08,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:08,194 INFO L225 Difference]: With dead ends: 550 [2020-01-16 19:08:08,195 INFO L226 Difference]: Without dead ends: 539 [2020-01-16 19:08:08,195 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:08,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-01-16 19:08:08,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 382. [2020-01-16 19:08:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:08:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1306 transitions. [2020-01-16 19:08:08,204 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1306 transitions. Word has length 22 [2020-01-16 19:08:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:08,204 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1306 transitions. [2020-01-16 19:08:08,204 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1306 transitions. [2020-01-16 19:08:08,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:08,205 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:08,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, 1, 1, 1] [2020-01-16 19:08:08,205 INFO L426 AbstractCegarLoop]: === Iteration 1378 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:08,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:08,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1575016078, now seen corresponding path program 1372 times [2020-01-16 19:08:08,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:08,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091473686] [2020-01-16 19:08:08,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:08,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-01-16 19:08:08,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091473686] [2020-01-16 19:08:08,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:08,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:08,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195362103] [2020-01-16 19:08:08,460 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:08,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:08,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:08,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:08,461 INFO L87 Difference]: Start difference. First operand 382 states and 1306 transitions. Second operand 9 states. [2020-01-16 19:08:08,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:08,582 INFO L93 Difference]: Finished difference Result 553 states and 1631 transitions. [2020-01-16 19:08:08,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:08,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:08,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:08,584 INFO L225 Difference]: With dead ends: 553 [2020-01-16 19:08:08,584 INFO L226 Difference]: Without dead ends: 536 [2020-01-16 19:08:08,584 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-01-16 19:08:08,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 379. [2020-01-16 19:08:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1300 transitions. [2020-01-16 19:08:08,593 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1300 transitions. Word has length 22 [2020-01-16 19:08:08,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:08,593 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1300 transitions. [2020-01-16 19:08:08,593 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1300 transitions. [2020-01-16 19:08:08,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:08,594 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:08,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, 1, 1, 1] [2020-01-16 19:08:08,594 INFO L426 AbstractCegarLoop]: === Iteration 1379 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:08,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:08,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1712038776, now seen corresponding path program 1373 times [2020-01-16 19:08:08,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:08,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853290829] [2020-01-16 19:08:08,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:08,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853290829] [2020-01-16 19:08:08,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:08,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:08,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409921382] [2020-01-16 19:08:08,853 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:08,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:08,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:08,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:08,853 INFO L87 Difference]: Start difference. First operand 379 states and 1300 transitions. Second operand 9 states. [2020-01-16 19:08:08,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:08,937 INFO L93 Difference]: Finished difference Result 544 states and 1613 transitions. [2020-01-16 19:08:08,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:08,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:08,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:08,939 INFO L225 Difference]: With dead ends: 544 [2020-01-16 19:08:08,939 INFO L226 Difference]: Without dead ends: 535 [2020-01-16 19:08:08,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:08,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-01-16 19:08:08,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 380. [2020-01-16 19:08:08,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:08,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-01-16 19:08:08,948 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-01-16 19:08:08,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:08,948 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-01-16 19:08:08,948 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-01-16 19:08:08,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:08,949 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08: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, 1, 1, 1] [2020-01-16 19:08:08,949 INFO L426 AbstractCegarLoop]: === Iteration 1380 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:08,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:08,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1507217364, now seen corresponding path program 1374 times [2020-01-16 19:08:08,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:08,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923257925] [2020-01-16 19:08:08,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:09,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923257925] [2020-01-16 19:08:09,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:09,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:09,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548590812] [2020-01-16 19:08:09,200 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:09,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:09,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:09,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:09,200 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-01-16 19:08:09,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:09,303 INFO L93 Difference]: Finished difference Result 549 states and 1622 transitions. [2020-01-16 19:08:09,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:09,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:09,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:09,304 INFO L225 Difference]: With dead ends: 549 [2020-01-16 19:08:09,304 INFO L226 Difference]: Without dead ends: 533 [2020-01-16 19:08:09,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:09,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-01-16 19:08:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 378. [2020-01-16 19:08:09,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:08:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1298 transitions. [2020-01-16 19:08:09,313 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1298 transitions. Word has length 22 [2020-01-16 19:08:09,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:09,313 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1298 transitions. [2020-01-16 19:08:09,313 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:09,313 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1298 transitions. [2020-01-16 19:08:09,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:09,314 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:09,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, 1, 1, 1] [2020-01-16 19:08:09,314 INFO L426 AbstractCegarLoop]: === Iteration 1381 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:09,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:09,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2047709662, now seen corresponding path program 1375 times [2020-01-16 19:08:09,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:09,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540696528] [2020-01-16 19:08:09,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:09,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540696528] [2020-01-16 19:08:09,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:09,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:09,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868211450] [2020-01-16 19:08:09,574 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:09,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:09,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:09,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:09,574 INFO L87 Difference]: Start difference. First operand 378 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:08:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:09,695 INFO L93 Difference]: Finished difference Result 540 states and 1606 transitions. [2020-01-16 19:08:09,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:09,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:09,702 INFO L225 Difference]: With dead ends: 540 [2020-01-16 19:08:09,702 INFO L226 Difference]: Without dead ends: 529 [2020-01-16 19:08:09,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:09,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-01-16 19:08:09,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 380. [2020-01-16 19:08:09,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1302 transitions. [2020-01-16 19:08:09,710 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1302 transitions. Word has length 22 [2020-01-16 19:08:09,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:09,710 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1302 transitions. [2020-01-16 19:08:09,710 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:09,710 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1302 transitions. [2020-01-16 19:08:09,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:09,711 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:09,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, 1, 1, 1] [2020-01-16 19:08:09,711 INFO L426 AbstractCegarLoop]: === Iteration 1382 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:09,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:09,711 INFO L82 PathProgramCache]: Analyzing trace with hash 801740624, now seen corresponding path program 1376 times [2020-01-16 19:08:09,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:09,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713873257] [2020-01-16 19:08:09,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:09,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713873257] [2020-01-16 19:08:09,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:09,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:09,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849014796] [2020-01-16 19:08:09,977 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:09,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:09,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:09,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:09,977 INFO L87 Difference]: Start difference. First operand 380 states and 1302 transitions. Second operand 9 states. [2020-01-16 19:08:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:10,083 INFO L93 Difference]: Finished difference Result 538 states and 1601 transitions. [2020-01-16 19:08:10,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:10,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:10,084 INFO L225 Difference]: With dead ends: 538 [2020-01-16 19:08:10,085 INFO L226 Difference]: Without dead ends: 528 [2020-01-16 19:08:10,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:10,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-01-16 19:08:10,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 379. [2020-01-16 19:08:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1300 transitions. [2020-01-16 19:08:10,093 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1300 transitions. Word has length 22 [2020-01-16 19:08:10,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:10,094 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1300 transitions. [2020-01-16 19:08:10,094 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1300 transitions. [2020-01-16 19:08:10,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:10,094 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:10,094 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:10,094 INFO L426 AbstractCegarLoop]: === Iteration 1383 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:10,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:10,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1659512312, now seen corresponding path program 1377 times [2020-01-16 19:08:10,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:10,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051969702] [2020-01-16 19:08:10,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:10,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-01-16 19:08:10,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051969702] [2020-01-16 19:08:10,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:10,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:10,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913129711] [2020-01-16 19:08:10,353 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:10,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:10,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:10,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:10,353 INFO L87 Difference]: Start difference. First operand 379 states and 1300 transitions. Second operand 9 states. [2020-01-16 19:08:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:10,456 INFO L93 Difference]: Finished difference Result 542 states and 1612 transitions. [2020-01-16 19:08:10,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:10,457 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:10,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:10,458 INFO L225 Difference]: With dead ends: 542 [2020-01-16 19:08:10,458 INFO L226 Difference]: Without dead ends: 531 [2020-01-16 19:08:10,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-01-16 19:08:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 382. [2020-01-16 19:08:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:08:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1305 transitions. [2020-01-16 19:08:10,466 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1305 transitions. Word has length 22 [2020-01-16 19:08:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:10,466 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1305 transitions. [2020-01-16 19:08:10,466 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1305 transitions. [2020-01-16 19:08:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:10,467 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:10,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, 1, 1, 1] [2020-01-16 19:08:10,467 INFO L426 AbstractCegarLoop]: === Iteration 1384 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:10,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:10,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1961530256, now seen corresponding path program 1378 times [2020-01-16 19:08:10,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:10,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033474309] [2020-01-16 19:08:10,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:10,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:10,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033474309] [2020-01-16 19:08:10,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:10,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:10,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723144411] [2020-01-16 19:08:10,724 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:10,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:10,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:10,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:10,725 INFO L87 Difference]: Start difference. First operand 382 states and 1305 transitions. Second operand 9 states. [2020-01-16 19:08:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:10,851 INFO L93 Difference]: Finished difference Result 534 states and 1603 transitions. [2020-01-16 19:08:10,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:10,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:10,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:10,853 INFO L225 Difference]: With dead ends: 534 [2020-01-16 19:08:10,853 INFO L226 Difference]: Without dead ends: 519 [2020-01-16 19:08:10,853 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:10,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-01-16 19:08:10,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 379. [2020-01-16 19:08:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:10,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1299 transitions. [2020-01-16 19:08:10,861 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1299 transitions. Word has length 22 [2020-01-16 19:08:10,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:10,862 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1299 transitions. [2020-01-16 19:08:10,862 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:10,862 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1299 transitions. [2020-01-16 19:08:10,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:10,862 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:10,862 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:10,862 INFO L426 AbstractCegarLoop]: === Iteration 1385 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:10,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:10,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1386442552, now seen corresponding path program 1379 times [2020-01-16 19:08:10,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:10,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727596477] [2020-01-16 19:08:10,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:11,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727596477] [2020-01-16 19:08:11,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:11,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:11,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383199728] [2020-01-16 19:08:11,125 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:11,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:11,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:11,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:11,126 INFO L87 Difference]: Start difference. First operand 379 states and 1299 transitions. Second operand 9 states. [2020-01-16 19:08:11,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:11,220 INFO L93 Difference]: Finished difference Result 538 states and 1601 transitions. [2020-01-16 19:08:11,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:11,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:11,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:11,222 INFO L225 Difference]: With dead ends: 538 [2020-01-16 19:08:11,222 INFO L226 Difference]: Without dead ends: 529 [2020-01-16 19:08:11,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-01-16 19:08:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 380. [2020-01-16 19:08:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1300 transitions. [2020-01-16 19:08:11,231 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1300 transitions. Word has length 22 [2020-01-16 19:08:11,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:11,232 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1300 transitions. [2020-01-16 19:08:11,237 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1300 transitions. [2020-01-16 19:08:11,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:11,238 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:11,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, 1, 1, 1] [2020-01-16 19:08:11,238 INFO L426 AbstractCegarLoop]: === Iteration 1386 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:11,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:11,238 INFO L82 PathProgramCache]: Analyzing trace with hash -851212750, now seen corresponding path program 1380 times [2020-01-16 19:08:11,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:11,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216451128] [2020-01-16 19:08:11,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08: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-01-16 19:08:11,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216451128] [2020-01-16 19:08:11,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:11,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:11,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406234277] [2020-01-16 19:08:11,498 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:11,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:11,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:11,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:11,498 INFO L87 Difference]: Start difference. First operand 380 states and 1300 transitions. Second operand 9 states. [2020-01-16 19:08:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:11,625 INFO L93 Difference]: Finished difference Result 532 states and 1598 transitions. [2020-01-16 19:08:11,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:11,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:11,627 INFO L225 Difference]: With dead ends: 532 [2020-01-16 19:08:11,627 INFO L226 Difference]: Without dead ends: 518 [2020-01-16 19:08:11,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:11,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-01-16 19:08:11,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 378. [2020-01-16 19:08:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:08:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1297 transitions. [2020-01-16 19:08:11,636 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1297 transitions. Word has length 22 [2020-01-16 19:08:11,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:11,636 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1297 transitions. [2020-01-16 19:08:11,637 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1297 transitions. [2020-01-16 19:08:11,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:11,637 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:11,637 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:11,637 INFO L426 AbstractCegarLoop]: === Iteration 1387 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:11,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:11,637 INFO L82 PathProgramCache]: Analyzing trace with hash 293680290, now seen corresponding path program 1381 times [2020-01-16 19:08:11,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:11,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874907099] [2020-01-16 19:08:11,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:11,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-01-16 19:08:11,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874907099] [2020-01-16 19:08:11,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:11,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:11,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663317310] [2020-01-16 19:08:11,892 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:11,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:11,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:11,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:11,892 INFO L87 Difference]: Start difference. First operand 378 states and 1297 transitions. Second operand 9 states. [2020-01-16 19:08:12,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:12,009 INFO L93 Difference]: Finished difference Result 557 states and 1648 transitions. [2020-01-16 19:08:12,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:12,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:12,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:12,010 INFO L225 Difference]: With dead ends: 557 [2020-01-16 19:08:12,010 INFO L226 Difference]: Without dead ends: 546 [2020-01-16 19:08:12,011 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:12,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-01-16 19:08:12,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 384. [2020-01-16 19:08:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:08:12,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1313 transitions. [2020-01-16 19:08:12,019 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1313 transitions. Word has length 22 [2020-01-16 19:08:12,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:12,019 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1313 transitions. [2020-01-16 19:08:12,019 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1313 transitions. [2020-01-16 19:08:12,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:12,020 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:12,020 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:12,020 INFO L426 AbstractCegarLoop]: === Iteration 1388 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:12,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:12,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1679715420, now seen corresponding path program 1382 times [2020-01-16 19:08:12,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:12,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319902593] [2020-01-16 19:08:12,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:12,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319902593] [2020-01-16 19:08:12,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:12,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:12,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281409313] [2020-01-16 19:08:12,275 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:12,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:12,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:12,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:12,276 INFO L87 Difference]: Start difference. First operand 384 states and 1313 transitions. Second operand 9 states. [2020-01-16 19:08:12,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:12,388 INFO L93 Difference]: Finished difference Result 560 states and 1651 transitions. [2020-01-16 19:08:12,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:12,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:12,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:12,389 INFO L225 Difference]: With dead ends: 560 [2020-01-16 19:08:12,390 INFO L226 Difference]: Without dead ends: 543 [2020-01-16 19:08:12,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-01-16 19:08:12,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 381. [2020-01-16 19:08:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:08:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1305 transitions. [2020-01-16 19:08:12,398 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1305 transitions. Word has length 22 [2020-01-16 19:08:12,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:12,398 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1305 transitions. [2020-01-16 19:08:12,398 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:12,398 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1305 transitions. [2020-01-16 19:08:12,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:12,399 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:12,399 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:12,399 INFO L426 AbstractCegarLoop]: === Iteration 1389 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:12,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:12,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1306757564, now seen corresponding path program 1383 times [2020-01-16 19:08:12,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:12,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723516563] [2020-01-16 19:08:12,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:12,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723516563] [2020-01-16 19:08:12,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:12,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:12,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045266728] [2020-01-16 19:08:12,657 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:12,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:12,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:12,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:12,658 INFO L87 Difference]: Start difference. First operand 381 states and 1305 transitions. Second operand 9 states. [2020-01-16 19:08:12,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:12,786 INFO L93 Difference]: Finished difference Result 552 states and 1636 transitions. [2020-01-16 19:08:12,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:12,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:12,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:12,788 INFO L225 Difference]: With dead ends: 552 [2020-01-16 19:08:12,788 INFO L226 Difference]: Without dead ends: 541 [2020-01-16 19:08:12,788 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:12,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-01-16 19:08:12,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 384. [2020-01-16 19:08:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:08:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1310 transitions. [2020-01-16 19:08:12,798 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1310 transitions. Word has length 22 [2020-01-16 19:08:12,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:12,798 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1310 transitions. [2020-01-16 19:08:12,798 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:12,798 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1310 transitions. [2020-01-16 19:08:12,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:12,799 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:12,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, 1, 1, 1] [2020-01-16 19:08:12,799 INFO L426 AbstractCegarLoop]: === Iteration 1390 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:12,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:12,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1004739620, now seen corresponding path program 1384 times [2020-01-16 19:08:12,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:12,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756741597] [2020-01-16 19:08:12,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:13,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756741597] [2020-01-16 19:08:13,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:13,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:13,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86581933] [2020-01-16 19:08:13,066 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:13,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:13,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:13,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:13,066 INFO L87 Difference]: Start difference. First operand 384 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:08:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:13,186 INFO L93 Difference]: Finished difference Result 544 states and 1627 transitions. [2020-01-16 19:08:13,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:13,187 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:13,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:13,188 INFO L225 Difference]: With dead ends: 544 [2020-01-16 19:08:13,188 INFO L226 Difference]: Without dead ends: 529 [2020-01-16 19:08:13,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-01-16 19:08:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 381. [2020-01-16 19:08:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:08:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1302 transitions. [2020-01-16 19:08:13,197 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1302 transitions. Word has length 22 [2020-01-16 19:08:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:13,197 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1302 transitions. [2020-01-16 19:08:13,197 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1302 transitions. [2020-01-16 19:08:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:13,198 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:13,198 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:13,198 INFO L426 AbstractCegarLoop]: === Iteration 1391 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:13,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:13,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1842630204, now seen corresponding path program 1385 times [2020-01-16 19:08:13,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:13,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893615762] [2020-01-16 19:08:13,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:13,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:13,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893615762] [2020-01-16 19:08:13,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:13,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:13,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216118308] [2020-01-16 19:08:13,447 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:13,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:13,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:13,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:13,447 INFO L87 Difference]: Start difference. First operand 381 states and 1302 transitions. Second operand 9 states. [2020-01-16 19:08:13,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:13,549 INFO L93 Difference]: Finished difference Result 556 states and 1642 transitions. [2020-01-16 19:08:13,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:13,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:13,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:13,550 INFO L225 Difference]: With dead ends: 556 [2020-01-16 19:08:13,551 INFO L226 Difference]: Without dead ends: 542 [2020-01-16 19:08:13,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:13,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-01-16 19:08:13,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 385. [2020-01-16 19:08:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:08:13,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1309 transitions. [2020-01-16 19:08:13,559 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1309 transitions. Word has length 22 [2020-01-16 19:08:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:13,559 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1309 transitions. [2020-01-16 19:08:13,559 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1309 transitions. [2020-01-16 19:08:13,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:13,560 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:13,560 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:13,560 INFO L426 AbstractCegarLoop]: === Iteration 1392 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:13,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:13,560 INFO L82 PathProgramCache]: Analyzing trace with hash -987323550, now seen corresponding path program 1386 times [2020-01-16 19:08:13,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:13,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404589188] [2020-01-16 19:08:13,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:13,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404589188] [2020-01-16 19:08:13,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:13,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:13,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395000997] [2020-01-16 19:08:13,809 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:13,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:13,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:13,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:13,809 INFO L87 Difference]: Start difference. First operand 385 states and 1309 transitions. Second operand 9 states. [2020-01-16 19:08:13,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:13,927 INFO L93 Difference]: Finished difference Result 545 states and 1626 transitions. [2020-01-16 19:08:13,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:13,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:13,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:13,929 INFO L225 Difference]: With dead ends: 545 [2020-01-16 19:08:13,929 INFO L226 Difference]: Without dead ends: 526 [2020-01-16 19:08:13,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-01-16 19:08:13,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 378. [2020-01-16 19:08:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:08:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1296 transitions. [2020-01-16 19:08:13,937 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1296 transitions. Word has length 22 [2020-01-16 19:08:13,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:13,938 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1296 transitions. [2020-01-16 19:08:13,938 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:13,938 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1296 transitions. [2020-01-16 19:08:13,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:13,938 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:13,938 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:13,938 INFO L426 AbstractCegarLoop]: === Iteration 1393 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:13,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:13,939 INFO L82 PathProgramCache]: Analyzing trace with hash -826240496, now seen corresponding path program 1387 times [2020-01-16 19:08:13,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:13,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057670454] [2020-01-16 19:08:13,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08: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-01-16 19:08:14,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057670454] [2020-01-16 19:08:14,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:14,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:14,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11090510] [2020-01-16 19:08:14,184 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:14,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:14,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:14,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:14,184 INFO L87 Difference]: Start difference. First operand 378 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:08:14,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:14,274 INFO L93 Difference]: Finished difference Result 545 states and 1615 transitions. [2020-01-16 19:08:14,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:14,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:14,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:14,276 INFO L225 Difference]: With dead ends: 545 [2020-01-16 19:08:14,276 INFO L226 Difference]: Without dead ends: 536 [2020-01-16 19:08:14,276 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-01-16 19:08:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 380. [2020-01-16 19:08:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1300 transitions. [2020-01-16 19:08:14,285 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1300 transitions. Word has length 22 [2020-01-16 19:08:14,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:14,285 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1300 transitions. [2020-01-16 19:08:14,286 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1300 transitions. [2020-01-16 19:08:14,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:14,286 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:14,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, 1, 1, 1] [2020-01-16 19:08:14,286 INFO L426 AbstractCegarLoop]: === Iteration 1394 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:14,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:14,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1901951652, now seen corresponding path program 1388 times [2020-01-16 19:08:14,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:14,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989886744] [2020-01-16 19:08:14,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:14,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-01-16 19:08:14,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989886744] [2020-01-16 19:08:14,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:14,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:14,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299169813] [2020-01-16 19:08:14,533 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:14,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:14,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:14,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:14,533 INFO L87 Difference]: Start difference. First operand 380 states and 1300 transitions. Second operand 9 states. [2020-01-16 19:08:14,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:14,647 INFO L93 Difference]: Finished difference Result 550 states and 1624 transitions. [2020-01-16 19:08:14,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:14,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:14,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:14,649 INFO L225 Difference]: With dead ends: 550 [2020-01-16 19:08:14,649 INFO L226 Difference]: Without dead ends: 535 [2020-01-16 19:08:14,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:14,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-01-16 19:08:14,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 379. [2020-01-16 19:08:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-01-16 19:08:14,658 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-01-16 19:08:14,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:14,659 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-01-16 19:08:14,659 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:14,659 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-01-16 19:08:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:14,659 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:14,659 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:14,659 INFO L426 AbstractCegarLoop]: === Iteration 1395 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:14,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:14,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1868288946, now seen corresponding path program 1389 times [2020-01-16 19:08:14,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:14,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984677463] [2020-01-16 19:08:14,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:14,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984677463] [2020-01-16 19:08:14,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:14,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:14,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492444470] [2020-01-16 19:08:14,912 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:14,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:14,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:14,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:14,913 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:08:15,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:15,017 INFO L93 Difference]: Finished difference Result 542 states and 1609 transitions. [2020-01-16 19:08:15,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:15,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:15,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:15,019 INFO L225 Difference]: With dead ends: 542 [2020-01-16 19:08:15,019 INFO L226 Difference]: Without dead ends: 533 [2020-01-16 19:08:15,019 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:15,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-01-16 19:08:15,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 380. [2020-01-16 19:08:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:15,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1299 transitions. [2020-01-16 19:08:15,027 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1299 transitions. Word has length 22 [2020-01-16 19:08:15,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:15,027 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1299 transitions. [2020-01-16 19:08:15,027 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:15,027 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1299 transitions. [2020-01-16 19:08:15,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:15,028 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:15,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:15,028 INFO L426 AbstractCegarLoop]: === Iteration 1396 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:15,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:15,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1891448548, now seen corresponding path program 1390 times [2020-01-16 19:08:15,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:15,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570215930] [2020-01-16 19:08:15,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:15,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-01-16 19:08:15,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570215930] [2020-01-16 19:08:15,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:15,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:15,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459421869] [2020-01-16 19:08:15,281 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:15,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:15,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:15,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:15,281 INFO L87 Difference]: Start difference. First operand 380 states and 1299 transitions. Second operand 9 states. [2020-01-16 19:08:15,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:15,395 INFO L93 Difference]: Finished difference Result 536 states and 1606 transitions. [2020-01-16 19:08:15,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:15,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:15,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:15,396 INFO L225 Difference]: With dead ends: 536 [2020-01-16 19:08:15,397 INFO L226 Difference]: Without dead ends: 523 [2020-01-16 19:08:15,397 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:15,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-01-16 19:08:15,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 379. [2020-01-16 19:08:15,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1297 transitions. [2020-01-16 19:08:15,405 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1297 transitions. Word has length 22 [2020-01-16 19:08:15,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:15,406 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1297 transitions. [2020-01-16 19:08:15,406 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:15,406 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1297 transitions. [2020-01-16 19:08:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:15,406 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:15,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, 1, 1, 1] [2020-01-16 19:08:15,406 INFO L426 AbstractCegarLoop]: === Iteration 1397 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:15,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1805270322, now seen corresponding path program 1391 times [2020-01-16 19:08:15,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:15,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591822087] [2020-01-16 19:08:15,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:15,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591822087] [2020-01-16 19:08:15,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:15,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:15,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557928763] [2020-01-16 19:08:15,652 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:15,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:15,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:15,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:15,652 INFO L87 Difference]: Start difference. First operand 379 states and 1297 transitions. Second operand 9 states. [2020-01-16 19:08:15,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:15,761 INFO L93 Difference]: Finished difference Result 550 states and 1627 transitions. [2020-01-16 19:08:15,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:15,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:15,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:15,763 INFO L225 Difference]: With dead ends: 550 [2020-01-16 19:08:15,763 INFO L226 Difference]: Without dead ends: 536 [2020-01-16 19:08:15,763 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:15,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-01-16 19:08:15,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 383. [2020-01-16 19:08:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:08:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1304 transitions. [2020-01-16 19:08:15,772 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1304 transitions. Word has length 22 [2020-01-16 19:08:15,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:15,772 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1304 transitions. [2020-01-16 19:08:15,772 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:15,773 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1304 transitions. [2020-01-16 19:08:15,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:15,773 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:15,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, 1, 1, 1] [2020-01-16 19:08:15,773 INFO L426 AbstractCegarLoop]: === Iteration 1398 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:15,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:15,773 INFO L82 PathProgramCache]: Analyzing trace with hash -878756016, now seen corresponding path program 1392 times [2020-01-16 19:08:15,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:15,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930837310] [2020-01-16 19:08:15,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:16,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-01-16 19:08:16,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930837310] [2020-01-16 19:08:16,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:16,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:16,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984600124] [2020-01-16 19:08:16,022 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:16,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:16,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:16,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:16,022 INFO L87 Difference]: Start difference. First operand 383 states and 1304 transitions. Second operand 9 states. [2020-01-16 19:08:16,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:16,145 INFO L93 Difference]: Finished difference Result 539 states and 1611 transitions. [2020-01-16 19:08:16,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:16,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:16,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:16,147 INFO L225 Difference]: With dead ends: 539 [2020-01-16 19:08:16,147 INFO L226 Difference]: Without dead ends: 521 [2020-01-16 19:08:16,147 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-01-16 19:08:16,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 377. [2020-01-16 19:08:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:08:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1294 transitions. [2020-01-16 19:08:16,155 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1294 transitions. Word has length 22 [2020-01-16 19:08:16,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:16,155 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1294 transitions. [2020-01-16 19:08:16,156 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:16,156 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1294 transitions. [2020-01-16 19:08:16,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:16,156 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:16,156 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:16,156 INFO L426 AbstractCegarLoop]: === Iteration 1399 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:16,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:16,156 INFO L82 PathProgramCache]: Analyzing trace with hash 224334054, now seen corresponding path program 1393 times [2020-01-16 19:08:16,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:16,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517974952] [2020-01-16 19:08:16,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:16,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-01-16 19:08:16,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517974952] [2020-01-16 19:08:16,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:16,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:16,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786701722] [2020-01-16 19:08:16,411 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:16,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:16,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:16,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:16,411 INFO L87 Difference]: Start difference. First operand 377 states and 1294 transitions. Second operand 9 states. [2020-01-16 19:08:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:16,527 INFO L93 Difference]: Finished difference Result 556 states and 1653 transitions. [2020-01-16 19:08:16,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:16,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:16,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:16,528 INFO L225 Difference]: With dead ends: 556 [2020-01-16 19:08:16,528 INFO L226 Difference]: Without dead ends: 545 [2020-01-16 19:08:16,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:16,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-01-16 19:08:16,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 383. [2020-01-16 19:08:16,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:08:16,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1313 transitions. [2020-01-16 19:08:16,537 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1313 transitions. Word has length 22 [2020-01-16 19:08:16,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:16,537 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1313 transitions. [2020-01-16 19:08:16,537 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:16,537 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1313 transitions. [2020-01-16 19:08:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:16,538 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:16,538 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:16,538 INFO L426 AbstractCegarLoop]: === Iteration 1400 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:16,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:16,538 INFO L82 PathProgramCache]: Analyzing trace with hash 477426806, now seen corresponding path program 1394 times [2020-01-16 19:08:16,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:16,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719168483] [2020-01-16 19:08:16,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:16,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-01-16 19:08:16,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719168483] [2020-01-16 19:08:16,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:16,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:16,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553602049] [2020-01-16 19:08:16,795 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:16,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:16,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:16,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:16,796 INFO L87 Difference]: Start difference. First operand 383 states and 1313 transitions. Second operand 9 states. [2020-01-16 19:08:16,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:16,906 INFO L93 Difference]: Finished difference Result 555 states and 1649 transitions. [2020-01-16 19:08:16,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:16,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:16,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:16,908 INFO L225 Difference]: With dead ends: 555 [2020-01-16 19:08:16,908 INFO L226 Difference]: Without dead ends: 543 [2020-01-16 19:08:16,908 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:16,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-01-16 19:08:16,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 381. [2020-01-16 19:08:16,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:08:16,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1308 transitions. [2020-01-16 19:08:16,917 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1308 transitions. Word has length 22 [2020-01-16 19:08:16,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:16,917 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1308 transitions. [2020-01-16 19:08:16,917 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:16,917 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1308 transitions. [2020-01-16 19:08:16,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:16,918 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:16,918 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:16,918 INFO L426 AbstractCegarLoop]: === Iteration 1401 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:16,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:16,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1457502856, now seen corresponding path program 1395 times [2020-01-16 19:08:16,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:16,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637372839] [2020-01-16 19:08:16,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:17,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-01-16 19:08:17,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637372839] [2020-01-16 19:08:17,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:17,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:17,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31971847] [2020-01-16 19:08:17,178 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:17,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:17,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:17,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:17,179 INFO L87 Difference]: Start difference. First operand 381 states and 1308 transitions. Second operand 9 states. [2020-01-16 19:08:17,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:17,285 INFO L93 Difference]: Finished difference Result 561 states and 1662 transitions. [2020-01-16 19:08:17,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:17,286 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:17,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:17,287 INFO L225 Difference]: With dead ends: 561 [2020-01-16 19:08:17,287 INFO L226 Difference]: Without dead ends: 550 [2020-01-16 19:08:17,287 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-01-16 19:08:17,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 384. [2020-01-16 19:08:17,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:08:17,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1313 transitions. [2020-01-16 19:08:17,296 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1313 transitions. Word has length 22 [2020-01-16 19:08:17,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:17,296 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1313 transitions. [2020-01-16 19:08:17,297 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:17,297 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1313 transitions. [2020-01-16 19:08:17,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:17,297 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:17,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, 1, 1, 1] [2020-01-16 19:08:17,297 INFO L426 AbstractCegarLoop]: === Iteration 1402 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:17,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:17,297 INFO L82 PathProgramCache]: Analyzing trace with hash -71467726, now seen corresponding path program 1396 times [2020-01-16 19:08:17,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:17,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694977091] [2020-01-16 19:08:17,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:17,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694977091] [2020-01-16 19:08:17,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:17,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:17,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035646636] [2020-01-16 19:08:17,551 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:17,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:17,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:17,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:17,552 INFO L87 Difference]: Start difference. First operand 384 states and 1313 transitions. Second operand 9 states. [2020-01-16 19:08:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:17,663 INFO L93 Difference]: Finished difference Result 564 states and 1665 transitions. [2020-01-16 19:08:17,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:17,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:17,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:17,665 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:08:17,665 INFO L226 Difference]: Without dead ends: 547 [2020-01-16 19:08:17,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:17,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-01-16 19:08:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 381. [2020-01-16 19:08:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:08:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1306 transitions. [2020-01-16 19:08:17,675 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1306 transitions. Word has length 22 [2020-01-16 19:08:17,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:17,675 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1306 transitions. [2020-01-16 19:08:17,675 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1306 transitions. [2020-01-16 19:08:17,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:17,675 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:17,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, 1, 1, 1] [2020-01-16 19:08:17,676 INFO L426 AbstractCegarLoop]: === Iteration 1403 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:17,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:17,676 INFO L82 PathProgramCache]: Analyzing trace with hash -63483050, now seen corresponding path program 1397 times [2020-01-16 19:08:17,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:17,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666210071] [2020-01-16 19:08:17,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:17,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-01-16 19:08:17,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666210071] [2020-01-16 19:08:17,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:17,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:17,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925158797] [2020-01-16 19:08:17,941 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:17,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:17,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:17,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:17,941 INFO L87 Difference]: Start difference. First operand 381 states and 1306 transitions. Second operand 9 states. [2020-01-16 19:08:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:18,044 INFO L93 Difference]: Finished difference Result 558 states and 1653 transitions. [2020-01-16 19:08:18,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:18,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:18,046 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:08:18,046 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:08:18,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:08:18,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 383. [2020-01-16 19:08:18,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:08:18,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1309 transitions. [2020-01-16 19:08:18,055 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1309 transitions. Word has length 22 [2020-01-16 19:08:18,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:18,056 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1309 transitions. [2020-01-16 19:08:18,056 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1309 transitions. [2020-01-16 19:08:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:18,056 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:18,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, 1, 1, 1] [2020-01-16 19:08:18,056 INFO L426 AbstractCegarLoop]: === Iteration 1404 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:18,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:18,057 INFO L82 PathProgramCache]: Analyzing trace with hash -981433240, now seen corresponding path program 1398 times [2020-01-16 19:08:18,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:18,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917164042] [2020-01-16 19:08:18,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:18,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-01-16 19:08:18,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917164042] [2020-01-16 19:08:18,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:18,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:18,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431862387] [2020-01-16 19:08:18,308 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:18,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:18,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:18,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:18,308 INFO L87 Difference]: Start difference. First operand 383 states and 1309 transitions. Second operand 9 states. [2020-01-16 19:08:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:18,417 INFO L93 Difference]: Finished difference Result 562 states and 1659 transitions. [2020-01-16 19:08:18,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:18,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:18,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:18,418 INFO L225 Difference]: With dead ends: 562 [2020-01-16 19:08:18,419 INFO L226 Difference]: Without dead ends: 544 [2020-01-16 19:08:18,419 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-01-16 19:08:18,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 379. [2020-01-16 19:08:18,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:18,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1301 transitions. [2020-01-16 19:08:18,427 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1301 transitions. Word has length 22 [2020-01-16 19:08:18,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:18,427 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1301 transitions. [2020-01-16 19:08:18,427 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:18,427 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1301 transitions. [2020-01-16 19:08:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:18,428 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:18,428 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:18,428 INFO L426 AbstractCegarLoop]: === Iteration 1405 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:18,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:18,428 INFO L82 PathProgramCache]: Analyzing trace with hash -2144599164, now seen corresponding path program 1399 times [2020-01-16 19:08:18,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:18,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106351115] [2020-01-16 19:08:18,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:18,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106351115] [2020-01-16 19:08:18,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:18,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:18,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010108874] [2020-01-16 19:08:18,691 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:18,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:18,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:18,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:18,691 INFO L87 Difference]: Start difference. First operand 379 states and 1301 transitions. Second operand 9 states. [2020-01-16 19:08:18,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:18,810 INFO L93 Difference]: Finished difference Result 552 states and 1642 transitions. [2020-01-16 19:08:18,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:18,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:18,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:18,812 INFO L225 Difference]: With dead ends: 552 [2020-01-16 19:08:18,812 INFO L226 Difference]: Without dead ends: 541 [2020-01-16 19:08:18,812 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:18,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-01-16 19:08:18,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 383. [2020-01-16 19:08:18,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:08:18,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1311 transitions. [2020-01-16 19:08:18,821 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1311 transitions. Word has length 22 [2020-01-16 19:08:18,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:18,822 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1311 transitions. [2020-01-16 19:08:18,822 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:18,822 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1311 transitions. [2020-01-16 19:08:18,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:18,822 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:18,822 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:18,822 INFO L426 AbstractCegarLoop]: === Iteration 1406 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:18,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:18,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1891506412, now seen corresponding path program 1400 times [2020-01-16 19:08:18,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:18,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926986448] [2020-01-16 19:08:18,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:19,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-01-16 19:08:19,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926986448] [2020-01-16 19:08:19,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:19,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:19,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655325196] [2020-01-16 19:08:19,086 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:19,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:19,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:19,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:19,086 INFO L87 Difference]: Start difference. First operand 383 states and 1311 transitions. Second operand 9 states. [2020-01-16 19:08:19,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:19,199 INFO L93 Difference]: Finished difference Result 551 states and 1638 transitions. [2020-01-16 19:08:19,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:19,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:19,201 INFO L225 Difference]: With dead ends: 551 [2020-01-16 19:08:19,201 INFO L226 Difference]: Without dead ends: 539 [2020-01-16 19:08:19,201 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:19,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-01-16 19:08:19,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 381. [2020-01-16 19:08:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:08:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1306 transitions. [2020-01-16 19:08:19,210 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1306 transitions. Word has length 22 [2020-01-16 19:08:19,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:19,210 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1306 transitions. [2020-01-16 19:08:19,210 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:19,210 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1306 transitions. [2020-01-16 19:08:19,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:19,210 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:19,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, 1, 1, 1] [2020-01-16 19:08:19,211 INFO L426 AbstractCegarLoop]: === Iteration 1407 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:19,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:19,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1131906632, now seen corresponding path program 1401 times [2020-01-16 19:08:19,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:19,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935705579] [2020-01-16 19:08:19,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:19,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:19,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935705579] [2020-01-16 19:08:19,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:19,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:19,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824792521] [2020-01-16 19:08:19,481 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:19,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:19,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:19,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:19,482 INFO L87 Difference]: Start difference. First operand 381 states and 1306 transitions. Second operand 9 states. [2020-01-16 19:08:19,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:19,591 INFO L93 Difference]: Finished difference Result 552 states and 1642 transitions. [2020-01-16 19:08:19,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:19,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:19,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:19,593 INFO L225 Difference]: With dead ends: 552 [2020-01-16 19:08:19,593 INFO L226 Difference]: Without dead ends: 541 [2020-01-16 19:08:19,593 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:19,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-01-16 19:08:19,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 384. [2020-01-16 19:08:19,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:08:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1311 transitions. [2020-01-16 19:08:19,602 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1311 transitions. Word has length 22 [2020-01-16 19:08:19,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:19,602 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1311 transitions. [2020-01-16 19:08:19,602 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1311 transitions. [2020-01-16 19:08:19,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:19,603 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:19,603 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:19,603 INFO L426 AbstractCegarLoop]: === Iteration 1408 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:19,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:19,603 INFO L82 PathProgramCache]: Analyzing trace with hash -829888688, now seen corresponding path program 1402 times [2020-01-16 19:08:19,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:19,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281404250] [2020-01-16 19:08:19,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:19,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281404250] [2020-01-16 19:08:19,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:19,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:19,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122069656] [2020-01-16 19:08:19,866 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:19,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:19,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:19,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:19,866 INFO L87 Difference]: Start difference. First operand 384 states and 1311 transitions. Second operand 9 states. [2020-01-16 19:08:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:19,988 INFO L93 Difference]: Finished difference Result 544 states and 1633 transitions. [2020-01-16 19:08:19,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:19,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:19,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:19,990 INFO L225 Difference]: With dead ends: 544 [2020-01-16 19:08:19,990 INFO L226 Difference]: Without dead ends: 529 [2020-01-16 19:08:19,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-01-16 19:08:19,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 381. [2020-01-16 19:08:19,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:08:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1304 transitions. [2020-01-16 19:08:19,998 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1304 transitions. Word has length 22 [2020-01-16 19:08:19,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:19,998 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1304 transitions. [2020-01-16 19:08:19,998 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:19,998 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1304 transitions. [2020-01-16 19:08:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:19,998 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:19,998 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:19,999 INFO L426 AbstractCegarLoop]: === Iteration 1409 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:19,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:19,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1873054132, now seen corresponding path program 1403 times [2020-01-16 19:08:19,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:19,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493242279] [2020-01-16 19:08:19,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:20,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493242279] [2020-01-16 19:08:20,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:20,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:20,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471217230] [2020-01-16 19:08:20,255 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:20,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:20,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:20,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:20,255 INFO L87 Difference]: Start difference. First operand 381 states and 1304 transitions. Second operand 9 states. [2020-01-16 19:08:20,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:20,364 INFO L93 Difference]: Finished difference Result 550 states and 1635 transitions. [2020-01-16 19:08:20,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:20,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:20,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:20,365 INFO L225 Difference]: With dead ends: 550 [2020-01-16 19:08:20,366 INFO L226 Difference]: Without dead ends: 540 [2020-01-16 19:08:20,366 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:20,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-01-16 19:08:20,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 383. [2020-01-16 19:08:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:08:20,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1307 transitions. [2020-01-16 19:08:20,374 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1307 transitions. Word has length 22 [2020-01-16 19:08:20,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:20,374 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1307 transitions. [2020-01-16 19:08:20,374 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1307 transitions. [2020-01-16 19:08:20,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:20,375 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:20,375 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:20,375 INFO L426 AbstractCegarLoop]: === Iteration 1410 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:20,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:20,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1699806440, now seen corresponding path program 1404 times [2020-01-16 19:08:20,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:20,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014097767] [2020-01-16 19:08:20,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:20,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-01-16 19:08:20,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014097767] [2020-01-16 19:08:20,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:20,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:20,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750303255] [2020-01-16 19:08:20,632 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:20,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:20,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:20,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:20,632 INFO L87 Difference]: Start difference. First operand 383 states and 1307 transitions. Second operand 9 states. [2020-01-16 19:08:20,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:20,752 INFO L93 Difference]: Finished difference Result 543 states and 1629 transitions. [2020-01-16 19:08:20,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:20,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:20,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:20,753 INFO L225 Difference]: With dead ends: 543 [2020-01-16 19:08:20,754 INFO L226 Difference]: Without dead ends: 527 [2020-01-16 19:08:20,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:20,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2020-01-16 19:08:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 379. [2020-01-16 19:08:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1299 transitions. [2020-01-16 19:08:20,762 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1299 transitions. Word has length 22 [2020-01-16 19:08:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:20,762 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1299 transitions. [2020-01-16 19:08:20,762 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1299 transitions. [2020-01-16 19:08:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:20,763 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:20,763 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:20,763 INFO L426 AbstractCegarLoop]: === Iteration 1411 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:20,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:20,763 INFO L82 PathProgramCache]: Analyzing trace with hash -128805436, now seen corresponding path program 1405 times [2020-01-16 19:08:20,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:20,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490443910] [2020-01-16 19:08:20,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:21,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490443910] [2020-01-16 19:08:21,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:21,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:21,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040022105] [2020-01-16 19:08:21,017 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:21,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:21,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:21,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:21,017 INFO L87 Difference]: Start difference. First operand 379 states and 1299 transitions. Second operand 9 states. [2020-01-16 19:08:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:21,137 INFO L93 Difference]: Finished difference Result 564 states and 1669 transitions. [2020-01-16 19:08:21,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:21,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:21,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:21,144 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:08:21,144 INFO L226 Difference]: Without dead ends: 553 [2020-01-16 19:08:21,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-01-16 19:08:21,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 385. [2020-01-16 19:08:21,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:08:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1315 transitions. [2020-01-16 19:08:21,153 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1315 transitions. Word has length 22 [2020-01-16 19:08:21,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:21,153 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1315 transitions. [2020-01-16 19:08:21,153 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:21,153 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1315 transitions. [2020-01-16 19:08:21,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:21,154 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:21,154 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:21,154 INFO L426 AbstractCegarLoop]: === Iteration 1412 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:21,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:21,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1257229694, now seen corresponding path program 1406 times [2020-01-16 19:08:21,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:21,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770551417] [2020-01-16 19:08:21,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:21,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770551417] [2020-01-16 19:08:21,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:21,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:21,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500915127] [2020-01-16 19:08:21,405 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:21,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:21,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:21,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:21,406 INFO L87 Difference]: Start difference. First operand 385 states and 1315 transitions. Second operand 9 states. [2020-01-16 19:08:21,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:21,516 INFO L93 Difference]: Finished difference Result 567 states and 1672 transitions. [2020-01-16 19:08:21,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:21,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:21,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:21,517 INFO L225 Difference]: With dead ends: 567 [2020-01-16 19:08:21,517 INFO L226 Difference]: Without dead ends: 550 [2020-01-16 19:08:21,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:21,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-01-16 19:08:21,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 382. [2020-01-16 19:08:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:08:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1307 transitions. [2020-01-16 19:08:21,526 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1307 transitions. Word has length 22 [2020-01-16 19:08:21,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:21,526 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1307 transitions. [2020-01-16 19:08:21,526 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:21,526 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1307 transitions. [2020-01-16 19:08:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:21,527 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:21,527 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:21,527 INFO L426 AbstractCegarLoop]: === Iteration 1413 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:21,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:21,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1729243290, now seen corresponding path program 1407 times [2020-01-16 19:08:21,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:21,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182912009] [2020-01-16 19:08:21,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:21,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-01-16 19:08:21,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182912009] [2020-01-16 19:08:21,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:21,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:21,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24757158] [2020-01-16 19:08:21,783 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:21,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:21,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:21,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:21,783 INFO L87 Difference]: Start difference. First operand 382 states and 1307 transitions. Second operand 9 states. [2020-01-16 19:08:21,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:21,893 INFO L93 Difference]: Finished difference Result 559 states and 1657 transitions. [2020-01-16 19:08:21,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:21,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:21,895 INFO L225 Difference]: With dead ends: 559 [2020-01-16 19:08:21,895 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:08:21,895 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:08:21,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 385. [2020-01-16 19:08:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:08:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1312 transitions. [2020-01-16 19:08:21,904 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1312 transitions. Word has length 22 [2020-01-16 19:08:21,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:21,904 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1312 transitions. [2020-01-16 19:08:21,904 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:21,904 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1312 transitions. [2020-01-16 19:08:21,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:21,904 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:21,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, 1, 1, 1] [2020-01-16 19:08:21,905 INFO L426 AbstractCegarLoop]: === Iteration 1414 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:21,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:21,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1427225346, now seen corresponding path program 1408 times [2020-01-16 19:08:21,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:21,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234530164] [2020-01-16 19:08:21,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:22,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-01-16 19:08:22,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234530164] [2020-01-16 19:08:22,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:22,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:22,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698924576] [2020-01-16 19:08:22,164 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:22,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:22,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:22,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:22,164 INFO L87 Difference]: Start difference. First operand 385 states and 1312 transitions. Second operand 9 states. [2020-01-16 19:08:22,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:22,276 INFO L93 Difference]: Finished difference Result 551 states and 1648 transitions. [2020-01-16 19:08:22,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:22,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:22,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:22,277 INFO L225 Difference]: With dead ends: 551 [2020-01-16 19:08:22,277 INFO L226 Difference]: Without dead ends: 536 [2020-01-16 19:08:22,277 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-01-16 19:08:22,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 382. [2020-01-16 19:08:22,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:08:22,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1304 transitions. [2020-01-16 19:08:22,286 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1304 transitions. Word has length 22 [2020-01-16 19:08:22,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:22,286 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1304 transitions. [2020-01-16 19:08:22,287 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:22,287 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1304 transitions. [2020-01-16 19:08:22,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:22,287 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:22,287 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:22,287 INFO L426 AbstractCegarLoop]: === Iteration 1415 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:22,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:22,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2029851366, now seen corresponding path program 1409 times [2020-01-16 19:08:22,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:22,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238956747] [2020-01-16 19:08:22,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:22,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-01-16 19:08:22,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238956747] [2020-01-16 19:08:22,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:22,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:22,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903845129] [2020-01-16 19:08:22,538 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:22,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:22,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:22,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:22,539 INFO L87 Difference]: Start difference. First operand 382 states and 1304 transitions. Second operand 9 states. [2020-01-16 19:08:22,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:22,647 INFO L93 Difference]: Finished difference Result 563 states and 1663 transitions. [2020-01-16 19:08:22,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:22,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:22,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:22,649 INFO L225 Difference]: With dead ends: 563 [2020-01-16 19:08:22,649 INFO L226 Difference]: Without dead ends: 549 [2020-01-16 19:08:22,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-01-16 19:08:22,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 386. [2020-01-16 19:08:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-01-16 19:08:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1311 transitions. [2020-01-16 19:08:22,658 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1311 transitions. Word has length 22 [2020-01-16 19:08:22,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:22,658 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 1311 transitions. [2020-01-16 19:08:22,658 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1311 transitions. [2020-01-16 19:08:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:22,659 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:22,659 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:22,659 INFO L426 AbstractCegarLoop]: === Iteration 1416 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:22,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:22,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1409809276, now seen corresponding path program 1410 times [2020-01-16 19:08:22,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:22,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261366343] [2020-01-16 19:08:22,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:22,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-01-16 19:08:22,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261366343] [2020-01-16 19:08:22,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:22,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:22,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825392722] [2020-01-16 19:08:22,917 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:22,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:22,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:22,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:22,917 INFO L87 Difference]: Start difference. First operand 386 states and 1311 transitions. Second operand 9 states. [2020-01-16 19:08:23,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:23,030 INFO L93 Difference]: Finished difference Result 552 states and 1647 transitions. [2020-01-16 19:08:23,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:23,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:23,032 INFO L225 Difference]: With dead ends: 552 [2020-01-16 19:08:23,032 INFO L226 Difference]: Without dead ends: 533 [2020-01-16 19:08:23,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:23,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-01-16 19:08:23,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 379. [2020-01-16 19:08:23,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1297 transitions. [2020-01-16 19:08:23,041 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1297 transitions. Word has length 22 [2020-01-16 19:08:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:23,041 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1297 transitions. [2020-01-16 19:08:23,041 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1297 transitions. [2020-01-16 19:08:23,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:23,041 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:23,042 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:23,042 INFO L426 AbstractCegarLoop]: === Iteration 1417 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:23,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:23,042 INFO L82 PathProgramCache]: Analyzing trace with hash 673776822, now seen corresponding path program 1411 times [2020-01-16 19:08:23,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:23,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174046388] [2020-01-16 19:08:23,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:23,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174046388] [2020-01-16 19:08:23,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:23,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:23,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666089595] [2020-01-16 19:08:23,274 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:23,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:23,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:23,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:23,275 INFO L87 Difference]: Start difference. First operand 379 states and 1297 transitions. Second operand 9 states. [2020-01-16 19:08:23,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:23,377 INFO L93 Difference]: Finished difference Result 558 states and 1651 transitions. [2020-01-16 19:08:23,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:23,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:23,379 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:08:23,379 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:08:23,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:08:23,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 383. [2020-01-16 19:08:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:08:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1307 transitions. [2020-01-16 19:08:23,388 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1307 transitions. Word has length 22 [2020-01-16 19:08:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:23,388 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1307 transitions. [2020-01-16 19:08:23,388 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:23,388 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1307 transitions. [2020-01-16 19:08:23,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:23,389 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:23,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, 1, 1, 1] [2020-01-16 19:08:23,389 INFO L426 AbstractCegarLoop]: === Iteration 1418 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:23,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:23,389 INFO L82 PathProgramCache]: Analyzing trace with hash -244173368, now seen corresponding path program 1412 times [2020-01-16 19:08:23,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:23,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526168745] [2020-01-16 19:08:23,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:23,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-01-16 19:08:23,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526168745] [2020-01-16 19:08:23,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:23,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:23,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933402562] [2020-01-16 19:08:23,621 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:23,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:23,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:23,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:23,621 INFO L87 Difference]: Start difference. First operand 383 states and 1307 transitions. Second operand 9 states. [2020-01-16 19:08:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:23,730 INFO L93 Difference]: Finished difference Result 562 states and 1657 transitions. [2020-01-16 19:08:23,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:23,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:23,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:23,732 INFO L225 Difference]: With dead ends: 562 [2020-01-16 19:08:23,732 INFO L226 Difference]: Without dead ends: 546 [2020-01-16 19:08:23,732 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-01-16 19:08:23,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 381. [2020-01-16 19:08:23,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:08:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1302 transitions. [2020-01-16 19:08:23,741 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1302 transitions. Word has length 22 [2020-01-16 19:08:23,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:23,741 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1302 transitions. [2020-01-16 19:08:23,741 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:23,741 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1302 transitions. [2020-01-16 19:08:23,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:23,742 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:23,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, 1, 1, 1] [2020-01-16 19:08:23,742 INFO L426 AbstractCegarLoop]: === Iteration 1419 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:23,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:23,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2010249516, now seen corresponding path program 1413 times [2020-01-16 19:08:23,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:23,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221924525] [2020-01-16 19:08:23,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:23,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221924525] [2020-01-16 19:08:23,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:23,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:23,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67763839] [2020-01-16 19:08:23,974 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:23,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:23,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:23,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:23,974 INFO L87 Difference]: Start difference. First operand 381 states and 1302 transitions. Second operand 9 states. [2020-01-16 19:08:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:24,078 INFO L93 Difference]: Finished difference Result 554 states and 1642 transitions. [2020-01-16 19:08:24,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:24,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:24,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:24,080 INFO L225 Difference]: With dead ends: 554 [2020-01-16 19:08:24,080 INFO L226 Difference]: Without dead ends: 544 [2020-01-16 19:08:24,080 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:24,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-01-16 19:08:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 383. [2020-01-16 19:08:24,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:08:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1305 transitions. [2020-01-16 19:08:24,088 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1305 transitions. Word has length 22 [2020-01-16 19:08:24,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:24,088 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1305 transitions. [2020-01-16 19:08:24,088 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:24,088 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1305 transitions. [2020-01-16 19:08:24,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:24,089 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:24,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, 1, 1, 1] [2020-01-16 19:08:24,089 INFO L426 AbstractCegarLoop]: === Iteration 1420 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:24,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:24,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2111470088, now seen corresponding path program 1414 times [2020-01-16 19:08:24,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:24,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019346640] [2020-01-16 19:08:24,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:24,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-01-16 19:08:24,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019346640] [2020-01-16 19:08:24,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:24,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:24,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044416044] [2020-01-16 19:08:24,322 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:24,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:24,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:24,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:24,323 INFO L87 Difference]: Start difference. First operand 383 states and 1305 transitions. Second operand 9 states. [2020-01-16 19:08:24,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:24,428 INFO L93 Difference]: Finished difference Result 547 states and 1636 transitions. [2020-01-16 19:08:24,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:24,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:24,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:24,430 INFO L225 Difference]: With dead ends: 547 [2020-01-16 19:08:24,430 INFO L226 Difference]: Without dead ends: 533 [2020-01-16 19:08:24,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:24,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-01-16 19:08:24,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 381. [2020-01-16 19:08:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:08:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1300 transitions. [2020-01-16 19:08:24,439 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1300 transitions. Word has length 22 [2020-01-16 19:08:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:24,439 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1300 transitions. [2020-01-16 19:08:24,439 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:24,439 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1300 transitions. [2020-01-16 19:08:24,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:24,440 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:24,440 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:24,440 INFO L426 AbstractCegarLoop]: === Iteration 1421 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:24,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:24,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1319884524, now seen corresponding path program 1415 times [2020-01-16 19:08:24,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:24,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219875657] [2020-01-16 19:08:24,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:24,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-01-16 19:08:24,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219875657] [2020-01-16 19:08:24,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:24,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:24,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580989845] [2020-01-16 19:08:24,680 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:24,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:24,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:24,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:24,681 INFO L87 Difference]: Start difference. First operand 381 states and 1300 transitions. Second operand 9 states. [2020-01-16 19:08:24,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:24,792 INFO L93 Difference]: Finished difference Result 560 states and 1654 transitions. [2020-01-16 19:08:24,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:24,792 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:24,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:24,794 INFO L225 Difference]: With dead ends: 560 [2020-01-16 19:08:24,794 INFO L226 Difference]: Without dead ends: 546 [2020-01-16 19:08:24,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-01-16 19:08:24,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 385. [2020-01-16 19:08:24,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:08:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1307 transitions. [2020-01-16 19:08:24,803 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1307 transitions. Word has length 22 [2020-01-16 19:08:24,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:24,803 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1307 transitions. [2020-01-16 19:08:24,803 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:24,803 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1307 transitions. [2020-01-16 19:08:24,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:24,804 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:24,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, 1, 1, 1] [2020-01-16 19:08:24,804 INFO L426 AbstractCegarLoop]: === Iteration 1422 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:24,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:24,804 INFO L82 PathProgramCache]: Analyzing trace with hash -575182026, now seen corresponding path program 1416 times [2020-01-16 19:08:24,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:24,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898376122] [2020-01-16 19:08:24,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:25,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-01-16 19:08:25,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898376122] [2020-01-16 19:08:25,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:25,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:25,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132884104] [2020-01-16 19:08:25,039 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:25,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:25,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:25,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:25,039 INFO L87 Difference]: Start difference. First operand 385 states and 1307 transitions. Second operand 9 states. [2020-01-16 19:08:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:25,162 INFO L93 Difference]: Finished difference Result 549 states and 1638 transitions. [2020-01-16 19:08:25,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:25,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:25,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:25,164 INFO L225 Difference]: With dead ends: 549 [2020-01-16 19:08:25,164 INFO L226 Difference]: Without dead ends: 529 [2020-01-16 19:08:25,164 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:25,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-01-16 19:08:25,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 377. [2020-01-16 19:08:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:08:25,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1293 transitions. [2020-01-16 19:08:25,173 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1293 transitions. Word has length 22 [2020-01-16 19:08:25,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:25,173 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1293 transitions. [2020-01-16 19:08:25,173 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1293 transitions. [2020-01-16 19:08:25,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:25,174 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:25,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, 1, 1, 1] [2020-01-16 19:08:25,174 INFO L426 AbstractCegarLoop]: === Iteration 1423 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:25,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:25,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1318072458, now seen corresponding path program 1417 times [2020-01-16 19:08:25,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:25,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898275614] [2020-01-16 19:08:25,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:25,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898275614] [2020-01-16 19:08:25,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:25,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:25,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3639930] [2020-01-16 19:08:25,440 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:25,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:25,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:25,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:25,441 INFO L87 Difference]: Start difference. First operand 377 states and 1293 transitions. Second operand 9 states. [2020-01-16 19:08:25,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:25,537 INFO L93 Difference]: Finished difference Result 534 states and 1588 transitions. [2020-01-16 19:08:25,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:25,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:25,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:25,538 INFO L225 Difference]: With dead ends: 534 [2020-01-16 19:08:25,538 INFO L226 Difference]: Without dead ends: 525 [2020-01-16 19:08:25,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:25,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2020-01-16 19:08:25,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 380. [2020-01-16 19:08:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:25,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1301 transitions. [2020-01-16 19:08:25,548 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1301 transitions. Word has length 22 [2020-01-16 19:08:25,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:25,548 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1301 transitions. [2020-01-16 19:08:25,548 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1301 transitions. [2020-01-16 19:08:25,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:25,548 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:25,548 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:25,549 INFO L426 AbstractCegarLoop]: === Iteration 1424 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:25,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:25,549 INFO L82 PathProgramCache]: Analyzing trace with hash 292868500, now seen corresponding path program 1418 times [2020-01-16 19:08:25,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:25,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852245039] [2020-01-16 19:08:25,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:25,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:25,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852245039] [2020-01-16 19:08:25,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:25,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:25,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229036019] [2020-01-16 19:08:25,810 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:25,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:25,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:25,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:25,811 INFO L87 Difference]: Start difference. First operand 380 states and 1301 transitions. Second operand 9 states. [2020-01-16 19:08:25,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:25,911 INFO L93 Difference]: Finished difference Result 535 states and 1589 transitions. [2020-01-16 19:08:25,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:25,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:25,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:25,912 INFO L225 Difference]: With dead ends: 535 [2020-01-16 19:08:25,912 INFO L226 Difference]: Without dead ends: 524 [2020-01-16 19:08:25,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:25,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-01-16 19:08:25,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 379. [2020-01-16 19:08:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1299 transitions. [2020-01-16 19:08:25,921 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1299 transitions. Word has length 22 [2020-01-16 19:08:25,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:25,921 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1299 transitions. [2020-01-16 19:08:25,921 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1299 transitions. [2020-01-16 19:08:25,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:25,922 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:25,922 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:25,922 INFO L426 AbstractCegarLoop]: === Iteration 1425 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:25,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:25,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1295057928, now seen corresponding path program 1419 times [2020-01-16 19:08:25,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:25,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148249180] [2020-01-16 19:08:25,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:26,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-01-16 19:08:26,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148249180] [2020-01-16 19:08:26,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:26,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:26,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674736357] [2020-01-16 19:08:26,176 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:26,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:26,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:26,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:26,177 INFO L87 Difference]: Start difference. First operand 379 states and 1299 transitions. Second operand 9 states. [2020-01-16 19:08:26,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:26,258 INFO L93 Difference]: Finished difference Result 538 states and 1595 transitions. [2020-01-16 19:08:26,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:26,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:26,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:26,260 INFO L225 Difference]: With dead ends: 538 [2020-01-16 19:08:26,260 INFO L226 Difference]: Without dead ends: 529 [2020-01-16 19:08:26,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:26,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-01-16 19:08:26,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 380. [2020-01-16 19:08:26,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1300 transitions. [2020-01-16 19:08:26,268 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1300 transitions. Word has length 22 [2020-01-16 19:08:26,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:26,268 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1300 transitions. [2020-01-16 19:08:26,268 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:26,268 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1300 transitions. [2020-01-16 19:08:26,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:26,269 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:26,269 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:26,269 INFO L426 AbstractCegarLoop]: === Iteration 1426 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:26,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:26,269 INFO L82 PathProgramCache]: Analyzing trace with hash 219346772, now seen corresponding path program 1420 times [2020-01-16 19:08:26,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:26,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653051944] [2020-01-16 19:08:26,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:26,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653051944] [2020-01-16 19:08:26,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:26,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:26,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497588327] [2020-01-16 19:08:26,528 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:26,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:26,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:26,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:26,528 INFO L87 Difference]: Start difference. First operand 380 states and 1300 transitions. Second operand 9 states. [2020-01-16 19:08:26,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:26,646 INFO L93 Difference]: Finished difference Result 543 states and 1604 transitions. [2020-01-16 19:08:26,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:26,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:26,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:26,647 INFO L225 Difference]: With dead ends: 543 [2020-01-16 19:08:26,647 INFO L226 Difference]: Without dead ends: 528 [2020-01-16 19:08:26,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:26,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-01-16 19:08:26,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 379. [2020-01-16 19:08:26,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-01-16 19:08:26,656 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-01-16 19:08:26,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:26,657 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-01-16 19:08:26,657 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:26,657 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-01-16 19:08:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:26,657 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:26,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, 1, 1, 1] [2020-01-16 19:08:26,657 INFO L426 AbstractCegarLoop]: === Iteration 1427 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:26,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:26,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1305561032, now seen corresponding path program 1421 times [2020-01-16 19:08:26,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:26,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487246214] [2020-01-16 19:08:26,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:26,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-01-16 19:08:26,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487246214] [2020-01-16 19:08:26,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:26,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:26,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073325852] [2020-01-16 19:08:26,902 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:26,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:26,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:26,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:26,903 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:08:27,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:27,018 INFO L93 Difference]: Finished difference Result 541 states and 1601 transitions. [2020-01-16 19:08:27,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:27,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:27,020 INFO L225 Difference]: With dead ends: 541 [2020-01-16 19:08:27,020 INFO L226 Difference]: Without dead ends: 531 [2020-01-16 19:08:27,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:27,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-01-16 19:08:27,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 381. [2020-01-16 19:08:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:08:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1301 transitions. [2020-01-16 19:08:27,029 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1301 transitions. Word has length 22 [2020-01-16 19:08:27,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:27,029 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1301 transitions. [2020-01-16 19:08:27,030 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1301 transitions. [2020-01-16 19:08:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:27,030 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:27,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, 1, 1, 1] [2020-01-16 19:08:27,030 INFO L426 AbstractCegarLoop]: === Iteration 1428 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:27,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:27,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1381091082, now seen corresponding path program 1422 times [2020-01-16 19:08:27,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:27,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559764396] [2020-01-16 19:08:27,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:27,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559764396] [2020-01-16 19:08:27,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:27,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:27,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836531295] [2020-01-16 19:08:27,276 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:27,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:27,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:27,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:27,277 INFO L87 Difference]: Start difference. First operand 381 states and 1301 transitions. Second operand 9 states. [2020-01-16 19:08:27,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:27,394 INFO L93 Difference]: Finished difference Result 545 states and 1607 transitions. [2020-01-16 19:08:27,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:27,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:27,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:27,396 INFO L225 Difference]: With dead ends: 545 [2020-01-16 19:08:27,396 INFO L226 Difference]: Without dead ends: 528 [2020-01-16 19:08:27,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:27,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-01-16 19:08:27,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 378. [2020-01-16 19:08:27,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:08:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1296 transitions. [2020-01-16 19:08:27,405 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1296 transitions. Word has length 22 [2020-01-16 19:08:27,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:27,405 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1296 transitions. [2020-01-16 19:08:27,405 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1296 transitions. [2020-01-16 19:08:27,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:27,406 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:27,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, 1, 1, 1] [2020-01-16 19:08:27,406 INFO L426 AbstractCegarLoop]: === Iteration 1429 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:27,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:27,406 INFO L82 PathProgramCache]: Analyzing trace with hash 607961620, now seen corresponding path program 1423 times [2020-01-16 19:08:27,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:27,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318565897] [2020-01-16 19:08:27,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:27,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-01-16 19:08:27,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318565897] [2020-01-16 19:08:27,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:27,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:27,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150862729] [2020-01-16 19:08:27,676 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:27,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:27,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:27,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:27,676 INFO L87 Difference]: Start difference. First operand 378 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:08:27,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:27,774 INFO L93 Difference]: Finished difference Result 531 states and 1581 transitions. [2020-01-16 19:08:27,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:27,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:27,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:27,775 INFO L225 Difference]: With dead ends: 531 [2020-01-16 19:08:27,775 INFO L226 Difference]: Without dead ends: 522 [2020-01-16 19:08:27,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:27,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-01-16 19:08:27,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 380. [2020-01-16 19:08:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:27,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1300 transitions. [2020-01-16 19:08:27,785 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1300 transitions. Word has length 22 [2020-01-16 19:08:27,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:27,785 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1300 transitions. [2020-01-16 19:08:27,785 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:27,785 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1300 transitions. [2020-01-16 19:08:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:27,786 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:27,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, 1, 1, 1] [2020-01-16 19:08:27,786 INFO L426 AbstractCegarLoop]: === Iteration 1430 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:27,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:27,786 INFO L82 PathProgramCache]: Analyzing trace with hash -2076064718, now seen corresponding path program 1424 times [2020-01-16 19:08:27,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:27,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134821091] [2020-01-16 19:08:27,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:28,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134821091] [2020-01-16 19:08:28,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:28,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:28,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682833382] [2020-01-16 19:08:28,057 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:28,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:28,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:28,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:28,058 INFO L87 Difference]: Start difference. First operand 380 states and 1300 transitions. Second operand 9 states. [2020-01-16 19:08:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:28,165 INFO L93 Difference]: Finished difference Result 532 states and 1582 transitions. [2020-01-16 19:08:28,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:28,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:28,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:28,167 INFO L225 Difference]: With dead ends: 532 [2020-01-16 19:08:28,167 INFO L226 Difference]: Without dead ends: 521 [2020-01-16 19:08:28,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:28,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-01-16 19:08:28,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 379. [2020-01-16 19:08:28,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:28,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-01-16 19:08:28,176 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-01-16 19:08:28,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:28,176 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-01-16 19:08:28,176 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:28,177 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-01-16 19:08:28,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:28,177 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:28,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, 1, 1, 1] [2020-01-16 19:08:28,178 INFO L426 AbstractCegarLoop]: === Iteration 1431 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:28,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:28,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1620654152, now seen corresponding path program 1425 times [2020-01-16 19:08:28,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:28,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303220970] [2020-01-16 19:08:28,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:28,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303220970] [2020-01-16 19:08:28,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:28,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:28,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858179356] [2020-01-16 19:08:28,453 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:28,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:28,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:28,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:28,454 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:08:28,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:28,538 INFO L93 Difference]: Finished difference Result 532 states and 1583 transitions. [2020-01-16 19:08:28,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:28,539 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:28,540 INFO L225 Difference]: With dead ends: 532 [2020-01-16 19:08:28,540 INFO L226 Difference]: Without dead ends: 523 [2020-01-16 19:08:28,540 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:28,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-01-16 19:08:28,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 380. [2020-01-16 19:08:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:28,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1299 transitions. [2020-01-16 19:08:28,549 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1299 transitions. Word has length 22 [2020-01-16 19:08:28,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:28,550 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1299 transitions. [2020-01-16 19:08:28,550 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:28,550 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1299 transitions. [2020-01-16 19:08:28,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:28,550 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:28,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, 1, 1, 1] [2020-01-16 19:08:28,550 INFO L426 AbstractCegarLoop]: === Iteration 1432 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:28,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:28,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2139083342, now seen corresponding path program 1426 times [2020-01-16 19:08:28,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:28,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545617760] [2020-01-16 19:08:28,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:28,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-01-16 19:08:28,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545617760] [2020-01-16 19:08:28,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:28,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:28,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242940859] [2020-01-16 19:08:28,807 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:28,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:28,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:28,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:28,807 INFO L87 Difference]: Start difference. First operand 380 states and 1299 transitions. Second operand 9 states. [2020-01-16 19:08:28,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:28,926 INFO L93 Difference]: Finished difference Result 526 states and 1580 transitions. [2020-01-16 19:08:28,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:28,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:28,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:28,927 INFO L225 Difference]: With dead ends: 526 [2020-01-16 19:08:28,927 INFO L226 Difference]: Without dead ends: 513 [2020-01-16 19:08:28,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:28,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2020-01-16 19:08:28,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 379. [2020-01-16 19:08:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:28,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1297 transitions. [2020-01-16 19:08:28,936 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1297 transitions. Word has length 22 [2020-01-16 19:08:28,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:28,937 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1297 transitions. [2020-01-16 19:08:28,937 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:28,937 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1297 transitions. [2020-01-16 19:08:28,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:28,937 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:28,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, 1, 1, 1] [2020-01-16 19:08:28,937 INFO L426 AbstractCegarLoop]: === Iteration 1433 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:28,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:28,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1631157256, now seen corresponding path program 1427 times [2020-01-16 19:08:28,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:28,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142077177] [2020-01-16 19:08:28,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:29,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-01-16 19:08:29,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142077177] [2020-01-16 19:08:29,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:29,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:29,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526221550] [2020-01-16 19:08:29,192 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:29,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:29,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:29,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:29,192 INFO L87 Difference]: Start difference. First operand 379 states and 1297 transitions. Second operand 9 states. [2020-01-16 19:08:29,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:29,298 INFO L93 Difference]: Finished difference Result 534 states and 1587 transitions. [2020-01-16 19:08:29,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:29,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:29,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:29,300 INFO L225 Difference]: With dead ends: 534 [2020-01-16 19:08:29,300 INFO L226 Difference]: Without dead ends: 524 [2020-01-16 19:08:29,300 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:29,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-01-16 19:08:29,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 381. [2020-01-16 19:08:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:08:29,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1300 transitions. [2020-01-16 19:08:29,309 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1300 transitions. Word has length 22 [2020-01-16 19:08:29,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:29,309 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1300 transitions. [2020-01-16 19:08:29,310 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1300 transitions. [2020-01-16 19:08:29,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:29,310 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:29,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, 1, 1, 1] [2020-01-16 19:08:29,310 INFO L426 AbstractCegarLoop]: === Iteration 1434 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:29,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:29,310 INFO L82 PathProgramCache]: Analyzing trace with hash 555446100, now seen corresponding path program 1428 times [2020-01-16 19:08:29,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:29,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303083747] [2020-01-16 19:08:29,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:29,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303083747] [2020-01-16 19:08:29,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:29,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:29,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707122214] [2020-01-16 19:08:29,564 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:29,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:29,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:29,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:29,565 INFO L87 Difference]: Start difference. First operand 381 states and 1300 transitions. Second operand 9 states. [2020-01-16 19:08:29,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:29,684 INFO L93 Difference]: Finished difference Result 527 states and 1581 transitions. [2020-01-16 19:08:29,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:29,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:29,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:29,686 INFO L225 Difference]: With dead ends: 527 [2020-01-16 19:08:29,686 INFO L226 Difference]: Without dead ends: 512 [2020-01-16 19:08:29,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:29,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2020-01-16 19:08:29,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 378. [2020-01-16 19:08:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:08:29,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1295 transitions. [2020-01-16 19:08:29,695 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1295 transitions. Word has length 22 [2020-01-16 19:08:29,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:29,695 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1295 transitions. [2020-01-16 19:08:29,695 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:29,695 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1295 transitions. [2020-01-16 19:08:29,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:29,696 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:29,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, 1, 1, 1] [2020-01-16 19:08:29,696 INFO L426 AbstractCegarLoop]: === Iteration 1435 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:29,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:29,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1671211948, now seen corresponding path program 1429 times [2020-01-16 19:08:29,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:29,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198372102] [2020-01-16 19:08:29,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:29,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-01-16 19:08:29,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198372102] [2020-01-16 19:08:29,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:29,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:29,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31549935] [2020-01-16 19:08:29,946 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:29,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:29,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:29,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:29,946 INFO L87 Difference]: Start difference. First operand 378 states and 1295 transitions. Second operand 9 states. [2020-01-16 19:08:30,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:30,035 INFO L93 Difference]: Finished difference Result 541 states and 1602 transitions. [2020-01-16 19:08:30,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:30,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:30,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:30,037 INFO L225 Difference]: With dead ends: 541 [2020-01-16 19:08:30,037 INFO L226 Difference]: Without dead ends: 532 [2020-01-16 19:08:30,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:30,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-01-16 19:08:30,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 380. [2020-01-16 19:08:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1299 transitions. [2020-01-16 19:08:30,046 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1299 transitions. Word has length 22 [2020-01-16 19:08:30,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:30,046 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1299 transitions. [2020-01-16 19:08:30,046 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1299 transitions. [2020-01-16 19:08:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:30,047 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:30,047 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:30,047 INFO L426 AbstractCegarLoop]: === Iteration 1436 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:30,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:30,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1548044192, now seen corresponding path program 1430 times [2020-01-16 19:08:30,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:30,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334560715] [2020-01-16 19:08:30,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:30,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334560715] [2020-01-16 19:08:30,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:30,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:30,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626928962] [2020-01-16 19:08:30,297 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:30,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:30,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:30,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:30,297 INFO L87 Difference]: Start difference. First operand 380 states and 1299 transitions. Second operand 9 states. [2020-01-16 19:08:30,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:30,407 INFO L93 Difference]: Finished difference Result 546 states and 1611 transitions. [2020-01-16 19:08:30,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:30,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:30,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:30,409 INFO L225 Difference]: With dead ends: 546 [2020-01-16 19:08:30,409 INFO L226 Difference]: Without dead ends: 531 [2020-01-16 19:08:30,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:30,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-01-16 19:08:30,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 379. [2020-01-16 19:08:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1297 transitions. [2020-01-16 19:08:30,418 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1297 transitions. Word has length 22 [2020-01-16 19:08:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:30,418 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1297 transitions. [2020-01-16 19:08:30,418 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1297 transitions. [2020-01-16 19:08:30,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:30,419 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:30,419 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:30,419 INFO L426 AbstractCegarLoop]: === Iteration 1437 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:30,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:30,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1023317494, now seen corresponding path program 1431 times [2020-01-16 19:08:30,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:30,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615794502] [2020-01-16 19:08:30,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:30,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-01-16 19:08:30,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615794502] [2020-01-16 19:08:30,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:30,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:30,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664284431] [2020-01-16 19:08:30,671 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:30,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:30,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:30,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:30,671 INFO L87 Difference]: Start difference. First operand 379 states and 1297 transitions. Second operand 9 states. [2020-01-16 19:08:30,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:30,756 INFO L93 Difference]: Finished difference Result 538 states and 1596 transitions. [2020-01-16 19:08:30,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:30,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:30,758 INFO L225 Difference]: With dead ends: 538 [2020-01-16 19:08:30,758 INFO L226 Difference]: Without dead ends: 529 [2020-01-16 19:08:30,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-01-16 19:08:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 380. [2020-01-16 19:08:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1298 transitions. [2020-01-16 19:08:30,768 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1298 transitions. Word has length 22 [2020-01-16 19:08:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:30,768 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1298 transitions. [2020-01-16 19:08:30,768 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1298 transitions. [2020-01-16 19:08:30,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:30,769 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:30,769 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:30,769 INFO L426 AbstractCegarLoop]: === Iteration 1438 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:30,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:30,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1558547296, now seen corresponding path program 1432 times [2020-01-16 19:08:30,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:30,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668670392] [2020-01-16 19:08:30,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:31,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668670392] [2020-01-16 19:08:31,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:31,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:31,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816835732] [2020-01-16 19:08:31,016 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:31,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:31,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:31,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:31,016 INFO L87 Difference]: Start difference. First operand 380 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:08:31,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:31,128 INFO L93 Difference]: Finished difference Result 532 states and 1593 transitions. [2020-01-16 19:08:31,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:31,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:31,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:31,130 INFO L225 Difference]: With dead ends: 532 [2020-01-16 19:08:31,130 INFO L226 Difference]: Without dead ends: 519 [2020-01-16 19:08:31,130 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:31,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-01-16 19:08:31,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 379. [2020-01-16 19:08:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:31,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1296 transitions. [2020-01-16 19:08:31,139 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1296 transitions. Word has length 22 [2020-01-16 19:08:31,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:31,139 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1296 transitions. [2020-01-16 19:08:31,139 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:31,139 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1296 transitions. [2020-01-16 19:08:31,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:31,140 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:31,140 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:31,140 INFO L426 AbstractCegarLoop]: === Iteration 1439 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:31,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:31,140 INFO L82 PathProgramCache]: Analyzing trace with hash 960298870, now seen corresponding path program 1433 times [2020-01-16 19:08:31,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:31,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752413555] [2020-01-16 19:08:31,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:31,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-01-16 19:08:31,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752413555] [2020-01-16 19:08:31,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:31,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:31,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240737080] [2020-01-16 19:08:31,385 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:31,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:31,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:31,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:31,386 INFO L87 Difference]: Start difference. First operand 379 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:08:31,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:31,491 INFO L93 Difference]: Finished difference Result 546 states and 1614 transitions. [2020-01-16 19:08:31,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:31,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:31,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:31,493 INFO L225 Difference]: With dead ends: 546 [2020-01-16 19:08:31,493 INFO L226 Difference]: Without dead ends: 532 [2020-01-16 19:08:31,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:31,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-01-16 19:08:31,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 383. [2020-01-16 19:08:31,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:08:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1303 transitions. [2020-01-16 19:08:31,502 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1303 transitions. Word has length 22 [2020-01-16 19:08:31,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:31,502 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1303 transitions. [2020-01-16 19:08:31,502 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1303 transitions. [2020-01-16 19:08:31,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:31,502 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:31,502 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:31,502 INFO L426 AbstractCegarLoop]: === Iteration 1440 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:31,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1723727468, now seen corresponding path program 1434 times [2020-01-16 19:08:31,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:31,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24883788] [2020-01-16 19:08:31,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:31,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-01-16 19:08:31,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24883788] [2020-01-16 19:08:31,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:31,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:31,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455230350] [2020-01-16 19:08:31,750 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:31,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:31,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:31,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:31,750 INFO L87 Difference]: Start difference. First operand 383 states and 1303 transitions. Second operand 9 states. [2020-01-16 19:08:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:31,865 INFO L93 Difference]: Finished difference Result 535 states and 1598 transitions. [2020-01-16 19:08:31,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:31,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:31,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:31,867 INFO L225 Difference]: With dead ends: 535 [2020-01-16 19:08:31,867 INFO L226 Difference]: Without dead ends: 518 [2020-01-16 19:08:31,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:31,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-01-16 19:08:31,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 378. [2020-01-16 19:08:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:08:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1294 transitions. [2020-01-16 19:08:31,876 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1294 transitions. Word has length 22 [2020-01-16 19:08:31,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:31,877 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1294 transitions. [2020-01-16 19:08:31,877 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1294 transitions. [2020-01-16 19:08:31,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:31,877 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:31,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:31,877 INFO L426 AbstractCegarLoop]: === Iteration 1441 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:31,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:31,878 INFO L82 PathProgramCache]: Analyzing trace with hash 265325234, now seen corresponding path program 1435 times [2020-01-16 19:08:31,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:31,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748608751] [2020-01-16 19:08:31,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:32,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-01-16 19:08:32,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748608751] [2020-01-16 19:08:32,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:32,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:32,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197332250] [2020-01-16 19:08:32,114 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:32,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:32,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:32,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:32,114 INFO L87 Difference]: Start difference. First operand 378 states and 1294 transitions. Second operand 9 states. [2020-01-16 19:08:32,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:32,229 INFO L93 Difference]: Finished difference Result 547 states and 1617 transitions. [2020-01-16 19:08:32,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:32,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:32,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:32,231 INFO L225 Difference]: With dead ends: 547 [2020-01-16 19:08:32,231 INFO L226 Difference]: Without dead ends: 537 [2020-01-16 19:08:32,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:32,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-01-16 19:08:32,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 382. [2020-01-16 19:08:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:08:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1304 transitions. [2020-01-16 19:08:32,240 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1304 transitions. Word has length 22 [2020-01-16 19:08:32,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:32,241 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1304 transitions. [2020-01-16 19:08:32,241 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:32,241 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1304 transitions. [2020-01-16 19:08:32,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:32,241 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:32,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, 1, 1, 1] [2020-01-16 19:08:32,241 INFO L426 AbstractCegarLoop]: === Iteration 1442 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:32,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:32,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1873640416, now seen corresponding path program 1436 times [2020-01-16 19:08:32,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:32,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599122018] [2020-01-16 19:08:32,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:32,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-01-16 19:08:32,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599122018] [2020-01-16 19:08:32,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:32,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:32,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877648190] [2020-01-16 19:08:32,468 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:32,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:32,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:32,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:32,468 INFO L87 Difference]: Start difference. First operand 382 states and 1304 transitions. Second operand 9 states. [2020-01-16 19:08:32,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:32,579 INFO L93 Difference]: Finished difference Result 551 states and 1623 transitions. [2020-01-16 19:08:32,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:32,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:32,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:32,581 INFO L225 Difference]: With dead ends: 551 [2020-01-16 19:08:32,581 INFO L226 Difference]: Without dead ends: 535 [2020-01-16 19:08:32,582 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-01-16 19:08:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 380. [2020-01-16 19:08:32,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:32,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1299 transitions. [2020-01-16 19:08:32,590 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1299 transitions. Word has length 22 [2020-01-16 19:08:32,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:32,590 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1299 transitions. [2020-01-16 19:08:32,590 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:32,590 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1299 transitions. [2020-01-16 19:08:32,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:32,591 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:32,591 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:32,591 INFO L426 AbstractCegarLoop]: === Iteration 1443 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:32,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:32,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1335112620, now seen corresponding path program 1437 times [2020-01-16 19:08:32,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:32,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955108843] [2020-01-16 19:08:32,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:32,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955108843] [2020-01-16 19:08:32,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:32,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:32,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127400059] [2020-01-16 19:08:32,826 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:32,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:32,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:32,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:32,826 INFO L87 Difference]: Start difference. First operand 380 states and 1299 transitions. Second operand 9 states. [2020-01-16 19:08:32,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:32,942 INFO L93 Difference]: Finished difference Result 543 states and 1608 transitions. [2020-01-16 19:08:32,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:32,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:32,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:32,944 INFO L225 Difference]: With dead ends: 543 [2020-01-16 19:08:32,944 INFO L226 Difference]: Without dead ends: 533 [2020-01-16 19:08:32,944 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:32,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-01-16 19:08:32,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 382. [2020-01-16 19:08:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:08:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1302 transitions. [2020-01-16 19:08:32,954 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1302 transitions. Word has length 22 [2020-01-16 19:08:32,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:32,954 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1302 transitions. [2020-01-16 19:08:32,954 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:32,954 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1302 transitions. [2020-01-16 19:08:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:32,955 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:32,955 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:32,955 INFO L426 AbstractCegarLoop]: === Iteration 1444 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:32,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:32,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1884143520, now seen corresponding path program 1438 times [2020-01-16 19:08:32,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:32,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872833289] [2020-01-16 19:08:32,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:33,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872833289] [2020-01-16 19:08:33,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:33,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:33,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687438601] [2020-01-16 19:08:33,193 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:33,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:33,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:33,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:33,193 INFO L87 Difference]: Start difference. First operand 382 states and 1302 transitions. Second operand 9 states. [2020-01-16 19:08:33,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:33,307 INFO L93 Difference]: Finished difference Result 536 states and 1602 transitions. [2020-01-16 19:08:33,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:33,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:33,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:33,309 INFO L225 Difference]: With dead ends: 536 [2020-01-16 19:08:33,309 INFO L226 Difference]: Without dead ends: 522 [2020-01-16 19:08:33,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:33,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-01-16 19:08:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 380. [2020-01-16 19:08:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1297 transitions. [2020-01-16 19:08:33,319 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1297 transitions. Word has length 22 [2020-01-16 19:08:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:33,319 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1297 transitions. [2020-01-16 19:08:33,319 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1297 transitions. [2020-01-16 19:08:33,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:33,319 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:33,319 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:33,320 INFO L426 AbstractCegarLoop]: === Iteration 1445 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:33,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:33,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1408634348, now seen corresponding path program 1439 times [2020-01-16 19:08:33,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:33,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321008551] [2020-01-16 19:08:33,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:33,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321008551] [2020-01-16 19:08:33,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:33,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:33,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023617278] [2020-01-16 19:08:33,552 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:33,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:33,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:33,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:33,553 INFO L87 Difference]: Start difference. First operand 380 states and 1297 transitions. Second operand 9 states. [2020-01-16 19:08:33,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:33,661 INFO L93 Difference]: Finished difference Result 549 states and 1620 transitions. [2020-01-16 19:08:33,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:33,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:33,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:33,663 INFO L225 Difference]: With dead ends: 549 [2020-01-16 19:08:33,663 INFO L226 Difference]: Without dead ends: 535 [2020-01-16 19:08:33,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:33,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-01-16 19:08:33,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 384. [2020-01-16 19:08:33,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:08:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1304 transitions. [2020-01-16 19:08:33,671 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1304 transitions. Word has length 22 [2020-01-16 19:08:33,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:33,671 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1304 transitions. [2020-01-16 19:08:33,671 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:33,671 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1304 transitions. [2020-01-16 19:08:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:33,672 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:33,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:33,672 INFO L426 AbstractCegarLoop]: === Iteration 1446 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:33,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:33,672 INFO L82 PathProgramCache]: Analyzing trace with hash 202306610, now seen corresponding path program 1440 times [2020-01-16 19:08:33,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:33,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282471048] [2020-01-16 19:08:33,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:33,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-01-16 19:08:33,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282471048] [2020-01-16 19:08:33,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:33,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:33,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016752218] [2020-01-16 19:08:33,917 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:33,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:33,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:33,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:33,918 INFO L87 Difference]: Start difference. First operand 384 states and 1304 transitions. Second operand 9 states. [2020-01-16 19:08:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:34,033 INFO L93 Difference]: Finished difference Result 538 states and 1604 transitions. [2020-01-16 19:08:34,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:34,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:34,034 INFO L225 Difference]: With dead ends: 538 [2020-01-16 19:08:34,035 INFO L226 Difference]: Without dead ends: 515 [2020-01-16 19:08:34,035 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:34,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2020-01-16 19:08:34,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 373. [2020-01-16 19:08:34,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:08:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1286 transitions. [2020-01-16 19:08:34,043 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1286 transitions. Word has length 22 [2020-01-16 19:08:34,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:34,043 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1286 transitions. [2020-01-16 19:08:34,043 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:34,043 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1286 transitions. [2020-01-16 19:08:34,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:34,044 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:34,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, 1, 1, 1] [2020-01-16 19:08:34,044 INFO L426 AbstractCegarLoop]: === Iteration 1447 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:34,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:34,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1828499748, now seen corresponding path program 1441 times [2020-01-16 19:08:34,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:34,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838021281] [2020-01-16 19:08:34,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:34,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-01-16 19:08:34,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838021281] [2020-01-16 19:08:34,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:34,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:34,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478590323] [2020-01-16 19:08:34,331 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:34,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:34,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:34,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:34,331 INFO L87 Difference]: Start difference. First operand 373 states and 1286 transitions. Second operand 9 states. [2020-01-16 19:08:34,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:34,431 INFO L93 Difference]: Finished difference Result 578 states and 1693 transitions. [2020-01-16 19:08:34,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:34,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:34,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:34,433 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:08:34,433 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:08:34,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:34,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:08:34,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 381. [2020-01-16 19:08:34,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:08:34,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1306 transitions. [2020-01-16 19:08:34,442 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1306 transitions. Word has length 22 [2020-01-16 19:08:34,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:34,442 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1306 transitions. [2020-01-16 19:08:34,443 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:34,443 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1306 transitions. [2020-01-16 19:08:34,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:34,443 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:34,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:34,443 INFO L426 AbstractCegarLoop]: === Iteration 1448 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:34,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:34,443 INFO L82 PathProgramCache]: Analyzing trace with hash -876201662, now seen corresponding path program 1442 times [2020-01-16 19:08:34,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:34,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201938574] [2020-01-16 19:08:34,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:34,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-01-16 19:08:34,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201938574] [2020-01-16 19:08:34,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:34,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:34,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843027473] [2020-01-16 19:08:34,719 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:34,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:34,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:34,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:34,719 INFO L87 Difference]: Start difference. First operand 381 states and 1306 transitions. Second operand 9 states. [2020-01-16 19:08:34,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:34,831 INFO L93 Difference]: Finished difference Result 573 states and 1680 transitions. [2020-01-16 19:08:34,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:34,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:34,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:34,833 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:08:34,833 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:08:34,833 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:34,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:08:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 377. [2020-01-16 19:08:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:08:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1298 transitions. [2020-01-16 19:08:34,842 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1298 transitions. Word has length 22 [2020-01-16 19:08:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:34,842 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1298 transitions. [2020-01-16 19:08:34,842 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1298 transitions. [2020-01-16 19:08:34,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:34,843 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:34,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, 1, 1, 1] [2020-01-16 19:08:34,843 INFO L426 AbstractCegarLoop]: === Iteration 1449 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:34,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:34,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1113917228, now seen corresponding path program 1443 times [2020-01-16 19:08:34,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:34,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204537657] [2020-01-16 19:08:34,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:35,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204537657] [2020-01-16 19:08:35,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:35,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:35,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458500316] [2020-01-16 19:08:35,125 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:35,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:35,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:35,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:35,126 INFO L87 Difference]: Start difference. First operand 377 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:08:35,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:35,214 INFO L93 Difference]: Finished difference Result 574 states and 1681 transitions. [2020-01-16 19:08:35,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:35,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:35,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:35,216 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:08:35,216 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:08:35,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:35,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:08:35,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 379. [2020-01-16 19:08:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1300 transitions. [2020-01-16 19:08:35,225 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1300 transitions. Word has length 22 [2020-01-16 19:08:35,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:35,225 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1300 transitions. [2020-01-16 19:08:35,226 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:35,226 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1300 transitions. [2020-01-16 19:08:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:35,226 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:35,226 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:35,226 INFO L426 AbstractCegarLoop]: === Iteration 1450 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:35,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:35,226 INFO L82 PathProgramCache]: Analyzing trace with hash -552848736, now seen corresponding path program 1444 times [2020-01-16 19:08:35,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:35,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191806003] [2020-01-16 19:08:35,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:35,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-01-16 19:08:35,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191806003] [2020-01-16 19:08:35,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:35,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:35,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034506466] [2020-01-16 19:08:35,513 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:35,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:35,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:35,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:35,513 INFO L87 Difference]: Start difference. First operand 379 states and 1300 transitions. Second operand 9 states. [2020-01-16 19:08:35,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:35,614 INFO L93 Difference]: Finished difference Result 567 states and 1666 transitions. [2020-01-16 19:08:35,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:35,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:35,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:35,616 INFO L225 Difference]: With dead ends: 567 [2020-01-16 19:08:35,616 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:08:35,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:35,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:08:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 377. [2020-01-16 19:08:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:08:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1296 transitions. [2020-01-16 19:08:35,625 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1296 transitions. Word has length 22 [2020-01-16 19:08:35,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:35,625 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1296 transitions. [2020-01-16 19:08:35,625 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1296 transitions. [2020-01-16 19:08:35,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:35,626 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:35,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, 1, 1, 1] [2020-01-16 19:08:35,626 INFO L426 AbstractCegarLoop]: === Iteration 1451 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:35,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:35,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1986759862, now seen corresponding path program 1445 times [2020-01-16 19:08:35,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:35,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225400478] [2020-01-16 19:08:35,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:35,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225400478] [2020-01-16 19:08:35,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:35,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:35,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612480263] [2020-01-16 19:08:35,916 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:35,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:35,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:35,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:35,917 INFO L87 Difference]: Start difference. First operand 377 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:08:36,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:36,020 INFO L93 Difference]: Finished difference Result 563 states and 1659 transitions. [2020-01-16 19:08:36,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:36,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:36,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:36,021 INFO L225 Difference]: With dead ends: 563 [2020-01-16 19:08:36,021 INFO L226 Difference]: Without dead ends: 552 [2020-01-16 19:08:36,021 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:36,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-01-16 19:08:36,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 378. [2020-01-16 19:08:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:08:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1297 transitions. [2020-01-16 19:08:36,030 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1297 transitions. Word has length 22 [2020-01-16 19:08:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:36,030 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1297 transitions. [2020-01-16 19:08:36,030 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:36,030 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1297 transitions. [2020-01-16 19:08:36,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:36,031 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:36,031 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:36,031 INFO L426 AbstractCegarLoop]: === Iteration 1452 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:36,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:36,031 INFO L82 PathProgramCache]: Analyzing trace with hash 541242852, now seen corresponding path program 1446 times [2020-01-16 19:08:36,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:36,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603806561] [2020-01-16 19:08:36,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:36,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-01-16 19:08:36,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603806561] [2020-01-16 19:08:36,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:36,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:36,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960395378] [2020-01-16 19:08:36,318 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:36,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:36,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:36,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:36,318 INFO L87 Difference]: Start difference. First operand 378 states and 1297 transitions. Second operand 9 states. [2020-01-16 19:08:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:36,422 INFO L93 Difference]: Finished difference Result 561 states and 1654 transitions. [2020-01-16 19:08:36,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:36,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:36,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:36,424 INFO L225 Difference]: With dead ends: 561 [2020-01-16 19:08:36,424 INFO L226 Difference]: Without dead ends: 549 [2020-01-16 19:08:36,424 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:36,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-01-16 19:08:36,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 375. [2020-01-16 19:08:36,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:08:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1292 transitions. [2020-01-16 19:08:36,433 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1292 transitions. Word has length 22 [2020-01-16 19:08:36,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:36,433 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1292 transitions. [2020-01-16 19:08:36,433 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1292 transitions. [2020-01-16 19:08:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:36,434 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:36,434 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:36,434 INFO L426 AbstractCegarLoop]: === Iteration 1453 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:36,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:36,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1406014022, now seen corresponding path program 1447 times [2020-01-16 19:08:36,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:36,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495308885] [2020-01-16 19:08:36,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:36,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495308885] [2020-01-16 19:08:36,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:36,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:36,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438310372] [2020-01-16 19:08:36,721 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:36,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:36,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:36,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:36,721 INFO L87 Difference]: Start difference. First operand 375 states and 1292 transitions. Second operand 9 states. [2020-01-16 19:08:36,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:36,828 INFO L93 Difference]: Finished difference Result 582 states and 1703 transitions. [2020-01-16 19:08:36,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:36,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:36,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:36,830 INFO L225 Difference]: With dead ends: 582 [2020-01-16 19:08:36,830 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:08:36,830 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:36,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:08:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 382. [2020-01-16 19:08:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:08:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1308 transitions. [2020-01-16 19:08:36,839 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1308 transitions. Word has length 22 [2020-01-16 19:08:36,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:36,840 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1308 transitions. [2020-01-16 19:08:36,840 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1308 transitions. [2020-01-16 19:08:36,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:36,840 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:36,840 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:36,840 INFO L426 AbstractCegarLoop]: === Iteration 1454 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:36,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:36,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1298687388, now seen corresponding path program 1448 times [2020-01-16 19:08:36,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:36,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645102017] [2020-01-16 19:08:36,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:37,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-01-16 19:08:37,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645102017] [2020-01-16 19:08:37,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:37,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:37,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718441452] [2020-01-16 19:08:37,124 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:37,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:37,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:37,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:37,125 INFO L87 Difference]: Start difference. First operand 382 states and 1308 transitions. Second operand 9 states. [2020-01-16 19:08:37,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:37,258 INFO L93 Difference]: Finished difference Result 577 states and 1690 transitions. [2020-01-16 19:08:37,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:37,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:37,260 INFO L225 Difference]: With dead ends: 577 [2020-01-16 19:08:37,260 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:08:37,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:37,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:08:37,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 378. [2020-01-16 19:08:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:08:37,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1299 transitions. [2020-01-16 19:08:37,269 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1299 transitions. Word has length 22 [2020-01-16 19:08:37,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:37,270 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1299 transitions. [2020-01-16 19:08:37,270 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:37,270 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1299 transitions. [2020-01-16 19:08:37,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:37,270 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:37,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, 1, 1, 1] [2020-01-16 19:08:37,270 INFO L426 AbstractCegarLoop]: === Iteration 1455 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:37,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:37,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1506926194, now seen corresponding path program 1449 times [2020-01-16 19:08:37,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:37,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821409838] [2020-01-16 19:08:37,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:37,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-01-16 19:08:37,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821409838] [2020-01-16 19:08:37,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:37,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:37,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854542344] [2020-01-16 19:08:37,554 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:37,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:37,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:37,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:37,554 INFO L87 Difference]: Start difference. First operand 378 states and 1299 transitions. Second operand 9 states. [2020-01-16 19:08:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:37,663 INFO L93 Difference]: Finished difference Result 580 states and 1695 transitions. [2020-01-16 19:08:37,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:37,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:37,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:37,665 INFO L225 Difference]: With dead ends: 580 [2020-01-16 19:08:37,665 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 19:08:37,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:37,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 19:08:37,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 381. [2020-01-16 19:08:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:08:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1303 transitions. [2020-01-16 19:08:37,675 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1303 transitions. Word has length 22 [2020-01-16 19:08:37,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:37,675 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1303 transitions. [2020-01-16 19:08:37,675 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1303 transitions. [2020-01-16 19:08:37,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:37,676 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:37,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, 1, 1, 1] [2020-01-16 19:08:37,676 INFO L426 AbstractCegarLoop]: === Iteration 1456 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:37,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:37,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1633562568, now seen corresponding path program 1450 times [2020-01-16 19:08:37,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:37,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575024747] [2020-01-16 19:08:37,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:37,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575024747] [2020-01-16 19:08:37,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:37,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:37,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507341066] [2020-01-16 19:08:37,964 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:37,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:37,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:37,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:37,964 INFO L87 Difference]: Start difference. First operand 381 states and 1303 transitions. Second operand 9 states. [2020-01-16 19:08:38,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:38,090 INFO L93 Difference]: Finished difference Result 574 states and 1681 transitions. [2020-01-16 19:08:38,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:38,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:38,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:38,092 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:08:38,092 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:08:38,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:08:38,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 378. [2020-01-16 19:08:38,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:08:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1296 transitions. [2020-01-16 19:08:38,101 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1296 transitions. Word has length 22 [2020-01-16 19:08:38,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:38,101 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1296 transitions. [2020-01-16 19:08:38,101 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:38,101 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1296 transitions. [2020-01-16 19:08:38,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:38,102 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:38,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, 1, 1, 1] [2020-01-16 19:08:38,102 INFO L426 AbstractCegarLoop]: === Iteration 1457 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:38,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:38,102 INFO L82 PathProgramCache]: Analyzing trace with hash -781455600, now seen corresponding path program 1451 times [2020-01-16 19:08:38,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:38,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921274406] [2020-01-16 19:08:38,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:38,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-01-16 19:08:38,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921274406] [2020-01-16 19:08:38,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:38,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:38,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605294063] [2020-01-16 19:08:38,391 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:38,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:38,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:38,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:38,392 INFO L87 Difference]: Start difference. First operand 378 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:08:38,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:38,503 INFO L93 Difference]: Finished difference Result 569 states and 1672 transitions. [2020-01-16 19:08:38,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:38,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:38,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:38,505 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:08:38,505 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:08:38,505 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:38,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:08:38,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 380. [2020-01-16 19:08:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1299 transitions. [2020-01-16 19:08:38,514 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1299 transitions. Word has length 22 [2020-01-16 19:08:38,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:38,514 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1299 transitions. [2020-01-16 19:08:38,514 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:38,514 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1299 transitions. [2020-01-16 19:08:38,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:38,515 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:38,515 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:38,515 INFO L426 AbstractCegarLoop]: === Iteration 1458 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:38,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:38,515 INFO L82 PathProgramCache]: Analyzing trace with hash 560477188, now seen corresponding path program 1452 times [2020-01-16 19:08:38,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:38,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267927924] [2020-01-16 19:08:38,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:38,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-01-16 19:08:38,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267927924] [2020-01-16 19:08:38,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:38,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:38,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779389629] [2020-01-16 19:08:38,800 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:38,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:38,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:38,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:38,800 INFO L87 Difference]: Start difference. First operand 380 states and 1299 transitions. Second operand 9 states. [2020-01-16 19:08:38,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:38,936 INFO L93 Difference]: Finished difference Result 568 states and 1668 transitions. [2020-01-16 19:08:38,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:38,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:38,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:38,938 INFO L225 Difference]: With dead ends: 568 [2020-01-16 19:08:38,938 INFO L226 Difference]: Without dead ends: 553 [2020-01-16 19:08:38,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:38,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-01-16 19:08:38,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 375. [2020-01-16 19:08:38,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:08:38,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1290 transitions. [2020-01-16 19:08:38,948 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1290 transitions. Word has length 22 [2020-01-16 19:08:38,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:38,948 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1290 transitions. [2020-01-16 19:08:38,948 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1290 transitions. [2020-01-16 19:08:38,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:38,948 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:38,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, 1, 1, 1] [2020-01-16 19:08:38,949 INFO L426 AbstractCegarLoop]: === Iteration 1459 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:38,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:38,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1132505132, now seen corresponding path program 1453 times [2020-01-16 19:08:38,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:38,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830515515] [2020-01-16 19:08:38,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:39,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-01-16 19:08:39,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830515515] [2020-01-16 19:08:39,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:39,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:39,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811207479] [2020-01-16 19:08:39,234 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:39,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:39,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:39,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:39,235 INFO L87 Difference]: Start difference. First operand 375 states and 1290 transitions. Second operand 9 states. [2020-01-16 19:08:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:39,341 INFO L93 Difference]: Finished difference Result 572 states and 1674 transitions. [2020-01-16 19:08:39,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:39,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:39,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:39,342 INFO L225 Difference]: With dead ends: 572 [2020-01-16 19:08:39,343 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:08:39,343 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:39,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:08:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 379. [2020-01-16 19:08:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-01-16 19:08:39,351 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-01-16 19:08:39,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:39,352 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-01-16 19:08:39,352 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-01-16 19:08:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:39,352 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:39,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, 1, 1, 1] [2020-01-16 19:08:39,352 INFO L426 AbstractCegarLoop]: === Iteration 1460 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:39,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:39,353 INFO L82 PathProgramCache]: Analyzing trace with hash -571436640, now seen corresponding path program 1454 times [2020-01-16 19:08:39,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:39,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261177538] [2020-01-16 19:08:39,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:39,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-01-16 19:08:39,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261177538] [2020-01-16 19:08:39,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:39,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:39,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176683315] [2020-01-16 19:08:39,641 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:39,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:39,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:39,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:39,642 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:08:39,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:39,754 INFO L93 Difference]: Finished difference Result 565 states and 1659 transitions. [2020-01-16 19:08:39,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:39,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:39,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:39,756 INFO L225 Difference]: With dead ends: 565 [2020-01-16 19:08:39,756 INFO L226 Difference]: Without dead ends: 554 [2020-01-16 19:08:39,756 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:39,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-01-16 19:08:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 377. [2020-01-16 19:08:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:08:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1294 transitions. [2020-01-16 19:08:39,766 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1294 transitions. Word has length 22 [2020-01-16 19:08:39,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:39,766 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1294 transitions. [2020-01-16 19:08:39,766 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1294 transitions. [2020-01-16 19:08:39,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:39,767 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:39,767 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:39,767 INFO L426 AbstractCegarLoop]: === Iteration 1461 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:39,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:39,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1562024310, now seen corresponding path program 1455 times [2020-01-16 19:08:39,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:39,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962644600] [2020-01-16 19:08:39,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:40,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-01-16 19:08:40,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962644600] [2020-01-16 19:08:40,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:40,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:40,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052038395] [2020-01-16 19:08:40,053 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:40,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:40,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:40,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:40,054 INFO L87 Difference]: Start difference. First operand 377 states and 1294 transitions. Second operand 9 states. [2020-01-16 19:08:40,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:40,159 INFO L93 Difference]: Finished difference Result 574 states and 1677 transitions. [2020-01-16 19:08:40,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:40,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:40,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:40,161 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:08:40,161 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:08:40,161 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:40,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:08:40,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 380. [2020-01-16 19:08:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1298 transitions. [2020-01-16 19:08:40,170 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1298 transitions. Word has length 22 [2020-01-16 19:08:40,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:40,170 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1298 transitions. [2020-01-16 19:08:40,171 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:40,171 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1298 transitions. [2020-01-16 19:08:40,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:40,171 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:40,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, 1, 1, 1] [2020-01-16 19:08:40,171 INFO L426 AbstractCegarLoop]: === Iteration 1462 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:40,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:40,171 INFO L82 PathProgramCache]: Analyzing trace with hash 599820648, now seen corresponding path program 1456 times [2020-01-16 19:08:40,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:40,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767755468] [2020-01-16 19:08:40,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:40,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-01-16 19:08:40,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767755468] [2020-01-16 19:08:40,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:40,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:40,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869992900] [2020-01-16 19:08:40,457 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:40,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:40,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:40,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:40,457 INFO L87 Difference]: Start difference. First operand 380 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:08:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:40,589 INFO L93 Difference]: Finished difference Result 568 states and 1663 transitions. [2020-01-16 19:08:40,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:40,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:40,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:40,591 INFO L225 Difference]: With dead ends: 568 [2020-01-16 19:08:40,591 INFO L226 Difference]: Without dead ends: 555 [2020-01-16 19:08:40,592 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:40,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-01-16 19:08:40,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 377. [2020-01-16 19:08:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:08:40,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1292 transitions. [2020-01-16 19:08:40,600 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1292 transitions. Word has length 22 [2020-01-16 19:08:40,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:40,600 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1292 transitions. [2020-01-16 19:08:40,600 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:40,600 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1292 transitions. [2020-01-16 19:08:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:40,601 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:40,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, 1, 1, 1] [2020-01-16 19:08:40,601 INFO L426 AbstractCegarLoop]: === Iteration 1463 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:40,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:40,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1616746536, now seen corresponding path program 1457 times [2020-01-16 19:08:40,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:40,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528271036] [2020-01-16 19:08:40,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:40,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-01-16 19:08:40,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528271036] [2020-01-16 19:08:40,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:40,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:40,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610513306] [2020-01-16 19:08:40,894 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:40,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:40,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:40,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:40,895 INFO L87 Difference]: Start difference. First operand 377 states and 1292 transitions. Second operand 9 states. [2020-01-16 19:08:40,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:40,985 INFO L93 Difference]: Finished difference Result 558 states and 1644 transitions. [2020-01-16 19:08:40,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:40,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:40,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:40,986 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:08:40,986 INFO L226 Difference]: Without dead ends: 549 [2020-01-16 19:08:40,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:40,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-01-16 19:08:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 378. [2020-01-16 19:08:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:08:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1293 transitions. [2020-01-16 19:08:40,995 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1293 transitions. Word has length 22 [2020-01-16 19:08:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:40,995 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1293 transitions. [2020-01-16 19:08:40,995 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1293 transitions. [2020-01-16 19:08:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:40,995 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:40,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, 1, 1, 1] [2020-01-16 19:08:40,996 INFO L426 AbstractCegarLoop]: === Iteration 1464 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:40,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:40,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1067279802, now seen corresponding path program 1458 times [2020-01-16 19:08:40,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:40,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208677886] [2020-01-16 19:08:40,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:41,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-01-16 19:08:41,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208677886] [2020-01-16 19:08:41,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:41,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:41,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16367003] [2020-01-16 19:08:41,283 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:41,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:41,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:41,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:41,284 INFO L87 Difference]: Start difference. First operand 378 states and 1293 transitions. Second operand 9 states. [2020-01-16 19:08:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:41,406 INFO L93 Difference]: Finished difference Result 559 states and 1645 transitions. [2020-01-16 19:08:41,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:41,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:41,408 INFO L225 Difference]: With dead ends: 559 [2020-01-16 19:08:41,408 INFO L226 Difference]: Without dead ends: 546 [2020-01-16 19:08:41,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:41,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-01-16 19:08:41,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 375. [2020-01-16 19:08:41,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:08:41,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1288 transitions. [2020-01-16 19:08:41,416 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1288 transitions. Word has length 22 [2020-01-16 19:08:41,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:41,417 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1288 transitions. [2020-01-16 19:08:41,417 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1288 transitions. [2020-01-16 19:08:41,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:41,417 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:41,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, 1, 1, 1] [2020-01-16 19:08:41,417 INFO L426 AbstractCegarLoop]: === Iteration 1465 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:41,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:41,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1525272818, now seen corresponding path program 1459 times [2020-01-16 19:08:41,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:41,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195525856] [2020-01-16 19:08:41,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:41,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195525856] [2020-01-16 19:08:41,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:41,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:41,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388690913] [2020-01-16 19:08:41,702 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:41,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:41,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:41,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:41,703 INFO L87 Difference]: Start difference. First operand 375 states and 1288 transitions. Second operand 9 states. [2020-01-16 19:08:41,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:41,846 INFO L93 Difference]: Finished difference Result 553 states and 1636 transitions. [2020-01-16 19:08:41,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:41,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:41,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:41,848 INFO L225 Difference]: With dead ends: 553 [2020-01-16 19:08:41,848 INFO L226 Difference]: Without dead ends: 542 [2020-01-16 19:08:41,848 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:41,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-01-16 19:08:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 377. [2020-01-16 19:08:41,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:08:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1292 transitions. [2020-01-16 19:08:41,857 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1292 transitions. Word has length 22 [2020-01-16 19:08:41,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:41,857 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1292 transitions. [2020-01-16 19:08:41,857 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1292 transitions. [2020-01-16 19:08:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:41,858 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:41,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, 1, 1, 1] [2020-01-16 19:08:41,858 INFO L426 AbstractCegarLoop]: === Iteration 1466 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:41,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:41,858 INFO L82 PathProgramCache]: Analyzing trace with hash 79755808, now seen corresponding path program 1460 times [2020-01-16 19:08:41,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:41,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316993254] [2020-01-16 19:08:41,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:42,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316993254] [2020-01-16 19:08:42,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:42,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:42,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103487916] [2020-01-16 19:08:42,160 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:42,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:42,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:42,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:42,161 INFO L87 Difference]: Start difference. First operand 377 states and 1292 transitions. Second operand 9 states. [2020-01-16 19:08:42,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:42,271 INFO L93 Difference]: Finished difference Result 551 states and 1631 transitions. [2020-01-16 19:08:42,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:42,272 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:42,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:42,273 INFO L225 Difference]: With dead ends: 551 [2020-01-16 19:08:42,273 INFO L226 Difference]: Without dead ends: 541 [2020-01-16 19:08:42,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:42,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-01-16 19:08:42,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 376. [2020-01-16 19:08:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:08:42,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1290 transitions. [2020-01-16 19:08:42,282 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1290 transitions. Word has length 22 [2020-01-16 19:08:42,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:42,283 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1290 transitions. [2020-01-16 19:08:42,283 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:42,283 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1290 transitions. [2020-01-16 19:08:42,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:42,283 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:42,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, 1, 1, 1] [2020-01-16 19:08:42,283 INFO L426 AbstractCegarLoop]: === Iteration 1467 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:42,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:42,284 INFO L82 PathProgramCache]: Analyzing trace with hash -75165036, now seen corresponding path program 1461 times [2020-01-16 19:08:42,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:42,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137373823] [2020-01-16 19:08:42,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:42,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137373823] [2020-01-16 19:08:42,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:42,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:42,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630421604] [2020-01-16 19:08:42,575 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:42,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:42,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:42,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:42,576 INFO L87 Difference]: Start difference. First operand 376 states and 1290 transitions. Second operand 9 states. [2020-01-16 19:08:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:42,694 INFO L93 Difference]: Finished difference Result 555 states and 1640 transitions. [2020-01-16 19:08:42,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:42,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:42,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:42,695 INFO L225 Difference]: With dead ends: 555 [2020-01-16 19:08:42,695 INFO L226 Difference]: Without dead ends: 544 [2020-01-16 19:08:42,696 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-01-16 19:08:42,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 378. [2020-01-16 19:08:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:08:42,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1293 transitions. [2020-01-16 19:08:42,703 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1293 transitions. Word has length 22 [2020-01-16 19:08:42,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:42,704 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1293 transitions. [2020-01-16 19:08:42,704 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:42,704 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1293 transitions. [2020-01-16 19:08:42,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:42,704 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:42,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, 1, 1, 1] [2020-01-16 19:08:42,704 INFO L426 AbstractCegarLoop]: === Iteration 1468 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:42,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:42,705 INFO L82 PathProgramCache]: Analyzing trace with hash 177927716, now seen corresponding path program 1462 times [2020-01-16 19:08:42,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:42,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343263049] [2020-01-16 19:08:42,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:42,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-01-16 19:08:42,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343263049] [2020-01-16 19:08:42,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:42,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:42,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675249364] [2020-01-16 19:08:42,993 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:42,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:42,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:42,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:42,994 INFO L87 Difference]: Start difference. First operand 378 states and 1293 transitions. Second operand 9 states. [2020-01-16 19:08:43,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:43,128 INFO L93 Difference]: Finished difference Result 554 states and 1636 transitions. [2020-01-16 19:08:43,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:43,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:43,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:43,130 INFO L225 Difference]: With dead ends: 554 [2020-01-16 19:08:43,130 INFO L226 Difference]: Without dead ends: 542 [2020-01-16 19:08:43,130 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-01-16 19:08:43,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 376. [2020-01-16 19:08:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:08:43,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1289 transitions. [2020-01-16 19:08:43,139 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1289 transitions. Word has length 22 [2020-01-16 19:08:43,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:43,140 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1289 transitions. [2020-01-16 19:08:43,140 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:43,140 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1289 transitions. [2020-01-16 19:08:43,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:43,140 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:43,140 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:43,140 INFO L426 AbstractCegarLoop]: === Iteration 1469 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:43,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:43,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1173847396, now seen corresponding path program 1463 times [2020-01-16 19:08:43,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:43,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666915097] [2020-01-16 19:08:43,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:43,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666915097] [2020-01-16 19:08:43,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:43,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:43,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516132694] [2020-01-16 19:08:43,446 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:43,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:43,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:43,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:43,446 INFO L87 Difference]: Start difference. First operand 376 states and 1289 transitions. Second operand 9 states. [2020-01-16 19:08:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:43,559 INFO L93 Difference]: Finished difference Result 550 states and 1628 transitions. [2020-01-16 19:08:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:43,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:43,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:43,560 INFO L225 Difference]: With dead ends: 550 [2020-01-16 19:08:43,561 INFO L226 Difference]: Without dead ends: 541 [2020-01-16 19:08:43,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:43,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-01-16 19:08:43,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 377. [2020-01-16 19:08:43,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:08:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1290 transitions. [2020-01-16 19:08:43,569 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1290 transitions. Word has length 22 [2020-01-16 19:08:43,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:43,569 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1290 transitions. [2020-01-16 19:08:43,569 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:43,569 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1290 transitions. [2020-01-16 19:08:43,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:43,570 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:43,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, 1, 1, 1] [2020-01-16 19:08:43,570 INFO L426 AbstractCegarLoop]: === Iteration 1470 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:43,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:43,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1510178942, now seen corresponding path program 1464 times [2020-01-16 19:08:43,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:43,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797619083] [2020-01-16 19:08:43,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:43,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-01-16 19:08:43,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797619083] [2020-01-16 19:08:43,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:43,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:43,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846564899] [2020-01-16 19:08:43,881 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:43,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:43,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:43,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:43,881 INFO L87 Difference]: Start difference. First operand 377 states and 1290 transitions. Second operand 9 states. [2020-01-16 19:08:43,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:43,995 INFO L93 Difference]: Finished difference Result 551 states and 1629 transitions. [2020-01-16 19:08:43,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:43,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:43,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:43,996 INFO L225 Difference]: With dead ends: 551 [2020-01-16 19:08:43,997 INFO L226 Difference]: Without dead ends: 537 [2020-01-16 19:08:43,997 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:44,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-01-16 19:08:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 373. [2020-01-16 19:08:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:08:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1284 transitions. [2020-01-16 19:08:44,006 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1284 transitions. Word has length 22 [2020-01-16 19:08:44,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:44,006 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1284 transitions. [2020-01-16 19:08:44,006 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1284 transitions. [2020-01-16 19:08:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:44,006 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:44,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, 1, 1, 1] [2020-01-16 19:08:44,007 INFO L426 AbstractCegarLoop]: === Iteration 1471 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:44,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:44,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1193533840, now seen corresponding path program 1465 times [2020-01-16 19:08:44,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:44,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663066371] [2020-01-16 19:08:44,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:44,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-01-16 19:08:44,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663066371] [2020-01-16 19:08:44,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:44,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:44,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024973646] [2020-01-16 19:08:44,289 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:44,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:44,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:44,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:44,289 INFO L87 Difference]: Start difference. First operand 373 states and 1284 transitions. Second operand 9 states. [2020-01-16 19:08:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:44,395 INFO L93 Difference]: Finished difference Result 584 states and 1708 transitions. [2020-01-16 19:08:44,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:44,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:44,397 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:08:44,397 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:08:44,397 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:44,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:08:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 381. [2020-01-16 19:08:44,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:08:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1304 transitions. [2020-01-16 19:08:44,407 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1304 transitions. Word has length 22 [2020-01-16 19:08:44,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:44,407 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1304 transitions. [2020-01-16 19:08:44,407 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1304 transitions. [2020-01-16 19:08:44,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:44,408 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:44,408 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:44,408 INFO L426 AbstractCegarLoop]: === Iteration 1472 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:44,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:44,408 INFO L82 PathProgramCache]: Analyzing trace with hash 396732046, now seen corresponding path program 1466 times [2020-01-16 19:08:44,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:44,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040822923] [2020-01-16 19:08:44,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:44,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040822923] [2020-01-16 19:08:44,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:44,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:44,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312942673] [2020-01-16 19:08:44,683 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:44,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:44,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:44,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:44,684 INFO L87 Difference]: Start difference. First operand 381 states and 1304 transitions. Second operand 9 states. [2020-01-16 19:08:44,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:44,816 INFO L93 Difference]: Finished difference Result 579 states and 1695 transitions. [2020-01-16 19:08:44,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:44,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:44,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:44,817 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:08:44,817 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 19:08:44,818 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 19:08:44,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 377. [2020-01-16 19:08:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:08:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1296 transitions. [2020-01-16 19:08:44,826 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1296 transitions. Word has length 22 [2020-01-16 19:08:44,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:44,827 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1296 transitions. [2020-01-16 19:08:44,827 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1296 transitions. [2020-01-16 19:08:44,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:44,827 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:44,827 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:44,827 INFO L426 AbstractCegarLoop]: === Iteration 1473 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:44,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:44,828 INFO L82 PathProgramCache]: Analyzing trace with hash 159016480, now seen corresponding path program 1467 times [2020-01-16 19:08:44,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:44,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359454651] [2020-01-16 19:08:44,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:45,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359454651] [2020-01-16 19:08:45,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:45,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:45,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748651263] [2020-01-16 19:08:45,110 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:45,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:45,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:45,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:45,111 INFO L87 Difference]: Start difference. First operand 377 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:08:45,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:45,217 INFO L93 Difference]: Finished difference Result 580 states and 1696 transitions. [2020-01-16 19:08:45,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:45,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:45,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:45,219 INFO L225 Difference]: With dead ends: 580 [2020-01-16 19:08:45,219 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 19:08:45,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:45,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 19:08:45,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 379. [2020-01-16 19:08:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:45,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1298 transitions. [2020-01-16 19:08:45,228 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1298 transitions. Word has length 22 [2020-01-16 19:08:45,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:45,229 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1298 transitions. [2020-01-16 19:08:45,229 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:45,229 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1298 transitions. [2020-01-16 19:08:45,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:45,229 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:45,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, 1, 1, 1] [2020-01-16 19:08:45,229 INFO L426 AbstractCegarLoop]: === Iteration 1474 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:45,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:45,230 INFO L82 PathProgramCache]: Analyzing trace with hash 720084972, now seen corresponding path program 1468 times [2020-01-16 19:08:45,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:45,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758983820] [2020-01-16 19:08:45,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:45,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-01-16 19:08:45,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758983820] [2020-01-16 19:08:45,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:45,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:45,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312017227] [2020-01-16 19:08:45,511 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:45,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:45,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:45,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:45,511 INFO L87 Difference]: Start difference. First operand 379 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:08:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:45,605 INFO L93 Difference]: Finished difference Result 573 states and 1681 transitions. [2020-01-16 19:08:45,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:45,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:45,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:45,607 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:08:45,607 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:08:45,607 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:45,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:08:45,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 377. [2020-01-16 19:08:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:08:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1294 transitions. [2020-01-16 19:08:45,616 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1294 transitions. Word has length 22 [2020-01-16 19:08:45,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:45,617 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1294 transitions. [2020-01-16 19:08:45,617 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1294 transitions. [2020-01-16 19:08:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:45,617 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:45,617 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:45,617 INFO L426 AbstractCegarLoop]: === Iteration 1475 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:45,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:45,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1035273726, now seen corresponding path program 1469 times [2020-01-16 19:08:45,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:45,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000581720] [2020-01-16 19:08:45,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:45,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-01-16 19:08:45,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000581720] [2020-01-16 19:08:45,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:45,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:45,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987011920] [2020-01-16 19:08:45,897 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:45,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:45,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:45,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:45,897 INFO L87 Difference]: Start difference. First operand 377 states and 1294 transitions. Second operand 9 states. [2020-01-16 19:08:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:46,033 INFO L93 Difference]: Finished difference Result 569 states and 1674 transitions. [2020-01-16 19:08:46,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:46,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:46,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:46,035 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:08:46,035 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:08:46,035 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:46,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:08:46,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 378. [2020-01-16 19:08:46,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:08:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1295 transitions. [2020-01-16 19:08:46,044 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1295 transitions. Word has length 22 [2020-01-16 19:08:46,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:46,044 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1295 transitions. [2020-01-16 19:08:46,045 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:46,045 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1295 transitions. [2020-01-16 19:08:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:46,045 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:46,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, 1, 1, 1] [2020-01-16 19:08:46,045 INFO L426 AbstractCegarLoop]: === Iteration 1476 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:46,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:46,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1814176560, now seen corresponding path program 1470 times [2020-01-16 19:08:46,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:46,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235360848] [2020-01-16 19:08:46,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:46,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-01-16 19:08:46,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235360848] [2020-01-16 19:08:46,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:46,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:46,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582847098] [2020-01-16 19:08:46,333 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:46,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:46,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:46,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:46,333 INFO L87 Difference]: Start difference. First operand 378 states and 1295 transitions. Second operand 9 states. [2020-01-16 19:08:46,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:46,420 INFO L93 Difference]: Finished difference Result 567 states and 1669 transitions. [2020-01-16 19:08:46,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:46,420 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:46,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:46,421 INFO L225 Difference]: With dead ends: 567 [2020-01-16 19:08:46,421 INFO L226 Difference]: Without dead ends: 555 [2020-01-16 19:08:46,422 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:46,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-01-16 19:08:46,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 375. [2020-01-16 19:08:46,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:08:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1290 transitions. [2020-01-16 19:08:46,431 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1290 transitions. Word has length 22 [2020-01-16 19:08:46,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:46,431 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1290 transitions. [2020-01-16 19:08:46,431 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:46,431 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1290 transitions. [2020-01-16 19:08:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:46,432 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:46,432 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:46,432 INFO L426 AbstractCegarLoop]: === Iteration 1477 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:46,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:46,432 INFO L82 PathProgramCache]: Analyzing trace with hash 918894790, now seen corresponding path program 1471 times [2020-01-16 19:08:46,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:46,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760614184] [2020-01-16 19:08:46,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:46,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-01-16 19:08:46,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760614184] [2020-01-16 19:08:46,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:46,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:46,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762255102] [2020-01-16 19:08:46,716 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:46,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:46,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:46,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:46,717 INFO L87 Difference]: Start difference. First operand 375 states and 1290 transitions. Second operand 9 states. [2020-01-16 19:08:46,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:46,800 INFO L93 Difference]: Finished difference Result 594 states and 1735 transitions. [2020-01-16 19:08:46,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:46,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:46,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:46,802 INFO L225 Difference]: With dead ends: 594 [2020-01-16 19:08:46,802 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:08:46,802 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:46,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:08:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 383. [2020-01-16 19:08:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:08:46,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1310 transitions. [2020-01-16 19:08:46,811 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1310 transitions. Word has length 22 [2020-01-16 19:08:46,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:46,812 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1310 transitions. [2020-01-16 19:08:46,812 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:46,812 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1310 transitions. [2020-01-16 19:08:46,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:46,812 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:46,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, 1, 1, 1] [2020-01-16 19:08:46,812 INFO L426 AbstractCegarLoop]: === Iteration 1478 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:46,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:46,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1785806620, now seen corresponding path program 1472 times [2020-01-16 19:08:46,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:46,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282830909] [2020-01-16 19:08:46,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:47,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-01-16 19:08:47,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282830909] [2020-01-16 19:08:47,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:47,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:47,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461293908] [2020-01-16 19:08:47,093 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:47,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:47,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:47,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:47,093 INFO L87 Difference]: Start difference. First operand 383 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:08:47,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:47,222 INFO L93 Difference]: Finished difference Result 589 states and 1722 transitions. [2020-01-16 19:08:47,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:47,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:47,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:47,223 INFO L225 Difference]: With dead ends: 589 [2020-01-16 19:08:47,224 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:08:47,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:47,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:08:47,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 379. [2020-01-16 19:08:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1300 transitions. [2020-01-16 19:08:47,233 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1300 transitions. Word has length 22 [2020-01-16 19:08:47,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:47,233 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1300 transitions. [2020-01-16 19:08:47,233 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1300 transitions. [2020-01-16 19:08:47,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:47,234 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:47,234 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:47,234 INFO L426 AbstractCegarLoop]: === Iteration 1479 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:47,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:47,234 INFO L82 PathProgramCache]: Analyzing trace with hash -429781962, now seen corresponding path program 1473 times [2020-01-16 19:08:47,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:47,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307302967] [2020-01-16 19:08:47,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:47,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307302967] [2020-01-16 19:08:47,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:47,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:47,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967953006] [2020-01-16 19:08:47,523 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:47,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:47,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:47,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:47,524 INFO L87 Difference]: Start difference. First operand 379 states and 1300 transitions. Second operand 9 states. [2020-01-16 19:08:47,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:47,636 INFO L93 Difference]: Finished difference Result 596 states and 1736 transitions. [2020-01-16 19:08:47,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:47,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:47,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:47,638 INFO L225 Difference]: With dead ends: 596 [2020-01-16 19:08:47,638 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:08:47,638 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:47,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:08:47,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 384. [2020-01-16 19:08:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:08:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1308 transitions. [2020-01-16 19:08:47,647 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1308 transitions. Word has length 22 [2020-01-16 19:08:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:47,648 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1308 transitions. [2020-01-16 19:08:47,648 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1308 transitions. [2020-01-16 19:08:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:47,648 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:47,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, 1, 1, 1] [2020-01-16 19:08:47,648 INFO L426 AbstractCegarLoop]: === Iteration 1480 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:47,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:47,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2131109864, now seen corresponding path program 1474 times [2020-01-16 19:08:47,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:47,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779315312] [2020-01-16 19:08:47,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:47,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:47,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779315312] [2020-01-16 19:08:47,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:47,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:47,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125015668] [2020-01-16 19:08:47,930 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:47,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:47,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:47,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:47,931 INFO L87 Difference]: Start difference. First operand 384 states and 1308 transitions. Second operand 9 states. [2020-01-16 19:08:48,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:48,073 INFO L93 Difference]: Finished difference Result 592 states and 1724 transitions. [2020-01-16 19:08:48,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:48,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:48,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:48,074 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:08:48,074 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:08:48,074 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:48,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:08:48,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 379. [2020-01-16 19:08:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1296 transitions. [2020-01-16 19:08:48,082 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1296 transitions. Word has length 22 [2020-01-16 19:08:48,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:48,083 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1296 transitions. [2020-01-16 19:08:48,083 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:48,083 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1296 transitions. [2020-01-16 19:08:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:48,083 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:48,083 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:48,083 INFO L426 AbstractCegarLoop]: === Iteration 1481 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:48,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:48,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1645078376, now seen corresponding path program 1475 times [2020-01-16 19:08:48,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:48,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117279299] [2020-01-16 19:08:48,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:48,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-01-16 19:08:48,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117279299] [2020-01-16 19:08:48,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:48,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:48,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744214335] [2020-01-16 19:08:48,368 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:48,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:48,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:48,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:48,368 INFO L87 Difference]: Start difference. First operand 379 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:08:48,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:48,504 INFO L93 Difference]: Finished difference Result 584 states and 1709 transitions. [2020-01-16 19:08:48,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:48,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:48,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:48,506 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:08:48,506 INFO L226 Difference]: Without dead ends: 573 [2020-01-16 19:08:48,507 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:48,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-01-16 19:08:48,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 382. [2020-01-16 19:08:48,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:08:48,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1301 transitions. [2020-01-16 19:08:48,516 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1301 transitions. Word has length 22 [2020-01-16 19:08:48,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:48,516 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1301 transitions. [2020-01-16 19:08:48,516 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1301 transitions. [2020-01-16 19:08:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:48,516 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:48,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, 1, 1, 1] [2020-01-16 19:08:48,517 INFO L426 AbstractCegarLoop]: === Iteration 1482 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:48,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:48,517 INFO L82 PathProgramCache]: Analyzing trace with hash -771337696, now seen corresponding path program 1476 times [2020-01-16 19:08:48,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:48,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250913699] [2020-01-16 19:08:48,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:48,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-01-16 19:08:48,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250913699] [2020-01-16 19:08:48,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:48,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:48,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422112807] [2020-01-16 19:08:48,796 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:48,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:48,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:48,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:48,797 INFO L87 Difference]: Start difference. First operand 382 states and 1301 transitions. Second operand 9 states. [2020-01-16 19:08:48,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:48,930 INFO L93 Difference]: Finished difference Result 585 states and 1708 transitions. [2020-01-16 19:08:48,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:48,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:48,932 INFO L225 Difference]: With dead ends: 585 [2020-01-16 19:08:48,932 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:08:48,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:48,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:08:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 375. [2020-01-16 19:08:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:08:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1288 transitions. [2020-01-16 19:08:48,941 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1288 transitions. Word has length 22 [2020-01-16 19:08:48,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:48,941 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1288 transitions. [2020-01-16 19:08:48,941 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:48,941 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1288 transitions. [2020-01-16 19:08:48,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:48,942 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:48,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:48,942 INFO L426 AbstractCegarLoop]: === Iteration 1483 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:48,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:48,942 INFO L82 PathProgramCache]: Analyzing trace with hash -290926944, now seen corresponding path program 1477 times [2020-01-16 19:08:48,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:48,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277000345] [2020-01-16 19:08:48,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:49,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-01-16 19:08:49,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277000345] [2020-01-16 19:08:49,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:49,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:49,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293850955] [2020-01-16 19:08:49,214 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:49,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:49,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:49,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:49,215 INFO L87 Difference]: Start difference. First operand 375 states and 1288 transitions. Second operand 9 states. [2020-01-16 19:08:49,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:49,323 INFO L93 Difference]: Finished difference Result 582 states and 1699 transitions. [2020-01-16 19:08:49,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:49,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:49,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:49,324 INFO L225 Difference]: With dead ends: 582 [2020-01-16 19:08:49,325 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:08:49,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:49,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:08:49,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 379. [2020-01-16 19:08:49,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1296 transitions. [2020-01-16 19:08:49,333 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1296 transitions. Word has length 22 [2020-01-16 19:08:49,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:49,333 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1296 transitions. [2020-01-16 19:08:49,333 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:49,333 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1296 transitions. [2020-01-16 19:08:49,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:49,334 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:49,334 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:49,334 INFO L426 AbstractCegarLoop]: === Iteration 1484 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:49,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:49,334 INFO L82 PathProgramCache]: Analyzing trace with hash 270141548, now seen corresponding path program 1478 times [2020-01-16 19:08:49,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:49,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088697559] [2020-01-16 19:08:49,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:49,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-01-16 19:08:49,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088697559] [2020-01-16 19:08:49,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:49,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:49,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924807894] [2020-01-16 19:08:49,608 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:49,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:49,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:49,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:49,608 INFO L87 Difference]: Start difference. First operand 379 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:08:49,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:49,696 INFO L93 Difference]: Finished difference Result 575 states and 1684 transitions. [2020-01-16 19:08:49,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:49,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:49,698 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:08:49,698 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 19:08:49,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 19:08:49,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 377. [2020-01-16 19:08:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:08:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1292 transitions. [2020-01-16 19:08:49,706 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1292 transitions. Word has length 22 [2020-01-16 19:08:49,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:49,707 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1292 transitions. [2020-01-16 19:08:49,707 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1292 transitions. [2020-01-16 19:08:49,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:49,707 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:49,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, 1, 1, 1] [2020-01-16 19:08:49,707 INFO L426 AbstractCegarLoop]: === Iteration 1485 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:49,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:49,708 INFO L82 PathProgramCache]: Analyzing trace with hash -878672266, now seen corresponding path program 1479 times [2020-01-16 19:08:49,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:49,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590039822] [2020-01-16 19:08:49,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:49,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-01-16 19:08:49,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590039822] [2020-01-16 19:08:49,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:49,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:49,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940691579] [2020-01-16 19:08:49,992 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:49,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:49,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:49,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:49,992 INFO L87 Difference]: Start difference. First operand 377 states and 1292 transitions. Second operand 9 states. [2020-01-16 19:08:50,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:50,099 INFO L93 Difference]: Finished difference Result 588 states and 1712 transitions. [2020-01-16 19:08:50,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:50,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:50,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:50,100 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:08:50,101 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:08:50,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:50,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:08:50,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 382. [2020-01-16 19:08:50,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:08:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1300 transitions. [2020-01-16 19:08:50,110 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1300 transitions. Word has length 22 [2020-01-16 19:08:50,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:50,110 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1300 transitions. [2020-01-16 19:08:50,111 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:50,111 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1300 transitions. [2020-01-16 19:08:50,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:50,111 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:50,111 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:50,111 INFO L426 AbstractCegarLoop]: === Iteration 1486 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:50,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:50,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1143244392, now seen corresponding path program 1480 times [2020-01-16 19:08:50,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:50,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888171731] [2020-01-16 19:08:50,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:50,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-01-16 19:08:50,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888171731] [2020-01-16 19:08:50,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:50,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:50,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592977823] [2020-01-16 19:08:50,401 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:50,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:50,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:50,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:50,401 INFO L87 Difference]: Start difference. First operand 382 states and 1300 transitions. Second operand 9 states. [2020-01-16 19:08:50,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:50,509 INFO L93 Difference]: Finished difference Result 584 states and 1700 transitions. [2020-01-16 19:08:50,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:50,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:50,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:50,511 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:08:50,511 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 19:08:50,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:50,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 19:08:50,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 377. [2020-01-16 19:08:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:08:50,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1290 transitions. [2020-01-16 19:08:50,520 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1290 transitions. Word has length 22 [2020-01-16 19:08:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:50,520 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1290 transitions. [2020-01-16 19:08:50,520 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:50,520 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1290 transitions. [2020-01-16 19:08:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:50,520 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:50,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, 1, 1, 1] [2020-01-16 19:08:50,520 INFO L426 AbstractCegarLoop]: === Iteration 1487 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:50,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:50,521 INFO L82 PathProgramCache]: Analyzing trace with hash -823950040, now seen corresponding path program 1481 times [2020-01-16 19:08:50,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:50,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812735642] [2020-01-16 19:08:50,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:50,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:50,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812735642] [2020-01-16 19:08:50,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:50,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:50,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091170517] [2020-01-16 19:08:50,803 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:50,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:50,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:50,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:50,804 INFO L87 Difference]: Start difference. First operand 377 states and 1290 transitions. Second operand 9 states. [2020-01-16 19:08:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:50,916 INFO L93 Difference]: Finished difference Result 570 states and 1673 transitions. [2020-01-16 19:08:50,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:50,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:50,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:50,917 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:08:50,917 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:08:50,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:50,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:08:50,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 378. [2020-01-16 19:08:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:08:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1291 transitions. [2020-01-16 19:08:50,927 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1291 transitions. Word has length 22 [2020-01-16 19:08:50,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:50,927 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1291 transitions. [2020-01-16 19:08:50,927 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1291 transitions. [2020-01-16 19:08:50,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:50,927 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:50,927 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:50,928 INFO L426 AbstractCegarLoop]: === Iteration 1488 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:50,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:50,928 INFO L82 PathProgramCache]: Analyzing trace with hash -288720238, now seen corresponding path program 1482 times [2020-01-16 19:08:50,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:50,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10288927] [2020-01-16 19:08:50,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:51,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-01-16 19:08:51,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10288927] [2020-01-16 19:08:51,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:51,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:51,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333785828] [2020-01-16 19:08:51,204 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:51,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:51,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:51,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:51,205 INFO L87 Difference]: Start difference. First operand 378 states and 1291 transitions. Second operand 9 states. [2020-01-16 19:08:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:51,325 INFO L93 Difference]: Finished difference Result 573 states and 1678 transitions. [2020-01-16 19:08:51,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:51,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:51,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:51,327 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:08:51,327 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:08:51,327 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:51,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:08:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 375. [2020-01-16 19:08:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:08:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1286 transitions. [2020-01-16 19:08:51,336 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1286 transitions. Word has length 22 [2020-01-16 19:08:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:51,336 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1286 transitions. [2020-01-16 19:08:51,336 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1286 transitions. [2020-01-16 19:08:51,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:51,337 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:51,337 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:51,337 INFO L426 AbstractCegarLoop]: === Iteration 1489 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:51,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:51,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1928116290, now seen corresponding path program 1483 times [2020-01-16 19:08:51,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:51,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923568757] [2020-01-16 19:08:51,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:51,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:51,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923568757] [2020-01-16 19:08:51,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:51,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:51,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535351427] [2020-01-16 19:08:51,616 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:51,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:51,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:51,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:51,617 INFO L87 Difference]: Start difference. First operand 375 states and 1286 transitions. Second operand 9 states. [2020-01-16 19:08:51,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:51,748 INFO L93 Difference]: Finished difference Result 562 states and 1658 transitions. [2020-01-16 19:08:51,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:51,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:51,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:51,750 INFO L225 Difference]: With dead ends: 562 [2020-01-16 19:08:51,750 INFO L226 Difference]: Without dead ends: 551 [2020-01-16 19:08:51,750 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:51,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-01-16 19:08:51,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 377. [2020-01-16 19:08:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:08:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1290 transitions. [2020-01-16 19:08:51,758 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1290 transitions. Word has length 22 [2020-01-16 19:08:51,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:51,758 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1290 transitions. [2020-01-16 19:08:51,758 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1290 transitions. [2020-01-16 19:08:51,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:51,759 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:51,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, 1, 1, 1] [2020-01-16 19:08:51,759 INFO L426 AbstractCegarLoop]: === Iteration 1490 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:51,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:51,759 INFO L82 PathProgramCache]: Analyzing trace with hash 921333996, now seen corresponding path program 1484 times [2020-01-16 19:08:51,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:51,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545400645] [2020-01-16 19:08:51,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:52,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-01-16 19:08:52,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545400645] [2020-01-16 19:08:52,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:52,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:52,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682781986] [2020-01-16 19:08:52,043 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:52,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:52,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:52,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:52,044 INFO L87 Difference]: Start difference. First operand 377 states and 1290 transitions. Second operand 9 states. [2020-01-16 19:08:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:52,157 INFO L93 Difference]: Finished difference Result 560 states and 1653 transitions. [2020-01-16 19:08:52,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:52,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:52,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:52,159 INFO L225 Difference]: With dead ends: 560 [2020-01-16 19:08:52,159 INFO L226 Difference]: Without dead ends: 550 [2020-01-16 19:08:52,159 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-01-16 19:08:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 376. [2020-01-16 19:08:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:08:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1288 transitions. [2020-01-16 19:08:52,167 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1288 transitions. Word has length 22 [2020-01-16 19:08:52,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:52,167 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1288 transitions. [2020-01-16 19:08:52,167 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1288 transitions. [2020-01-16 19:08:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:52,168 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:52,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, 1, 1, 1] [2020-01-16 19:08:52,168 INFO L426 AbstractCegarLoop]: === Iteration 1491 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:52,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:52,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1779105684, now seen corresponding path program 1485 times [2020-01-16 19:08:52,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:52,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260280584] [2020-01-16 19:08:52,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:52,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-01-16 19:08:52,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260280584] [2020-01-16 19:08:52,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:52,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:52,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802197836] [2020-01-16 19:08:52,460 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:52,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:52,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:52,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:52,461 INFO L87 Difference]: Start difference. First operand 376 states and 1288 transitions. Second operand 9 states. [2020-01-16 19:08:52,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:52,576 INFO L93 Difference]: Finished difference Result 567 states and 1669 transitions. [2020-01-16 19:08:52,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:52,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:52,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:52,577 INFO L225 Difference]: With dead ends: 567 [2020-01-16 19:08:52,577 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:08:52,578 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:52,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:08:52,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 379. [2020-01-16 19:08:52,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1293 transitions. [2020-01-16 19:08:52,586 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1293 transitions. Word has length 22 [2020-01-16 19:08:52,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:52,586 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1293 transitions. [2020-01-16 19:08:52,586 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:52,586 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1293 transitions. [2020-01-16 19:08:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:52,587 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:52,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, 1, 1, 1] [2020-01-16 19:08:52,587 INFO L426 AbstractCegarLoop]: === Iteration 1492 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:52,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:52,587 INFO L82 PathProgramCache]: Analyzing trace with hash 2081123628, now seen corresponding path program 1486 times [2020-01-16 19:08:52,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:52,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836464827] [2020-01-16 19:08:52,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:52,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:52,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836464827] [2020-01-16 19:08:52,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:52,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:52,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676507965] [2020-01-16 19:08:52,866 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:52,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:52,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:52,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:52,866 INFO L87 Difference]: Start difference. First operand 379 states and 1293 transitions. Second operand 9 states. [2020-01-16 19:08:53,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:53,001 INFO L93 Difference]: Finished difference Result 568 states and 1668 transitions. [2020-01-16 19:08:53,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:53,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:53,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:53,002 INFO L225 Difference]: With dead ends: 568 [2020-01-16 19:08:53,003 INFO L226 Difference]: Without dead ends: 553 [2020-01-16 19:08:53,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-01-16 19:08:53,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 376. [2020-01-16 19:08:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:08:53,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1287 transitions. [2020-01-16 19:08:53,011 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1287 transitions. Word has length 22 [2020-01-16 19:08:53,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:53,011 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1287 transitions. [2020-01-16 19:08:53,011 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1287 transitions. [2020-01-16 19:08:53,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:53,012 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:53,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, 1, 1, 1] [2020-01-16 19:08:53,012 INFO L426 AbstractCegarLoop]: === Iteration 1493 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:53,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:53,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1266849180, now seen corresponding path program 1487 times [2020-01-16 19:08:53,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:53,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326375865] [2020-01-16 19:08:53,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:53,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-01-16 19:08:53,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326375865] [2020-01-16 19:08:53,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:53,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:53,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469187657] [2020-01-16 19:08:53,296 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:53,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:53,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:53,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:53,296 INFO L87 Difference]: Start difference. First operand 376 states and 1287 transitions. Second operand 9 states. [2020-01-16 19:08:53,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:53,407 INFO L93 Difference]: Finished difference Result 561 states and 1654 transitions. [2020-01-16 19:08:53,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:53,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:53,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:53,409 INFO L225 Difference]: With dead ends: 561 [2020-01-16 19:08:53,409 INFO L226 Difference]: Without dead ends: 552 [2020-01-16 19:08:53,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:53,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-01-16 19:08:53,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 377. [2020-01-16 19:08:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:08:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1288 transitions. [2020-01-16 19:08:53,417 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1288 transitions. Word has length 22 [2020-01-16 19:08:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:53,417 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1288 transitions. [2020-01-16 19:08:53,417 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1288 transitions. [2020-01-16 19:08:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:53,418 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:53,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, 1, 1, 1] [2020-01-16 19:08:53,418 INFO L426 AbstractCegarLoop]: === Iteration 1494 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:53,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:53,418 INFO L82 PathProgramCache]: Analyzing trace with hash -731619378, now seen corresponding path program 1488 times [2020-01-16 19:08:53,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:53,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595768209] [2020-01-16 19:08:53,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:53,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:53,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595768209] [2020-01-16 19:08:53,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:53,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:53,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133297786] [2020-01-16 19:08:53,700 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:53,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:53,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:53,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:53,701 INFO L87 Difference]: Start difference. First operand 377 states and 1288 transitions. Second operand 9 states. [2020-01-16 19:08:53,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:53,838 INFO L93 Difference]: Finished difference Result 564 states and 1659 transitions. [2020-01-16 19:08:53,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:53,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:53,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:53,840 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:08:53,840 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:08:53,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:53,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:08:53,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 373. [2020-01-16 19:08:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:08:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1282 transitions. [2020-01-16 19:08:53,849 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1282 transitions. Word has length 22 [2020-01-16 19:08:53,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:53,849 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1282 transitions. [2020-01-16 19:08:53,849 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1282 transitions. [2020-01-16 19:08:53,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:53,850 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:53,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, 1, 1, 1] [2020-01-16 19:08:53,850 INFO L426 AbstractCegarLoop]: === Iteration 1495 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:53,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:53,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1828175184, now seen corresponding path program 1489 times [2020-01-16 19:08:53,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:53,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539036246] [2020-01-16 19:08:53,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:54,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-01-16 19:08:54,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539036246] [2020-01-16 19:08:54,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:54,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:54,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390664372] [2020-01-16 19:08:54,134 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:54,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:54,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:54,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:54,135 INFO L87 Difference]: Start difference. First operand 373 states and 1282 transitions. Second operand 9 states. [2020-01-16 19:08:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:54,218 INFO L93 Difference]: Finished difference Result 596 states and 1746 transitions. [2020-01-16 19:08:54,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:54,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:54,220 INFO L225 Difference]: With dead ends: 596 [2020-01-16 19:08:54,220 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:08:54,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:54,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:08:54,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 383. [2020-01-16 19:08:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:08:54,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1311 transitions. [2020-01-16 19:08:54,229 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1311 transitions. Word has length 22 [2020-01-16 19:08:54,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:54,230 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1311 transitions. [2020-01-16 19:08:54,230 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1311 transitions. [2020-01-16 19:08:54,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:54,230 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:54,230 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:54,230 INFO L426 AbstractCegarLoop]: === Iteration 1496 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:54,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:54,231 INFO L82 PathProgramCache]: Analyzing trace with hash -237909298, now seen corresponding path program 1490 times [2020-01-16 19:08:54,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:54,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986460812] [2020-01-16 19:08:54,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:54,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986460812] [2020-01-16 19:08:54,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:54,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:54,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903547448] [2020-01-16 19:08:54,512 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:54,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:54,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:54,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:54,513 INFO L87 Difference]: Start difference. First operand 383 states and 1311 transitions. Second operand 9 states. [2020-01-16 19:08:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:54,647 INFO L93 Difference]: Finished difference Result 591 states and 1733 transitions. [2020-01-16 19:08:54,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:54,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:54,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:54,649 INFO L225 Difference]: With dead ends: 591 [2020-01-16 19:08:54,649 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:08:54,650 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:54,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:08:54,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 379. [2020-01-16 19:08:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:54,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1302 transitions. [2020-01-16 19:08:54,659 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1302 transitions. Word has length 22 [2020-01-16 19:08:54,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:54,659 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1302 transitions. [2020-01-16 19:08:54,659 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1302 transitions. [2020-01-16 19:08:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:54,659 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:54,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:54,660 INFO L426 AbstractCegarLoop]: === Iteration 1497 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:54,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:54,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1727263012, now seen corresponding path program 1491 times [2020-01-16 19:08:54,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:54,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665206600] [2020-01-16 19:08:54,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:54,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665206600] [2020-01-16 19:08:54,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:54,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:54,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173776418] [2020-01-16 19:08:54,938 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:54,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:54,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:54,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:54,938 INFO L87 Difference]: Start difference. First operand 379 states and 1302 transitions. Second operand 9 states. [2020-01-16 19:08:55,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:55,044 INFO L93 Difference]: Finished difference Result 594 states and 1738 transitions. [2020-01-16 19:08:55,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:55,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:55,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:55,046 INFO L225 Difference]: With dead ends: 594 [2020-01-16 19:08:55,046 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:08:55,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:08:55,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 382. [2020-01-16 19:08:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:08:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1306 transitions. [2020-01-16 19:08:55,054 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1306 transitions. Word has length 22 [2020-01-16 19:08:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:55,054 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1306 transitions. [2020-01-16 19:08:55,054 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:55,054 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1306 transitions. [2020-01-16 19:08:55,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:55,055 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:55,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, 1, 1, 1] [2020-01-16 19:08:55,055 INFO L426 AbstractCegarLoop]: === Iteration 1498 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:55,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:55,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1600626638, now seen corresponding path program 1492 times [2020-01-16 19:08:55,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:55,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804063753] [2020-01-16 19:08:55,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:55,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:55,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804063753] [2020-01-16 19:08:55,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:55,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:55,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738616480] [2020-01-16 19:08:55,342 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:55,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:55,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:55,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:55,342 INFO L87 Difference]: Start difference. First operand 382 states and 1306 transitions. Second operand 9 states. [2020-01-16 19:08:55,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:55,473 INFO L93 Difference]: Finished difference Result 588 states and 1724 transitions. [2020-01-16 19:08:55,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:55,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:55,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:55,475 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:08:55,475 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:08:55,476 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:55,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:08:55,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 379. [2020-01-16 19:08:55,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1299 transitions. [2020-01-16 19:08:55,484 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1299 transitions. Word has length 22 [2020-01-16 19:08:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:55,484 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1299 transitions. [2020-01-16 19:08:55,484 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1299 transitions. [2020-01-16 19:08:55,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:55,485 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:55,485 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:55,485 INFO L426 AbstractCegarLoop]: === Iteration 1499 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:55,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:55,485 INFO L82 PathProgramCache]: Analyzing trace with hash 279322490, now seen corresponding path program 1493 times [2020-01-16 19:08:55,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:55,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953977414] [2020-01-16 19:08:55,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:55,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:55,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953977414] [2020-01-16 19:08:55,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:55,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:55,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709779518] [2020-01-16 19:08:55,764 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:55,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:55,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:55,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:55,764 INFO L87 Difference]: Start difference. First operand 379 states and 1299 transitions. Second operand 9 states. [2020-01-16 19:08:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:55,891 INFO L93 Difference]: Finished difference Result 583 states and 1715 transitions. [2020-01-16 19:08:55,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:55,891 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:55,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:55,893 INFO L225 Difference]: With dead ends: 583 [2020-01-16 19:08:55,893 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:08:55,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:08:55,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 381. [2020-01-16 19:08:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:08:55,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1302 transitions. [2020-01-16 19:08:55,901 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1302 transitions. Word has length 22 [2020-01-16 19:08:55,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:55,901 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1302 transitions. [2020-01-16 19:08:55,901 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:55,901 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1302 transitions. [2020-01-16 19:08:55,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:55,902 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:55,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, 1, 1, 1] [2020-01-16 19:08:55,902 INFO L426 AbstractCegarLoop]: === Iteration 1500 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:55,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:55,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1621255278, now seen corresponding path program 1494 times [2020-01-16 19:08:55,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:55,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024798852] [2020-01-16 19:08:55,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:56,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-01-16 19:08:56,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024798852] [2020-01-16 19:08:56,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:56,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:56,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792074960] [2020-01-16 19:08:56,181 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:56,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:56,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:56,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:56,181 INFO L87 Difference]: Start difference. First operand 381 states and 1302 transitions. Second operand 9 states. [2020-01-16 19:08:56,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:56,293 INFO L93 Difference]: Finished difference Result 582 states and 1711 transitions. [2020-01-16 19:08:56,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:56,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:56,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:56,295 INFO L225 Difference]: With dead ends: 582 [2020-01-16 19:08:56,295 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 19:08:56,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:56,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 19:08:56,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 376. [2020-01-16 19:08:56,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:08:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1292 transitions. [2020-01-16 19:08:56,304 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1292 transitions. Word has length 22 [2020-01-16 19:08:56,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:56,304 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1292 transitions. [2020-01-16 19:08:56,304 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:56,304 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1292 transitions. [2020-01-16 19:08:56,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:56,305 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:56,305 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:56,305 INFO L426 AbstractCegarLoop]: === Iteration 1501 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:56,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:56,305 INFO L82 PathProgramCache]: Analyzing trace with hash 706739172, now seen corresponding path program 1495 times [2020-01-16 19:08:56,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:56,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2940197] [2020-01-16 19:08:56,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:56,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-01-16 19:08:56,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2940197] [2020-01-16 19:08:56,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:56,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:56,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349161797] [2020-01-16 19:08:56,590 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:56,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:56,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:56,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:56,591 INFO L87 Difference]: Start difference. First operand 376 states and 1292 transitions. Second operand 9 states. [2020-01-16 19:08:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:56,672 INFO L93 Difference]: Finished difference Result 602 states and 1760 transitions. [2020-01-16 19:08:56,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:56,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:56,674 INFO L225 Difference]: With dead ends: 602 [2020-01-16 19:08:56,674 INFO L226 Difference]: Without dead ends: 586 [2020-01-16 19:08:56,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:56,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-01-16 19:08:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 384. [2020-01-16 19:08:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:08:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1312 transitions. [2020-01-16 19:08:56,684 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1312 transitions. Word has length 22 [2020-01-16 19:08:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:56,684 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1312 transitions. [2020-01-16 19:08:56,684 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:56,684 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1312 transitions. [2020-01-16 19:08:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:56,684 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:56,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, 1, 1, 1] [2020-01-16 19:08:56,685 INFO L426 AbstractCegarLoop]: === Iteration 1502 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:56,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:56,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1997962238, now seen corresponding path program 1496 times [2020-01-16 19:08:56,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:56,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106630685] [2020-01-16 19:08:56,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:56,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106630685] [2020-01-16 19:08:56,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:56,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:56,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229026517] [2020-01-16 19:08:56,979 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:56,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:56,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:56,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:56,980 INFO L87 Difference]: Start difference. First operand 384 states and 1312 transitions. Second operand 9 states. [2020-01-16 19:08:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:57,076 INFO L93 Difference]: Finished difference Result 597 states and 1747 transitions. [2020-01-16 19:08:57,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:57,076 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:57,078 INFO L225 Difference]: With dead ends: 597 [2020-01-16 19:08:57,078 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 19:08:57,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:57,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 19:08:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 380. [2020-01-16 19:08:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:57,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1302 transitions. [2020-01-16 19:08:57,086 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1302 transitions. Word has length 22 [2020-01-16 19:08:57,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:57,087 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1302 transitions. [2020-01-16 19:08:57,087 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:57,087 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1302 transitions. [2020-01-16 19:08:57,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:57,087 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:57,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, 1, 1, 1] [2020-01-16 19:08:57,087 INFO L426 AbstractCegarLoop]: === Iteration 1503 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:57,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:57,088 INFO L82 PathProgramCache]: Analyzing trace with hash -641937580, now seen corresponding path program 1497 times [2020-01-16 19:08:57,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:57,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278061287] [2020-01-16 19:08:57,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:57,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-01-16 19:08:57,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278061287] [2020-01-16 19:08:57,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:57,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:57,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465489453] [2020-01-16 19:08:57,374 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:57,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:57,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:57,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:57,374 INFO L87 Difference]: Start difference. First operand 380 states and 1302 transitions. Second operand 9 states. [2020-01-16 19:08:57,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:57,451 INFO L93 Difference]: Finished difference Result 604 states and 1761 transitions. [2020-01-16 19:08:57,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:57,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:57,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:57,452 INFO L225 Difference]: With dead ends: 604 [2020-01-16 19:08:57,452 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 19:08:57,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:57,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 19:08:57,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 385. [2020-01-16 19:08:57,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:08:57,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1310 transitions. [2020-01-16 19:08:57,462 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1310 transitions. Word has length 22 [2020-01-16 19:08:57,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:57,462 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1310 transitions. [2020-01-16 19:08:57,462 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:57,462 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1310 transitions. [2020-01-16 19:08:57,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:57,462 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:57,462 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:57,463 INFO L426 AbstractCegarLoop]: === Iteration 1504 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:57,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:57,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1951701814, now seen corresponding path program 1498 times [2020-01-16 19:08:57,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:57,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307701373] [2020-01-16 19:08:57,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:57,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:57,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307701373] [2020-01-16 19:08:57,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:57,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:57,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102573700] [2020-01-16 19:08:57,747 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:57,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:57,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:57,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:57,747 INFO L87 Difference]: Start difference. First operand 385 states and 1310 transitions. Second operand 9 states. [2020-01-16 19:08:57,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:57,848 INFO L93 Difference]: Finished difference Result 600 states and 1749 transitions. [2020-01-16 19:08:57,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:57,848 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:57,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:57,850 INFO L225 Difference]: With dead ends: 600 [2020-01-16 19:08:57,850 INFO L226 Difference]: Without dead ends: 583 [2020-01-16 19:08:57,850 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-01-16 19:08:57,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 380. [2020-01-16 19:08:57,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:08:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1298 transitions. [2020-01-16 19:08:57,858 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1298 transitions. Word has length 22 [2020-01-16 19:08:57,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:57,858 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1298 transitions. [2020-01-16 19:08:57,858 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1298 transitions. [2020-01-16 19:08:57,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:57,859 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:57,859 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:57,859 INFO L426 AbstractCegarLoop]: === Iteration 1505 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:57,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:57,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1857233994, now seen corresponding path program 1499 times [2020-01-16 19:08:57,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:57,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811309610] [2020-01-16 19:08:57,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:58,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-01-16 19:08:58,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811309610] [2020-01-16 19:08:58,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:58,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:58,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348858594] [2020-01-16 19:08:58,141 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:58,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:58,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:58,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:58,142 INFO L87 Difference]: Start difference. First operand 380 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:08:58,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:58,245 INFO L93 Difference]: Finished difference Result 592 states and 1734 transitions. [2020-01-16 19:08:58,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:58,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:58,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:58,246 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:08:58,246 INFO L226 Difference]: Without dead ends: 581 [2020-01-16 19:08:58,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:58,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-01-16 19:08:58,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 383. [2020-01-16 19:08:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:08:58,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1303 transitions. [2020-01-16 19:08:58,256 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1303 transitions. Word has length 22 [2020-01-16 19:08:58,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:58,256 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1303 transitions. [2020-01-16 19:08:58,256 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:58,256 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1303 transitions. [2020-01-16 19:08:58,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:58,257 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:58,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, 1, 1, 1] [2020-01-16 19:08:58,257 INFO L426 AbstractCegarLoop]: === Iteration 1506 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:58,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:58,257 INFO L82 PathProgramCache]: Analyzing trace with hash -983493314, now seen corresponding path program 1500 times [2020-01-16 19:08:58,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:58,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976151428] [2020-01-16 19:08:58,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:58,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-01-16 19:08:58,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976151428] [2020-01-16 19:08:58,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:58,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:58,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881972446] [2020-01-16 19:08:58,539 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:58,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:58,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:58,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:58,539 INFO L87 Difference]: Start difference. First operand 383 states and 1303 transitions. Second operand 9 states. [2020-01-16 19:08:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:58,640 INFO L93 Difference]: Finished difference Result 593 states and 1733 transitions. [2020-01-16 19:08:58,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:58,641 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:58,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:58,642 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:08:58,642 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:08:58,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:58,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:08:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 376. [2020-01-16 19:08:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:08:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1289 transitions. [2020-01-16 19:08:58,651 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1289 transitions. Word has length 22 [2020-01-16 19:08:58,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:58,651 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1289 transitions. [2020-01-16 19:08:58,652 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:58,652 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1289 transitions. [2020-01-16 19:08:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:58,652 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:58,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, 1, 1, 1] [2020-01-16 19:08:58,652 INFO L426 AbstractCegarLoop]: === Iteration 1507 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:58,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:58,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1969222452, now seen corresponding path program 1501 times [2020-01-16 19:08:58,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:58,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803278678] [2020-01-16 19:08:58,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:58,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803278678] [2020-01-16 19:08:58,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:58,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:58,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171703046] [2020-01-16 19:08:58,934 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:58,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:58,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:58,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:58,934 INFO L87 Difference]: Start difference. First operand 376 states and 1289 transitions. Second operand 9 states. [2020-01-16 19:08:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:59,015 INFO L93 Difference]: Finished difference Result 596 states and 1740 transitions. [2020-01-16 19:08:59,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:59,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:59,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:59,017 INFO L225 Difference]: With dead ends: 596 [2020-01-16 19:08:59,017 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:08:59,017 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:59,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:08:59,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 382. [2020-01-16 19:08:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:08:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1303 transitions. [2020-01-16 19:08:59,027 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1303 transitions. Word has length 22 [2020-01-16 19:08:59,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:59,027 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1303 transitions. [2020-01-16 19:08:59,027 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1303 transitions. [2020-01-16 19:08:59,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:59,027 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:59,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, 1, 1, 1] [2020-01-16 19:08:59,028 INFO L426 AbstractCegarLoop]: === Iteration 1508 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:59,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:59,028 INFO L82 PathProgramCache]: Analyzing trace with hash 2095858826, now seen corresponding path program 1502 times [2020-01-16 19:08:59,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:59,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046705598] [2020-01-16 19:08:59,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:59,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046705598] [2020-01-16 19:08:59,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:59,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:59,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866940174] [2020-01-16 19:08:59,305 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:59,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:59,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:59,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:59,306 INFO L87 Difference]: Start difference. First operand 382 states and 1303 transitions. Second operand 9 states. [2020-01-16 19:08:59,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:59,407 INFO L93 Difference]: Finished difference Result 590 states and 1726 transitions. [2020-01-16 19:08:59,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:59,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:59,409 INFO L225 Difference]: With dead ends: 590 [2020-01-16 19:08:59,409 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:08:59,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:08:59,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 379. [2020-01-16 19:08:59,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:08:59,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1296 transitions. [2020-01-16 19:08:59,419 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1296 transitions. Word has length 22 [2020-01-16 19:08:59,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:59,419 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1296 transitions. [2020-01-16 19:08:59,419 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:59,419 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1296 transitions. [2020-01-16 19:08:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:59,419 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:59,419 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:59,420 INFO L426 AbstractCegarLoop]: === Iteration 1509 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:59,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:59,420 INFO L82 PathProgramCache]: Analyzing trace with hash 893511296, now seen corresponding path program 1503 times [2020-01-16 19:08:59,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:59,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104783748] [2020-01-16 19:08:59,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:08:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:08:59,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104783748] [2020-01-16 19:08:59,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:08:59,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:08:59,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8030549] [2020-01-16 19:08:59,701 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:08:59,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:08:59,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:08:59,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:08:59,701 INFO L87 Difference]: Start difference. First operand 379 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:08:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:08:59,782 INFO L93 Difference]: Finished difference Result 600 states and 1747 transitions. [2020-01-16 19:08:59,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:08:59,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:08:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:08:59,784 INFO L225 Difference]: With dead ends: 600 [2020-01-16 19:08:59,784 INFO L226 Difference]: Without dead ends: 584 [2020-01-16 19:08:59,784 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:08:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-01-16 19:08:59,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 384. [2020-01-16 19:08:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:08:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1304 transitions. [2020-01-16 19:08:59,792 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1304 transitions. Word has length 22 [2020-01-16 19:08:59,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:08:59,793 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1304 transitions. [2020-01-16 19:08:59,793 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:08:59,793 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1304 transitions. [2020-01-16 19:08:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:08:59,793 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:08:59,793 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:08:59,793 INFO L426 AbstractCegarLoop]: === Iteration 1510 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:08:59,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:08:59,794 INFO L82 PathProgramCache]: Analyzing trace with hash 785011850, now seen corresponding path program 1504 times [2020-01-16 19:08:59,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:08:59,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883335038] [2020-01-16 19:08:59,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:08:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:00,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883335038] [2020-01-16 19:09:00,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:00,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:00,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339495476] [2020-01-16 19:09:00,070 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:00,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:00,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:00,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:00,071 INFO L87 Difference]: Start difference. First operand 384 states and 1304 transitions. Second operand 9 states. [2020-01-16 19:09:00,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:00,170 INFO L93 Difference]: Finished difference Result 596 states and 1735 transitions. [2020-01-16 19:09:00,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:00,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:00,172 INFO L225 Difference]: With dead ends: 596 [2020-01-16 19:09:00,172 INFO L226 Difference]: Without dead ends: 579 [2020-01-16 19:09:00,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:00,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-01-16 19:09:00,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 379. [2020-01-16 19:09:00,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:09:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1293 transitions. [2020-01-16 19:09:00,181 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1293 transitions. Word has length 22 [2020-01-16 19:09:00,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:00,181 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1293 transitions. [2020-01-16 19:09:00,181 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1293 transitions. [2020-01-16 19:09:00,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:00,182 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:00,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, 1, 1, 1] [2020-01-16 19:09:00,182 INFO L426 AbstractCegarLoop]: === Iteration 1511 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:00,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:00,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1126023090, now seen corresponding path program 1505 times [2020-01-16 19:09:00,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:00,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517877613] [2020-01-16 19:09:00,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:00,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-01-16 19:09:00,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517877613] [2020-01-16 19:09:00,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:00,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:00,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167095011] [2020-01-16 19:09:00,460 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:00,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:00,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:00,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:00,460 INFO L87 Difference]: Start difference. First operand 379 states and 1293 transitions. Second operand 9 states. [2020-01-16 19:09:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:00,561 INFO L93 Difference]: Finished difference Result 585 states and 1714 transitions. [2020-01-16 19:09:00,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:00,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:00,563 INFO L225 Difference]: With dead ends: 585 [2020-01-16 19:09:00,563 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:09:00,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:00,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:09:00,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 381. [2020-01-16 19:09:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:09:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1296 transitions. [2020-01-16 19:09:00,572 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1296 transitions. Word has length 22 [2020-01-16 19:09:00,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:00,572 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1296 transitions. [2020-01-16 19:09:00,572 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:00,572 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1296 transitions. [2020-01-16 19:09:00,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:00,572 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:00,572 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:00,572 INFO L426 AbstractCegarLoop]: === Iteration 1512 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:00,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:00,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1299270782, now seen corresponding path program 1506 times [2020-01-16 19:09:00,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:00,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061779412] [2020-01-16 19:09:00,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:00,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:00,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061779412] [2020-01-16 19:09:00,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:00,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:00,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014069834] [2020-01-16 19:09:00,850 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:00,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:00,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:00,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:00,850 INFO L87 Difference]: Start difference. First operand 381 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:09:00,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:00,953 INFO L93 Difference]: Finished difference Result 587 states and 1716 transitions. [2020-01-16 19:09:00,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:00,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:00,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:00,955 INFO L225 Difference]: With dead ends: 587 [2020-01-16 19:09:00,955 INFO L226 Difference]: Without dead ends: 570 [2020-01-16 19:09:00,955 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:00,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-01-16 19:09:00,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 376. [2020-01-16 19:09:00,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:09:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1286 transitions. [2020-01-16 19:09:00,964 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1286 transitions. Word has length 22 [2020-01-16 19:09:00,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:00,964 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1286 transitions. [2020-01-16 19:09:00,964 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1286 transitions. [2020-01-16 19:09:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:00,965 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:00,965 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:00,965 INFO L426 AbstractCegarLoop]: === Iteration 1513 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:00,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:00,965 INFO L82 PathProgramCache]: Analyzing trace with hash 774932246, now seen corresponding path program 1507 times [2020-01-16 19:09:00,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:00,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116310807] [2020-01-16 19:09:00,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:01,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116310807] [2020-01-16 19:09:01,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:01,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:01,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824863034] [2020-01-16 19:09:01,252 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:01,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:01,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:01,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:01,253 INFO L87 Difference]: Start difference. First operand 376 states and 1286 transitions. Second operand 9 states. [2020-01-16 19:09:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:01,351 INFO L93 Difference]: Finished difference Result 576 states and 1698 transitions. [2020-01-16 19:09:01,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:01,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:01,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:01,353 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:09:01,353 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:09:01,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:01,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:09:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 380. [2020-01-16 19:09:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:09:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1296 transitions. [2020-01-16 19:09:01,363 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1296 transitions. Word has length 22 [2020-01-16 19:09:01,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:01,363 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1296 transitions. [2020-01-16 19:09:01,363 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:01,363 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1296 transitions. [2020-01-16 19:09:01,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:01,363 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:01,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:01,364 INFO L426 AbstractCegarLoop]: === Iteration 1514 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:01,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:01,364 INFO L82 PathProgramCache]: Analyzing trace with hash 2116865034, now seen corresponding path program 1508 times [2020-01-16 19:09:01,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:01,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843696863] [2020-01-16 19:09:01,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:01,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-01-16 19:09:01,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843696863] [2020-01-16 19:09:01,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:01,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:01,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405257534] [2020-01-16 19:09:01,644 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:01,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:01,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:01,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:01,644 INFO L87 Difference]: Start difference. First operand 380 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:09:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:01,751 INFO L93 Difference]: Finished difference Result 575 states and 1694 transitions. [2020-01-16 19:09:01,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:01,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:01,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:01,753 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:09:01,753 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:09:01,753 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:01,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:09:01,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 378. [2020-01-16 19:09:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:09:01,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1291 transitions. [2020-01-16 19:09:01,762 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1291 transitions. Word has length 22 [2020-01-16 19:09:01,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:01,762 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1291 transitions. [2020-01-16 19:09:01,762 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:01,762 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1291 transitions. [2020-01-16 19:09:01,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:01,762 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:01,763 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:01,763 INFO L426 AbstractCegarLoop]: === Iteration 1515 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:01,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:01,763 INFO L82 PathProgramCache]: Analyzing trace with hash -300778910, now seen corresponding path program 1509 times [2020-01-16 19:09:01,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:01,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443695138] [2020-01-16 19:09:01,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:02,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-01-16 19:09:02,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443695138] [2020-01-16 19:09:02,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:02,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:02,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009834177] [2020-01-16 19:09:02,045 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:02,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:02,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:02,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:02,046 INFO L87 Difference]: Start difference. First operand 378 states and 1291 transitions. Second operand 9 states. [2020-01-16 19:09:02,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:02,146 INFO L93 Difference]: Finished difference Result 579 states and 1703 transitions. [2020-01-16 19:09:02,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:02,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:02,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:02,147 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:09:02,148 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:09:02,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:02,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:09:02,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 381. [2020-01-16 19:09:02,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:09:02,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1296 transitions. [2020-01-16 19:09:02,157 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1296 transitions. Word has length 22 [2020-01-16 19:09:02,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:02,157 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1296 transitions. [2020-01-16 19:09:02,157 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:02,157 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1296 transitions. [2020-01-16 19:09:02,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:02,157 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:02,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, 1, 1, 1] [2020-01-16 19:09:02,157 INFO L426 AbstractCegarLoop]: === Iteration 1516 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:02,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:02,158 INFO L82 PathProgramCache]: Analyzing trace with hash -2129177070, now seen corresponding path program 1510 times [2020-01-16 19:09:02,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:02,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286168221] [2020-01-16 19:09:02,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:02,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-01-16 19:09:02,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286168221] [2020-01-16 19:09:02,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:02,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:02,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710961628] [2020-01-16 19:09:02,437 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:02,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:02,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:02,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:02,437 INFO L87 Difference]: Start difference. First operand 381 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:09:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:02,539 INFO L93 Difference]: Finished difference Result 580 states and 1702 transitions. [2020-01-16 19:09:02,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:02,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:02,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:02,541 INFO L225 Difference]: With dead ends: 580 [2020-01-16 19:09:02,541 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:09:02,541 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:02,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:09:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 378. [2020-01-16 19:09:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:09:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1289 transitions. [2020-01-16 19:09:02,551 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1289 transitions. Word has length 22 [2020-01-16 19:09:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:02,551 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1289 transitions. [2020-01-16 19:09:02,551 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1289 transitions. [2020-01-16 19:09:02,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:02,552 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:02,552 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:02,552 INFO L426 AbstractCegarLoop]: === Iteration 1517 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:02,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:02,552 INFO L82 PathProgramCache]: Analyzing trace with hash -31931502, now seen corresponding path program 1511 times [2020-01-16 19:09:02,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:02,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192394951] [2020-01-16 19:09:02,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:02,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192394951] [2020-01-16 19:09:02,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:02,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:02,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005228379] [2020-01-16 19:09:02,832 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:02,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:02,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:02,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:02,833 INFO L87 Difference]: Start difference. First operand 378 states and 1289 transitions. Second operand 9 states. [2020-01-16 19:09:02,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:02,928 INFO L93 Difference]: Finished difference Result 576 states and 1694 transitions. [2020-01-16 19:09:02,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:02,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:02,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:02,930 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:09:02,930 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:09:02,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:02,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:09:02,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 380. [2020-01-16 19:09:02,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:09:02,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1292 transitions. [2020-01-16 19:09:02,939 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1292 transitions. Word has length 22 [2020-01-16 19:09:02,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:02,939 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1292 transitions. [2020-01-16 19:09:02,939 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:02,939 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1292 transitions. [2020-01-16 19:09:02,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:02,940 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:02,940 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:02,940 INFO L426 AbstractCegarLoop]: === Iteration 1518 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:02,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:02,940 INFO L82 PathProgramCache]: Analyzing trace with hash -205179194, now seen corresponding path program 1512 times [2020-01-16 19:09:02,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:02,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075902890] [2020-01-16 19:09:02,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:03,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-01-16 19:09:03,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075902890] [2020-01-16 19:09:03,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:03,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:03,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627216323] [2020-01-16 19:09:03,219 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:03,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:03,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:03,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:03,220 INFO L87 Difference]: Start difference. First operand 380 states and 1292 transitions. Second operand 9 states. [2020-01-16 19:09:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:03,327 INFO L93 Difference]: Finished difference Result 578 states and 1696 transitions. [2020-01-16 19:09:03,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:03,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:03,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:03,329 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:09:03,329 INFO L226 Difference]: Without dead ends: 559 [2020-01-16 19:09:03,329 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:03,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-01-16 19:09:03,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 373. [2020-01-16 19:09:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:03,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1280 transitions. [2020-01-16 19:09:03,338 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1280 transitions. Word has length 22 [2020-01-16 19:09:03,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:03,338 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1280 transitions. [2020-01-16 19:09:03,338 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1280 transitions. [2020-01-16 19:09:03,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:03,339 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:03,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:03,339 INFO L426 AbstractCegarLoop]: === Iteration 1519 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:03,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:03,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2099117908, now seen corresponding path program 1513 times [2020-01-16 19:09:03,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:03,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376513439] [2020-01-16 19:09:03,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:03,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-01-16 19:09:03,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376513439] [2020-01-16 19:09:03,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:03,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:03,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533572744] [2020-01-16 19:09:03,640 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:03,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:03,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:03,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:03,640 INFO L87 Difference]: Start difference. First operand 373 states and 1280 transitions. Second operand 9 states. [2020-01-16 19:09:03,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:03,718 INFO L93 Difference]: Finished difference Result 574 states and 1677 transitions. [2020-01-16 19:09:03,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:03,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:03,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:03,720 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:09:03,720 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:09:03,720 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:03,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:09:03,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 379. [2020-01-16 19:09:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:09:03,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1296 transitions. [2020-01-16 19:09:03,729 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1296 transitions. Word has length 22 [2020-01-16 19:09:03,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:03,730 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1296 transitions. [2020-01-16 19:09:03,730 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:03,730 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1296 transitions. [2020-01-16 19:09:03,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:03,730 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:03,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, 1, 1, 1] [2020-01-16 19:09:03,730 INFO L426 AbstractCegarLoop]: === Iteration 1520 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:03,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:03,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1634780896, now seen corresponding path program 1514 times [2020-01-16 19:09:03,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:03,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297463020] [2020-01-16 19:09:03,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:04,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:04,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297463020] [2020-01-16 19:09:04,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:04,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:04,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725889091] [2020-01-16 19:09:04,010 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:04,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:04,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:04,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:04,010 INFO L87 Difference]: Start difference. First operand 379 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:09:04,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:04,086 INFO L93 Difference]: Finished difference Result 567 states and 1662 transitions. [2020-01-16 19:09:04,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:04,087 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:04,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:04,088 INFO L225 Difference]: With dead ends: 567 [2020-01-16 19:09:04,088 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:09:04,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:09:04,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 377. [2020-01-16 19:09:04,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:09:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1292 transitions. [2020-01-16 19:09:04,098 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1292 transitions. Word has length 22 [2020-01-16 19:09:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:04,098 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1292 transitions. [2020-01-16 19:09:04,098 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:04,098 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1292 transitions. [2020-01-16 19:09:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:04,099 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:04,099 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:04,099 INFO L426 AbstractCegarLoop]: === Iteration 1521 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:04,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:04,099 INFO L82 PathProgramCache]: Analyzing trace with hash 498680054, now seen corresponding path program 1515 times [2020-01-16 19:09:04,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:04,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780491184] [2020-01-16 19:09:04,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:04,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780491184] [2020-01-16 19:09:04,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:04,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:04,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977517489] [2020-01-16 19:09:04,376 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:04,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:04,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:04,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:04,376 INFO L87 Difference]: Start difference. First operand 377 states and 1292 transitions. Second operand 9 states. [2020-01-16 19:09:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:04,447 INFO L93 Difference]: Finished difference Result 576 states and 1680 transitions. [2020-01-16 19:09:04,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:04,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:04,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:04,449 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:09:04,449 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:09:04,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:04,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:09:04,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 380. [2020-01-16 19:09:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:09:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1296 transitions. [2020-01-16 19:09:04,458 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1296 transitions. Word has length 22 [2020-01-16 19:09:04,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:04,459 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1296 transitions. [2020-01-16 19:09:04,459 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1296 transitions. [2020-01-16 19:09:04,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:04,459 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:04,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, 1, 1, 1] [2020-01-16 19:09:04,459 INFO L426 AbstractCegarLoop]: === Iteration 1522 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:04,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:04,460 INFO L82 PathProgramCache]: Analyzing trace with hash -463523608, now seen corresponding path program 1516 times [2020-01-16 19:09:04,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:04,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3913359] [2020-01-16 19:09:04,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:04,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3913359] [2020-01-16 19:09:04,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:04,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:04,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108554521] [2020-01-16 19:09:04,729 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:04,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:04,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:04,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:04,730 INFO L87 Difference]: Start difference. First operand 380 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:09:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:04,829 INFO L93 Difference]: Finished difference Result 570 states and 1666 transitions. [2020-01-16 19:09:04,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:04,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:04,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:04,830 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:09:04,831 INFO L226 Difference]: Without dead ends: 557 [2020-01-16 19:09:04,831 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:04,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-01-16 19:09:04,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 377. [2020-01-16 19:09:04,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:09:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1290 transitions. [2020-01-16 19:09:04,839 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1290 transitions. Word has length 22 [2020-01-16 19:09:04,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:04,839 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1290 transitions. [2020-01-16 19:09:04,840 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:04,840 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1290 transitions. [2020-01-16 19:09:04,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:04,840 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:04,840 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:04,840 INFO L426 AbstractCegarLoop]: === Iteration 1523 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:04,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:04,841 INFO L82 PathProgramCache]: Analyzing trace with hash 553402280, now seen corresponding path program 1517 times [2020-01-16 19:09:04,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:04,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867291953] [2020-01-16 19:09:04,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:05,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-01-16 19:09:05,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867291953] [2020-01-16 19:09:05,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:05,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:05,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7413471] [2020-01-16 19:09:05,134 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:05,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:05,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:05,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:05,135 INFO L87 Difference]: Start difference. First operand 377 states and 1290 transitions. Second operand 9 states. [2020-01-16 19:09:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:05,217 INFO L93 Difference]: Finished difference Result 560 states and 1647 transitions. [2020-01-16 19:09:05,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:05,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:05,218 INFO L225 Difference]: With dead ends: 560 [2020-01-16 19:09:05,219 INFO L226 Difference]: Without dead ends: 551 [2020-01-16 19:09:05,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:05,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-01-16 19:09:05,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 378. [2020-01-16 19:09:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:09:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1291 transitions. [2020-01-16 19:09:05,227 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1291 transitions. Word has length 22 [2020-01-16 19:09:05,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:05,227 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1291 transitions. [2020-01-16 19:09:05,227 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1291 transitions. [2020-01-16 19:09:05,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:05,228 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:05,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, 1, 1, 1] [2020-01-16 19:09:05,228 INFO L426 AbstractCegarLoop]: === Iteration 1524 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:05,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:05,228 INFO L82 PathProgramCache]: Analyzing trace with hash -2130624058, now seen corresponding path program 1518 times [2020-01-16 19:09:05,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:05,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899428658] [2020-01-16 19:09:05,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:05,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899428658] [2020-01-16 19:09:05,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:05,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:05,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090908294] [2020-01-16 19:09:05,512 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:05,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:05,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:05,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:05,512 INFO L87 Difference]: Start difference. First operand 378 states and 1291 transitions. Second operand 9 states. [2020-01-16 19:09:05,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:05,625 INFO L93 Difference]: Finished difference Result 561 states and 1648 transitions. [2020-01-16 19:09:05,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:05,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:05,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:05,626 INFO L225 Difference]: With dead ends: 561 [2020-01-16 19:09:05,627 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:09:05,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:05,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:09:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 375. [2020-01-16 19:09:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:05,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1286 transitions. [2020-01-16 19:09:05,635 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1286 transitions. Word has length 22 [2020-01-16 19:09:05,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:05,636 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1286 transitions. [2020-01-16 19:09:05,636 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1286 transitions. [2020-01-16 19:09:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:05,636 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:05,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, 1, 1, 1] [2020-01-16 19:09:05,636 INFO L426 AbstractCegarLoop]: === Iteration 1525 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:05,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:05,636 INFO L82 PathProgramCache]: Analyzing trace with hash -867151968, now seen corresponding path program 1519 times [2020-01-16 19:09:05,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:05,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008530338] [2020-01-16 19:09:05,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:05,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008530338] [2020-01-16 19:09:05,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:05,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:05,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646914619] [2020-01-16 19:09:05,925 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:05,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:05,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:05,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:05,925 INFO L87 Difference]: Start difference. First operand 375 states and 1286 transitions. Second operand 9 states. [2020-01-16 19:09:05,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:05,999 INFO L93 Difference]: Finished difference Result 578 states and 1685 transitions. [2020-01-16 19:09:05,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:05,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:05,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:06,000 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:09:06,001 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:09:06,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:06,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:09:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 379. [2020-01-16 19:09:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:09:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1294 transitions. [2020-01-16 19:09:06,010 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1294 transitions. Word has length 22 [2020-01-16 19:09:06,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:06,010 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1294 transitions. [2020-01-16 19:09:06,010 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:06,010 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1294 transitions. [2020-01-16 19:09:06,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:06,011 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:06,011 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:06,011 INFO L426 AbstractCegarLoop]: === Iteration 1526 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:06,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:06,011 INFO L82 PathProgramCache]: Analyzing trace with hash -306083476, now seen corresponding path program 1520 times [2020-01-16 19:09:06,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:06,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444307798] [2020-01-16 19:09:06,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:06,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444307798] [2020-01-16 19:09:06,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:06,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:06,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202860362] [2020-01-16 19:09:06,292 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:06,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:06,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:06,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:06,292 INFO L87 Difference]: Start difference. First operand 379 states and 1294 transitions. Second operand 9 states. [2020-01-16 19:09:06,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:06,367 INFO L93 Difference]: Finished difference Result 571 states and 1670 transitions. [2020-01-16 19:09:06,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:06,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:06,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:06,368 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:09:06,369 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:09:06,369 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:06,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:09:06,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 377. [2020-01-16 19:09:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:09:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1290 transitions. [2020-01-16 19:09:06,378 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1290 transitions. Word has length 22 [2020-01-16 19:09:06,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:06,378 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1290 transitions. [2020-01-16 19:09:06,378 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1290 transitions. [2020-01-16 19:09:06,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:06,379 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:06,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, 1, 1, 1] [2020-01-16 19:09:06,379 INFO L426 AbstractCegarLoop]: === Iteration 1527 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:06,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:06,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1454897290, now seen corresponding path program 1521 times [2020-01-16 19:09:06,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:06,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995361228] [2020-01-16 19:09:06,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:06,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-01-16 19:09:06,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995361228] [2020-01-16 19:09:06,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:06,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:06,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298446217] [2020-01-16 19:09:06,660 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:06,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:06,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:06,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:06,660 INFO L87 Difference]: Start difference. First operand 377 states and 1290 transitions. Second operand 9 states. [2020-01-16 19:09:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:06,734 INFO L93 Difference]: Finished difference Result 584 states and 1698 transitions. [2020-01-16 19:09:06,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:06,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:06,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:06,736 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:09:06,736 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:09:06,737 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:06,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:09:06,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 382. [2020-01-16 19:09:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:09:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1298 transitions. [2020-01-16 19:09:06,746 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1298 transitions. Word has length 22 [2020-01-16 19:09:06,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:06,746 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1298 transitions. [2020-01-16 19:09:06,746 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:06,746 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1298 transitions. [2020-01-16 19:09:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:06,747 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:06,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, 1, 1, 1] [2020-01-16 19:09:06,747 INFO L426 AbstractCegarLoop]: === Iteration 1528 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:06,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:06,747 INFO L82 PathProgramCache]: Analyzing trace with hash 567019368, now seen corresponding path program 1522 times [2020-01-16 19:09:06,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:06,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254697614] [2020-01-16 19:09:06,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:07,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-01-16 19:09:07,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254697614] [2020-01-16 19:09:07,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:07,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:07,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362961668] [2020-01-16 19:09:07,023 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:07,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:07,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:07,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:07,023 INFO L87 Difference]: Start difference. First operand 382 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:09:07,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:07,122 INFO L93 Difference]: Finished difference Result 580 states and 1686 transitions. [2020-01-16 19:09:07,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:07,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:07,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:07,124 INFO L225 Difference]: With dead ends: 580 [2020-01-16 19:09:07,124 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:09:07,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:07,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:09:07,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 377. [2020-01-16 19:09:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:09:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1288 transitions. [2020-01-16 19:09:07,134 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1288 transitions. Word has length 22 [2020-01-16 19:09:07,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:07,134 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1288 transitions. [2020-01-16 19:09:07,134 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1288 transitions. [2020-01-16 19:09:07,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:07,134 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:07,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, 1, 1, 1] [2020-01-16 19:09:07,135 INFO L426 AbstractCegarLoop]: === Iteration 1529 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:07,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:07,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1400175064, now seen corresponding path program 1523 times [2020-01-16 19:09:07,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:07,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077725729] [2020-01-16 19:09:07,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:07,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077725729] [2020-01-16 19:09:07,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:07,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:07,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230494771] [2020-01-16 19:09:07,419 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:07,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:07,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:07,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:07,419 INFO L87 Difference]: Start difference. First operand 377 states and 1288 transitions. Second operand 9 states. [2020-01-16 19:09:07,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:07,494 INFO L93 Difference]: Finished difference Result 566 states and 1659 transitions. [2020-01-16 19:09:07,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:07,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:07,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:07,496 INFO L225 Difference]: With dead ends: 566 [2020-01-16 19:09:07,496 INFO L226 Difference]: Without dead ends: 557 [2020-01-16 19:09:07,497 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:07,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-01-16 19:09:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 378. [2020-01-16 19:09:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:09:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1289 transitions. [2020-01-16 19:09:07,505 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1289 transitions. Word has length 22 [2020-01-16 19:09:07,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:07,505 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1289 transitions. [2020-01-16 19:09:07,505 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1289 transitions. [2020-01-16 19:09:07,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:07,506 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:07,506 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:07,506 INFO L426 AbstractCegarLoop]: === Iteration 1530 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:07,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:07,506 INFO L82 PathProgramCache]: Analyzing trace with hash -864945262, now seen corresponding path program 1524 times [2020-01-16 19:09:07,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:07,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276370700] [2020-01-16 19:09:07,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:07,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276370700] [2020-01-16 19:09:07,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:07,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:07,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966136229] [2020-01-16 19:09:07,776 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:07,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:07,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:07,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:07,777 INFO L87 Difference]: Start difference. First operand 378 states and 1289 transitions. Second operand 9 states. [2020-01-16 19:09:07,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:07,877 INFO L93 Difference]: Finished difference Result 569 states and 1664 transitions. [2020-01-16 19:09:07,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:07,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:07,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:07,879 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:09:07,879 INFO L226 Difference]: Without dead ends: 554 [2020-01-16 19:09:07,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:07,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-01-16 19:09:07,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 375. [2020-01-16 19:09:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1284 transitions. [2020-01-16 19:09:07,887 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1284 transitions. Word has length 22 [2020-01-16 19:09:07,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:07,887 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1284 transitions. [2020-01-16 19:09:07,887 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:07,887 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1284 transitions. [2020-01-16 19:09:07,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:07,888 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:07,888 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:07,888 INFO L426 AbstractCegarLoop]: === Iteration 1531 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:07,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:07,888 INFO L82 PathProgramCache]: Analyzing trace with hash -541555744, now seen corresponding path program 1525 times [2020-01-16 19:09:07,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:07,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226986393] [2020-01-16 19:09:07,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:08,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-01-16 19:09:08,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226986393] [2020-01-16 19:09:08,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:08,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:08,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654992373] [2020-01-16 19:09:08,172 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:08,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:08,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:08,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:08,172 INFO L87 Difference]: Start difference. First operand 375 states and 1284 transitions. Second operand 9 states. [2020-01-16 19:09:08,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:08,246 INFO L93 Difference]: Finished difference Result 584 states and 1700 transitions. [2020-01-16 19:09:08,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:08,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:08,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:08,248 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:09:08,248 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:09:08,248 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:09:08,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 381. [2020-01-16 19:09:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:09:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1298 transitions. [2020-01-16 19:09:08,257 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1298 transitions. Word has length 22 [2020-01-16 19:09:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:08,257 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1298 transitions. [2020-01-16 19:09:08,257 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1298 transitions. [2020-01-16 19:09:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:08,258 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:08,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, 1, 1, 1] [2020-01-16 19:09:08,258 INFO L426 AbstractCegarLoop]: === Iteration 1532 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:08,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:08,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1503759406, now seen corresponding path program 1526 times [2020-01-16 19:09:08,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:08,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449791701] [2020-01-16 19:09:08,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:08,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449791701] [2020-01-16 19:09:08,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:08,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:08,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996133232] [2020-01-16 19:09:08,528 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:08,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:08,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:08,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:08,528 INFO L87 Difference]: Start difference. First operand 381 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:09:08,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:08,627 INFO L93 Difference]: Finished difference Result 578 states and 1686 transitions. [2020-01-16 19:09:08,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:08,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:08,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:08,629 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:09:08,629 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:09:08,629 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:08,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:09:08,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 378. [2020-01-16 19:09:08,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:09:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1291 transitions. [2020-01-16 19:09:08,637 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1291 transitions. Word has length 22 [2020-01-16 19:09:08,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:08,637 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1291 transitions. [2020-01-16 19:09:08,638 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:08,638 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1291 transitions. [2020-01-16 19:09:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:08,638 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:08,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, 1, 1, 1] [2020-01-16 19:09:08,638 INFO L426 AbstractCegarLoop]: === Iteration 1533 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:08,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:08,638 INFO L82 PathProgramCache]: Analyzing trace with hash 471136788, now seen corresponding path program 1527 times [2020-01-16 19:09:08,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:08,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052072321] [2020-01-16 19:09:08,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:08,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052072321] [2020-01-16 19:09:08,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:08,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:08,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281034839] [2020-01-16 19:09:08,927 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:08,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:08,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:08,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:08,928 INFO L87 Difference]: Start difference. First operand 378 states and 1291 transitions. Second operand 9 states. [2020-01-16 19:09:08,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:08,999 INFO L93 Difference]: Finished difference Result 588 states and 1707 transitions. [2020-01-16 19:09:08,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:08,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:09,001 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:09:09,001 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:09:09,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:09,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:09:09,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 383. [2020-01-16 19:09:09,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:09:09,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1299 transitions. [2020-01-16 19:09:09,010 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1299 transitions. Word has length 22 [2020-01-16 19:09:09,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:09,010 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1299 transitions. [2020-01-16 19:09:09,010 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1299 transitions. [2020-01-16 19:09:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:09,011 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:09,011 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:09,011 INFO L426 AbstractCegarLoop]: === Iteration 1534 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:09,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:09,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1801913850, now seen corresponding path program 1528 times [2020-01-16 19:09:09,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:09,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932312494] [2020-01-16 19:09:09,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:09,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:09,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932312494] [2020-01-16 19:09:09,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:09,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:09,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618995533] [2020-01-16 19:09:09,295 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:09,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:09,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:09,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:09,295 INFO L87 Difference]: Start difference. First operand 383 states and 1299 transitions. Second operand 9 states. [2020-01-16 19:09:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:09,396 INFO L93 Difference]: Finished difference Result 584 states and 1695 transitions. [2020-01-16 19:09:09,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:09,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:09,398 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:09:09,398 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 19:09:09,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:09,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 19:09:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 378. [2020-01-16 19:09:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:09:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1288 transitions. [2020-01-16 19:09:09,408 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1288 transitions. Word has length 22 [2020-01-16 19:09:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:09,408 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1288 transitions. [2020-01-16 19:09:09,408 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:09,408 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1288 transitions. [2020-01-16 19:09:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:09,408 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:09,408 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:09,409 INFO L426 AbstractCegarLoop]: === Iteration 1535 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:09,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:09,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1187715758, now seen corresponding path program 1529 times [2020-01-16 19:09:09,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:09,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886448167] [2020-01-16 19:09:09,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:09,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886448167] [2020-01-16 19:09:09,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:09,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:09,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878243662] [2020-01-16 19:09:09,690 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:09,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:09,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:09,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:09,691 INFO L87 Difference]: Start difference. First operand 378 states and 1288 transitions. Second operand 9 states. [2020-01-16 19:09:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:09,790 INFO L93 Difference]: Finished difference Result 573 states and 1674 transitions. [2020-01-16 19:09:09,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:09,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:09,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:09,791 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:09:09,792 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:09:09,792 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:09,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:09:09,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 380. [2020-01-16 19:09:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:09:09,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1291 transitions. [2020-01-16 19:09:09,801 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1291 transitions. Word has length 22 [2020-01-16 19:09:09,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:09,801 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1291 transitions. [2020-01-16 19:09:09,801 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:09,801 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1291 transitions. [2020-01-16 19:09:09,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:09,801 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:09,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, 1, 1, 1] [2020-01-16 19:09:09,802 INFO L426 AbstractCegarLoop]: === Iteration 1536 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:09,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:09,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1014468066, now seen corresponding path program 1530 times [2020-01-16 19:09:09,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:09,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887330898] [2020-01-16 19:09:09,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:10,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-01-16 19:09:10,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887330898] [2020-01-16 19:09:10,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:10,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:10,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908244087] [2020-01-16 19:09:10,078 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:10,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:10,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:10,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:10,078 INFO L87 Difference]: Start difference. First operand 380 states and 1291 transitions. Second operand 9 states. [2020-01-16 19:09:10,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:10,183 INFO L93 Difference]: Finished difference Result 575 states and 1676 transitions. [2020-01-16 19:09:10,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:10,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:10,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:10,185 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:09:10,185 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:09:10,185 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:10,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:09:10,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 375. [2020-01-16 19:09:10,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:10,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1282 transitions. [2020-01-16 19:09:10,195 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1282 transitions. Word has length 22 [2020-01-16 19:09:10,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:10,195 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1282 transitions. [2020-01-16 19:09:10,195 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:10,195 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1282 transitions. [2020-01-16 19:09:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:10,195 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:10,195 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:10,196 INFO L426 AbstractCegarLoop]: === Iteration 1537 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:10,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:10,196 INFO L82 PathProgramCache]: Analyzing trace with hash 996301420, now seen corresponding path program 1531 times [2020-01-16 19:09:10,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:10,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661138620] [2020-01-16 19:09:10,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:10,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:10,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661138620] [2020-01-16 19:09:10,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:10,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:10,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485599436] [2020-01-16 19:09:10,500 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:10,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:10,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:10,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:10,501 INFO L87 Difference]: Start difference. First operand 375 states and 1282 transitions. Second operand 9 states. [2020-01-16 19:09:10,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:10,578 INFO L93 Difference]: Finished difference Result 553 states and 1631 transitions. [2020-01-16 19:09:10,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:10,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:10,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:10,580 INFO L225 Difference]: With dead ends: 553 [2020-01-16 19:09:10,580 INFO L226 Difference]: Without dead ends: 544 [2020-01-16 19:09:10,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-01-16 19:09:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 377. [2020-01-16 19:09:10,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:09:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1286 transitions. [2020-01-16 19:09:10,589 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1286 transitions. Word has length 22 [2020-01-16 19:09:10,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:10,589 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1286 transitions. [2020-01-16 19:09:10,589 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1286 transitions. [2020-01-16 19:09:10,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:10,590 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:10,590 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:10,590 INFO L426 AbstractCegarLoop]: === Iteration 1538 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:10,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:10,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1687724918, now seen corresponding path program 1532 times [2020-01-16 19:09:10,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:10,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549925321] [2020-01-16 19:09:10,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:10,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549925321] [2020-01-16 19:09:10,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:10,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:10,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762491386] [2020-01-16 19:09:10,876 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:10,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:10,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:10,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:10,877 INFO L87 Difference]: Start difference. First operand 377 states and 1286 transitions. Second operand 9 states. [2020-01-16 19:09:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:10,977 INFO L93 Difference]: Finished difference Result 554 states and 1632 transitions. [2020-01-16 19:09:10,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:10,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:10,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:10,979 INFO L225 Difference]: With dead ends: 554 [2020-01-16 19:09:10,979 INFO L226 Difference]: Without dead ends: 543 [2020-01-16 19:09:10,979 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-01-16 19:09:10,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 376. [2020-01-16 19:09:10,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:09:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1284 transitions. [2020-01-16 19:09:10,988 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1284 transitions. Word has length 22 [2020-01-16 19:09:10,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:10,988 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1284 transitions. [2020-01-16 19:09:10,988 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1284 transitions. [2020-01-16 19:09:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:10,988 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:10,989 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:10,989 INFO L426 AbstractCegarLoop]: === Iteration 1539 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:10,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2008993952, now seen corresponding path program 1533 times [2020-01-16 19:09:10,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:10,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490390642] [2020-01-16 19:09:10,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:11,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-01-16 19:09:11,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490390642] [2020-01-16 19:09:11,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:11,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:11,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679915534] [2020-01-16 19:09:11,273 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:11,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:11,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:11,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:11,274 INFO L87 Difference]: Start difference. First operand 376 states and 1284 transitions. Second operand 9 states. [2020-01-16 19:09:11,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:11,350 INFO L93 Difference]: Finished difference Result 555 states and 1634 transitions. [2020-01-16 19:09:11,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:11,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:11,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:11,351 INFO L225 Difference]: With dead ends: 555 [2020-01-16 19:09:11,351 INFO L226 Difference]: Without dead ends: 546 [2020-01-16 19:09:11,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:11,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-01-16 19:09:11,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 377. [2020-01-16 19:09:11,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:09:11,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1285 transitions. [2020-01-16 19:09:11,360 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1285 transitions. Word has length 22 [2020-01-16 19:09:11,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:11,360 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1285 transitions. [2020-01-16 19:09:11,360 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:11,360 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1285 transitions. [2020-01-16 19:09:11,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:11,361 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:11,361 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:11,361 INFO L426 AbstractCegarLoop]: === Iteration 1540 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:11,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:11,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1750743542, now seen corresponding path program 1534 times [2020-01-16 19:09:11,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:11,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941712648] [2020-01-16 19:09:11,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:11,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-01-16 19:09:11,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941712648] [2020-01-16 19:09:11,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:11,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:11,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107122660] [2020-01-16 19:09:11,669 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:11,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:11,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:11,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:11,669 INFO L87 Difference]: Start difference. First operand 377 states and 1285 transitions. Second operand 9 states. [2020-01-16 19:09:11,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:11,792 INFO L93 Difference]: Finished difference Result 558 states and 1639 transitions. [2020-01-16 19:09:11,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:11,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:11,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:11,794 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:09:11,794 INFO L226 Difference]: Without dead ends: 545 [2020-01-16 19:09:11,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:11,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-01-16 19:09:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 376. [2020-01-16 19:09:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:09:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1283 transitions. [2020-01-16 19:09:11,803 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1283 transitions. Word has length 22 [2020-01-16 19:09:11,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:11,803 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1283 transitions. [2020-01-16 19:09:11,803 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:11,804 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1283 transitions. [2020-01-16 19:09:11,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:11,804 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:11,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, 1, 1, 1] [2020-01-16 19:09:11,804 INFO L426 AbstractCegarLoop]: === Iteration 1541 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:11,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:11,804 INFO L82 PathProgramCache]: Analyzing trace with hash 2019497056, now seen corresponding path program 1535 times [2020-01-16 19:09:11,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:11,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851014044] [2020-01-16 19:09:11,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:12,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-01-16 19:09:12,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851014044] [2020-01-16 19:09:12,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:12,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:12,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320529242] [2020-01-16 19:09:12,083 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:12,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:12,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:12,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:12,084 INFO L87 Difference]: Start difference. First operand 376 states and 1283 transitions. Second operand 9 states. [2020-01-16 19:09:12,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:12,181 INFO L93 Difference]: Finished difference Result 558 states and 1640 transitions. [2020-01-16 19:09:12,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:12,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:12,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:12,182 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:09:12,183 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:09:12,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:12,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:09:12,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 378. [2020-01-16 19:09:12,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:09:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1286 transitions. [2020-01-16 19:09:12,191 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1286 transitions. Word has length 22 [2020-01-16 19:09:12,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:12,191 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1286 transitions. [2020-01-16 19:09:12,192 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:12,192 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1286 transitions. [2020-01-16 19:09:12,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:12,192 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:12,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, 1, 1, 1] [2020-01-16 19:09:12,192 INFO L426 AbstractCegarLoop]: === Iteration 1542 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:12,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:12,192 INFO L82 PathProgramCache]: Analyzing trace with hash 943785900, now seen corresponding path program 1536 times [2020-01-16 19:09:12,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:12,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076047187] [2020-01-16 19:09:12,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:12,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076047187] [2020-01-16 19:09:12,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:12,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:12,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55905086] [2020-01-16 19:09:12,470 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:12,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:12,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:12,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:12,471 INFO L87 Difference]: Start difference. First operand 378 states and 1286 transitions. Second operand 9 states. [2020-01-16 19:09:12,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:12,568 INFO L93 Difference]: Finished difference Result 560 states and 1642 transitions. [2020-01-16 19:09:12,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:12,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:12,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:12,570 INFO L225 Difference]: With dead ends: 560 [2020-01-16 19:09:12,570 INFO L226 Difference]: Without dead ends: 543 [2020-01-16 19:09:12,570 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:12,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-01-16 19:09:12,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 373. [2020-01-16 19:09:12,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:12,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1278 transitions. [2020-01-16 19:09:12,579 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1278 transitions. Word has length 22 [2020-01-16 19:09:12,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:12,579 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1278 transitions. [2020-01-16 19:09:12,579 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:12,579 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1278 transitions. [2020-01-16 19:09:12,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:12,580 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:12,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, 1, 1, 1] [2020-01-16 19:09:12,580 INFO L426 AbstractCegarLoop]: === Iteration 1543 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:12,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:12,580 INFO L82 PathProgramCache]: Analyzing trace with hash -383042890, now seen corresponding path program 1537 times [2020-01-16 19:09:12,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:12,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954981746] [2020-01-16 19:09:12,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:12,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-01-16 19:09:12,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954981746] [2020-01-16 19:09:12,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:12,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:12,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526656094] [2020-01-16 19:09:12,884 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:12,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:12,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:12,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:12,884 INFO L87 Difference]: Start difference. First operand 373 states and 1278 transitions. Second operand 9 states. [2020-01-16 19:09:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:12,984 INFO L93 Difference]: Finished difference Result 542 states and 1608 transitions. [2020-01-16 19:09:12,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:12,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:12,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:12,986 INFO L225 Difference]: With dead ends: 542 [2020-01-16 19:09:12,986 INFO L226 Difference]: Without dead ends: 531 [2020-01-16 19:09:12,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:12,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-01-16 19:09:12,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 376. [2020-01-16 19:09:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:09:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1286 transitions. [2020-01-16 19:09:12,994 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1286 transitions. Word has length 22 [2020-01-16 19:09:12,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:12,994 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1286 transitions. [2020-01-16 19:09:12,994 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1286 transitions. [2020-01-16 19:09:12,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:12,995 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:12,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, 1, 1, 1] [2020-01-16 19:09:12,995 INFO L426 AbstractCegarLoop]: === Iteration 1544 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:12,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:12,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1828559900, now seen corresponding path program 1538 times [2020-01-16 19:09:12,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:12,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596693459] [2020-01-16 19:09:12,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:13,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:13,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596693459] [2020-01-16 19:09:13,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:13,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:13,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037653657] [2020-01-16 19:09:13,294 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:13,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:13,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:13,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:13,294 INFO L87 Difference]: Start difference. First operand 376 states and 1286 transitions. Second operand 9 states. [2020-01-16 19:09:13,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:13,370 INFO L93 Difference]: Finished difference Result 540 states and 1603 transitions. [2020-01-16 19:09:13,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:13,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:13,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:13,371 INFO L225 Difference]: With dead ends: 540 [2020-01-16 19:09:13,371 INFO L226 Difference]: Without dead ends: 530 [2020-01-16 19:09:13,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:13,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-01-16 19:09:13,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 375. [2020-01-16 19:09:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1284 transitions. [2020-01-16 19:09:13,381 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1284 transitions. Word has length 22 [2020-01-16 19:09:13,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:13,381 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1284 transitions. [2020-01-16 19:09:13,381 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:13,381 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1284 transitions. [2020-01-16 19:09:13,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:13,381 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:13,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:13,382 INFO L426 AbstractCegarLoop]: === Iteration 1545 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:13,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:13,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1983480744, now seen corresponding path program 1539 times [2020-01-16 19:09:13,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:13,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908876480] [2020-01-16 19:09:13,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:13,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908876480] [2020-01-16 19:09:13,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:13,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:13,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379680345] [2020-01-16 19:09:13,677 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:13,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:13,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:13,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:13,678 INFO L87 Difference]: Start difference. First operand 375 states and 1284 transitions. Second operand 9 states. [2020-01-16 19:09:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:13,777 INFO L93 Difference]: Finished difference Result 544 states and 1612 transitions. [2020-01-16 19:09:13,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:13,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:13,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:13,779 INFO L225 Difference]: With dead ends: 544 [2020-01-16 19:09:13,779 INFO L226 Difference]: Without dead ends: 533 [2020-01-16 19:09:13,779 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:13,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-01-16 19:09:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 377. [2020-01-16 19:09:13,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:09:13,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1287 transitions. [2020-01-16 19:09:13,788 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1287 transitions. Word has length 22 [2020-01-16 19:09:13,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:13,788 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1287 transitions. [2020-01-16 19:09:13,788 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:13,789 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1287 transitions. [2020-01-16 19:09:13,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:13,789 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:13,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, 1, 1, 1] [2020-01-16 19:09:13,789 INFO L426 AbstractCegarLoop]: === Iteration 1546 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:13,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:13,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1730387992, now seen corresponding path program 1540 times [2020-01-16 19:09:13,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:13,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358118118] [2020-01-16 19:09:13,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:14,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358118118] [2020-01-16 19:09:14,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:14,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:14,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521150900] [2020-01-16 19:09:14,091 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:14,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:14,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:14,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:14,091 INFO L87 Difference]: Start difference. First operand 377 states and 1287 transitions. Second operand 9 states. [2020-01-16 19:09:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:14,193 INFO L93 Difference]: Finished difference Result 543 states and 1608 transitions. [2020-01-16 19:09:14,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:14,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:14,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:14,195 INFO L225 Difference]: With dead ends: 543 [2020-01-16 19:09:14,195 INFO L226 Difference]: Without dead ends: 531 [2020-01-16 19:09:14,195 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:14,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-01-16 19:09:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 375. [2020-01-16 19:09:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1283 transitions. [2020-01-16 19:09:14,204 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1283 transitions. Word has length 22 [2020-01-16 19:09:14,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:14,205 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1283 transitions. [2020-01-16 19:09:14,205 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1283 transitions. [2020-01-16 19:09:14,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:14,205 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:14,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, 1, 1, 1] [2020-01-16 19:09:14,205 INFO L426 AbstractCegarLoop]: === Iteration 1547 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:14,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:14,206 INFO L82 PathProgramCache]: Analyzing trace with hash -734468312, now seen corresponding path program 1541 times [2020-01-16 19:09:14,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:14,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503017135] [2020-01-16 19:09:14,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:14,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503017135] [2020-01-16 19:09:14,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:14,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:14,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936209182] [2020-01-16 19:09:14,512 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:14,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:14,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:14,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:14,512 INFO L87 Difference]: Start difference. First operand 375 states and 1283 transitions. Second operand 9 states. [2020-01-16 19:09:14,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:14,584 INFO L93 Difference]: Finished difference Result 539 states and 1600 transitions. [2020-01-16 19:09:14,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:14,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:14,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:14,586 INFO L225 Difference]: With dead ends: 539 [2020-01-16 19:09:14,586 INFO L226 Difference]: Without dead ends: 530 [2020-01-16 19:09:14,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-01-16 19:09:14,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 376. [2020-01-16 19:09:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:09:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1284 transitions. [2020-01-16 19:09:14,595 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1284 transitions. Word has length 22 [2020-01-16 19:09:14,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:14,595 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1284 transitions. [2020-01-16 19:09:14,595 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:14,595 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1284 transitions. [2020-01-16 19:09:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:14,596 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:14,596 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:14,596 INFO L426 AbstractCegarLoop]: === Iteration 1548 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:14,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:14,596 INFO L82 PathProgramCache]: Analyzing trace with hash 876472646, now seen corresponding path program 1542 times [2020-01-16 19:09:14,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:14,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345309907] [2020-01-16 19:09:14,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:14,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-01-16 19:09:14,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345309907] [2020-01-16 19:09:14,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:14,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:14,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059508070] [2020-01-16 19:09:14,895 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:14,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:14,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:14,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:14,895 INFO L87 Difference]: Start difference. First operand 376 states and 1284 transitions. Second operand 9 states. [2020-01-16 19:09:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:14,996 INFO L93 Difference]: Finished difference Result 540 states and 1601 transitions. [2020-01-16 19:09:14,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:14,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:14,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:14,998 INFO L225 Difference]: With dead ends: 540 [2020-01-16 19:09:14,998 INFO L226 Difference]: Without dead ends: 528 [2020-01-16 19:09:14,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:15,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-01-16 19:09:15,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 374. [2020-01-16 19:09:15,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:09:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1281 transitions. [2020-01-16 19:09:15,007 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1281 transitions. Word has length 22 [2020-01-16 19:09:15,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:15,008 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1281 transitions. [2020-01-16 19:09:15,008 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1281 transitions. [2020-01-16 19:09:15,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:15,008 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:15,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, 1, 1, 1] [2020-01-16 19:09:15,008 INFO L426 AbstractCegarLoop]: === Iteration 1549 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:15,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:15,008 INFO L82 PathProgramCache]: Analyzing trace with hash 945654530, now seen corresponding path program 1543 times [2020-01-16 19:09:15,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:15,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324745070] [2020-01-16 19:09:15,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:15,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-01-16 19:09:15,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324745070] [2020-01-16 19:09:15,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:15,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:15,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760098641] [2020-01-16 19:09:15,308 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:15,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:15,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:15,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:15,308 INFO L87 Difference]: Start difference. First operand 374 states and 1281 transitions. Second operand 9 states. [2020-01-16 19:09:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:15,407 INFO L93 Difference]: Finished difference Result 545 states and 1614 transitions. [2020-01-16 19:09:15,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:15,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:15,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:15,409 INFO L225 Difference]: With dead ends: 545 [2020-01-16 19:09:15,409 INFO L226 Difference]: Without dead ends: 534 [2020-01-16 19:09:15,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:15,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-01-16 19:09:15,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 376. [2020-01-16 19:09:15,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:09:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1285 transitions. [2020-01-16 19:09:15,418 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1285 transitions. Word has length 22 [2020-01-16 19:09:15,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:15,419 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1285 transitions. [2020-01-16 19:09:15,419 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:15,419 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1285 transitions. [2020-01-16 19:09:15,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:15,419 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:15,419 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:15,419 INFO L426 AbstractCegarLoop]: === Iteration 1550 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:15,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:15,420 INFO L82 PathProgramCache]: Analyzing trace with hash -499862480, now seen corresponding path program 1544 times [2020-01-16 19:09:15,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:15,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781610935] [2020-01-16 19:09:15,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:15,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-01-16 19:09:15,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781610935] [2020-01-16 19:09:15,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:15,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:15,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830435818] [2020-01-16 19:09:15,714 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:15,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:15,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:15,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:15,714 INFO L87 Difference]: Start difference. First operand 376 states and 1285 transitions. Second operand 9 states. [2020-01-16 19:09:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:15,795 INFO L93 Difference]: Finished difference Result 543 states and 1609 transitions. [2020-01-16 19:09:15,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:15,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:15,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:15,796 INFO L225 Difference]: With dead ends: 543 [2020-01-16 19:09:15,796 INFO L226 Difference]: Without dead ends: 533 [2020-01-16 19:09:15,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:15,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-01-16 19:09:15,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 375. [2020-01-16 19:09:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1283 transitions. [2020-01-16 19:09:15,805 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1283 transitions. Word has length 22 [2020-01-16 19:09:15,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:15,806 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1283 transitions. [2020-01-16 19:09:15,806 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:15,806 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1283 transitions. [2020-01-16 19:09:15,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:15,806 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:15,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, 1, 1, 1] [2020-01-16 19:09:15,807 INFO L426 AbstractCegarLoop]: === Iteration 1551 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:15,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:15,807 INFO L82 PathProgramCache]: Analyzing trace with hash 357909208, now seen corresponding path program 1545 times [2020-01-16 19:09:15,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:15,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28693002] [2020-01-16 19:09:15,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:16,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:16,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28693002] [2020-01-16 19:09:16,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:16,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:16,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580528376] [2020-01-16 19:09:16,092 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:16,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:16,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:16,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:16,093 INFO L87 Difference]: Start difference. First operand 375 states and 1283 transitions. Second operand 9 states. [2020-01-16 19:09:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:16,192 INFO L93 Difference]: Finished difference Result 550 states and 1625 transitions. [2020-01-16 19:09:16,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:16,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:16,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:16,193 INFO L225 Difference]: With dead ends: 550 [2020-01-16 19:09:16,193 INFO L226 Difference]: Without dead ends: 539 [2020-01-16 19:09:16,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:16,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-01-16 19:09:16,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 378. [2020-01-16 19:09:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:09:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1288 transitions. [2020-01-16 19:09:16,202 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1288 transitions. Word has length 22 [2020-01-16 19:09:16,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:16,202 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1288 transitions. [2020-01-16 19:09:16,202 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:16,202 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1288 transitions. [2020-01-16 19:09:16,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:16,203 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09: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, 1, 1, 1] [2020-01-16 19:09:16,203 INFO L426 AbstractCegarLoop]: === Iteration 1552 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:16,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:16,203 INFO L82 PathProgramCache]: Analyzing trace with hash 659927152, now seen corresponding path program 1546 times [2020-01-16 19:09:16,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:16,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934706036] [2020-01-16 19:09:16,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:16,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934706036] [2020-01-16 19:09:16,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:16,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:16,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100034932] [2020-01-16 19:09:16,492 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:16,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:16,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:16,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:16,492 INFO L87 Difference]: Start difference. First operand 378 states and 1288 transitions. Second operand 9 states. [2020-01-16 19:09:16,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:16,620 INFO L93 Difference]: Finished difference Result 551 states and 1624 transitions. [2020-01-16 19:09:16,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:16,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:16,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:16,622 INFO L225 Difference]: With dead ends: 551 [2020-01-16 19:09:16,622 INFO L226 Difference]: Without dead ends: 536 [2020-01-16 19:09:16,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:16,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-01-16 19:09:16,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 375. [2020-01-16 19:09:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1282 transitions. [2020-01-16 19:09:16,630 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1282 transitions. Word has length 22 [2020-01-16 19:09:16,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:16,630 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1282 transitions. [2020-01-16 19:09:16,630 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1282 transitions. [2020-01-16 19:09:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:16,631 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:16,631 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:16,631 INFO L426 AbstractCegarLoop]: === Iteration 1553 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:16,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:16,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1606921640, now seen corresponding path program 1547 times [2020-01-16 19:09:16,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:16,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177750763] [2020-01-16 19:09:16,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:16,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:16,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177750763] [2020-01-16 19:09:16,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:16,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:16,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099377579] [2020-01-16 19:09:16,924 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:16,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:16,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:16,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:16,925 INFO L87 Difference]: Start difference. First operand 375 states and 1282 transitions. Second operand 9 states. [2020-01-16 19:09:17,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:17,028 INFO L93 Difference]: Finished difference Result 544 states and 1610 transitions. [2020-01-16 19:09:17,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:17,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:17,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:17,029 INFO L225 Difference]: With dead ends: 544 [2020-01-16 19:09:17,029 INFO L226 Difference]: Without dead ends: 535 [2020-01-16 19:09:17,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:17,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-01-16 19:09:17,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 376. [2020-01-16 19:09:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:09:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1283 transitions. [2020-01-16 19:09:17,039 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1283 transitions. Word has length 22 [2020-01-16 19:09:17,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:17,039 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1283 transitions. [2020-01-16 19:09:17,039 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1283 transitions. [2020-01-16 19:09:17,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:17,039 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:17,039 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:17,039 INFO L426 AbstractCegarLoop]: === Iteration 1554 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:17,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:17,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2142151442, now seen corresponding path program 1548 times [2020-01-16 19:09:17,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:17,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399494511] [2020-01-16 19:09:17,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:17,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-01-16 19:09:17,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399494511] [2020-01-16 19:09:17,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:17,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:17,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354228768] [2020-01-16 19:09:17,329 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:17,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:17,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:17,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:17,329 INFO L87 Difference]: Start difference. First operand 376 states and 1283 transitions. Second operand 9 states. [2020-01-16 19:09:17,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:17,433 INFO L93 Difference]: Finished difference Result 547 states and 1615 transitions. [2020-01-16 19:09:17,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:17,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:17,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:17,435 INFO L225 Difference]: With dead ends: 547 [2020-01-16 19:09:17,435 INFO L226 Difference]: Without dead ends: 533 [2020-01-16 19:09:17,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:17,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-01-16 19:09:17,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 374. [2020-01-16 19:09:17,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:09:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1280 transitions. [2020-01-16 19:09:17,444 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1280 transitions. Word has length 22 [2020-01-16 19:09:17,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:17,445 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1280 transitions. [2020-01-16 19:09:17,445 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1280 transitions. [2020-01-16 19:09:17,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:17,445 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:17,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, 1, 1, 1] [2020-01-16 19:09:17,445 INFO L426 AbstractCegarLoop]: === Iteration 1555 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:17,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:17,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1271250754, now seen corresponding path program 1549 times [2020-01-16 19:09:17,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:17,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596820757] [2020-01-16 19:09:17,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:17,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-01-16 19:09:17,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596820757] [2020-01-16 19:09:17,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:17,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:17,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678872454] [2020-01-16 19:09:17,745 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:17,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:17,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:17,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:17,745 INFO L87 Difference]: Start difference. First operand 374 states and 1280 transitions. Second operand 9 states. [2020-01-16 19:09:17,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:17,846 INFO L93 Difference]: Finished difference Result 551 states and 1630 transitions. [2020-01-16 19:09:17,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:17,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:17,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:17,848 INFO L225 Difference]: With dead ends: 551 [2020-01-16 19:09:17,848 INFO L226 Difference]: Without dead ends: 540 [2020-01-16 19:09:17,848 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:17,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-01-16 19:09:17,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 378. [2020-01-16 19:09:17,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:09:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1290 transitions. [2020-01-16 19:09:17,858 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1290 transitions. Word has length 22 [2020-01-16 19:09:17,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:17,858 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1290 transitions. [2020-01-16 19:09:17,858 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:17,858 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1290 transitions. [2020-01-16 19:09:17,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:17,858 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:17,859 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:17,859 INFO L426 AbstractCegarLoop]: === Iteration 1556 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:17,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:17,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1524343506, now seen corresponding path program 1550 times [2020-01-16 19:09:17,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:17,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661594577] [2020-01-16 19:09:17,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:18,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661594577] [2020-01-16 19:09:18,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:18,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:18,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070720978] [2020-01-16 19:09:18,142 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:18,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:18,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:18,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:18,143 INFO L87 Difference]: Start difference. First operand 378 states and 1290 transitions. Second operand 9 states. [2020-01-16 19:09:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:18,245 INFO L93 Difference]: Finished difference Result 550 states and 1626 transitions. [2020-01-16 19:09:18,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:18,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:18,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:18,247 INFO L225 Difference]: With dead ends: 550 [2020-01-16 19:09:18,247 INFO L226 Difference]: Without dead ends: 538 [2020-01-16 19:09:18,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:18,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-01-16 19:09:18,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 376. [2020-01-16 19:09:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:09:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1285 transitions. [2020-01-16 19:09:18,257 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1285 transitions. Word has length 22 [2020-01-16 19:09:18,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:18,257 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1285 transitions. [2020-01-16 19:09:18,257 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:18,257 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1285 transitions. [2020-01-16 19:09:18,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:18,257 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:18,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, 1, 1, 1] [2020-01-16 19:09:18,258 INFO L426 AbstractCegarLoop]: === Iteration 1557 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:18,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:18,258 INFO L82 PathProgramCache]: Analyzing trace with hash -2011024010, now seen corresponding path program 1551 times [2020-01-16 19:09:18,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:18,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803175360] [2020-01-16 19:09:18,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:18,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803175360] [2020-01-16 19:09:18,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:18,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:18,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552517722] [2020-01-16 19:09:18,541 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:18,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:18,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:18,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:18,542 INFO L87 Difference]: Start difference. First operand 376 states and 1285 transitions. Second operand 9 states. [2020-01-16 19:09:18,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:18,643 INFO L93 Difference]: Finished difference Result 554 states and 1635 transitions. [2020-01-16 19:09:18,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:18,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:18,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:18,645 INFO L225 Difference]: With dead ends: 554 [2020-01-16 19:09:18,645 INFO L226 Difference]: Without dead ends: 543 [2020-01-16 19:09:18,645 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-01-16 19:09:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 379. [2020-01-16 19:09:18,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:09:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1290 transitions. [2020-01-16 19:09:18,653 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1290 transitions. Word has length 22 [2020-01-16 19:09:18,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:18,653 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1290 transitions. [2020-01-16 19:09:18,653 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:18,653 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1290 transitions. [2020-01-16 19:09:18,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:18,654 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:18,654 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:18,654 INFO L426 AbstractCegarLoop]: === Iteration 1558 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:18,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:18,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1709006066, now seen corresponding path program 1552 times [2020-01-16 19:09:18,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:18,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422363459] [2020-01-16 19:09:18,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:18,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-01-16 19:09:18,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422363459] [2020-01-16 19:09:18,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:18,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:18,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333294597] [2020-01-16 19:09:18,943 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:18,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:18,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:18,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:18,944 INFO L87 Difference]: Start difference. First operand 379 states and 1290 transitions. Second operand 9 states. [2020-01-16 19:09:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:19,047 INFO L93 Difference]: Finished difference Result 555 states and 1634 transitions. [2020-01-16 19:09:19,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:19,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:19,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:19,049 INFO L225 Difference]: With dead ends: 555 [2020-01-16 19:09:19,049 INFO L226 Difference]: Without dead ends: 540 [2020-01-16 19:09:19,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:19,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-01-16 19:09:19,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 376. [2020-01-16 19:09:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:09:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1283 transitions. [2020-01-16 19:09:19,058 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1283 transitions. Word has length 22 [2020-01-16 19:09:19,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:19,058 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1283 transitions. [2020-01-16 19:09:19,058 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1283 transitions. [2020-01-16 19:09:19,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:19,059 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:19,059 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:19,059 INFO L426 AbstractCegarLoop]: === Iteration 1559 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:19,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:19,059 INFO L82 PathProgramCache]: Analyzing trace with hash 993936754, now seen corresponding path program 1553 times [2020-01-16 19:09:19,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:19,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011595503] [2020-01-16 19:09:19,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:19,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-01-16 19:09:19,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011595503] [2020-01-16 19:09:19,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:19,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:19,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425338192] [2020-01-16 19:09:19,347 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:19,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:19,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:19,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:19,348 INFO L87 Difference]: Start difference. First operand 376 states and 1283 transitions. Second operand 9 states. [2020-01-16 19:09:19,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:19,451 INFO L93 Difference]: Finished difference Result 551 states and 1626 transitions. [2020-01-16 19:09:19,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:19,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:19,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:19,452 INFO L225 Difference]: With dead ends: 551 [2020-01-16 19:09:19,453 INFO L226 Difference]: Without dead ends: 541 [2020-01-16 19:09:19,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:19,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-01-16 19:09:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 378. [2020-01-16 19:09:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:09:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1286 transitions. [2020-01-16 19:09:19,462 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1286 transitions. Word has length 22 [2020-01-16 19:09:19,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:19,462 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1286 transitions. [2020-01-16 19:09:19,462 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:19,462 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1286 transitions. [2020-01-16 19:09:19,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:19,462 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:19,463 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:19,463 INFO L426 AbstractCegarLoop]: === Iteration 1560 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:19,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:19,463 INFO L82 PathProgramCache]: Analyzing trace with hash 820689062, now seen corresponding path program 1554 times [2020-01-16 19:09:19,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:19,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545951902] [2020-01-16 19:09:19,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:19,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-01-16 19:09:19,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545951902] [2020-01-16 19:09:19,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:19,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:19,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614400992] [2020-01-16 19:09:19,745 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:19,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:19,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:19,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:19,746 INFO L87 Difference]: Start difference. First operand 378 states and 1286 transitions. Second operand 9 states. [2020-01-16 19:09:19,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:19,853 INFO L93 Difference]: Finished difference Result 553 states and 1628 transitions. [2020-01-16 19:09:19,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:19,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:19,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:19,855 INFO L225 Difference]: With dead ends: 553 [2020-01-16 19:09:19,855 INFO L226 Difference]: Without dead ends: 537 [2020-01-16 19:09:19,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-01-16 19:09:19,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 374. [2020-01-16 19:09:19,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:09:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1279 transitions. [2020-01-16 19:09:19,864 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1279 transitions. Word has length 22 [2020-01-16 19:09:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:19,864 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1279 transitions. [2020-01-16 19:09:19,864 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:19,864 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1279 transitions. [2020-01-16 19:09:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:19,865 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:19,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, 1, 1, 1] [2020-01-16 19:09:19,865 INFO L426 AbstractCegarLoop]: === Iteration 1561 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:19,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:19,865 INFO L82 PathProgramCache]: Analyzing trace with hash 151329968, now seen corresponding path program 1555 times [2020-01-16 19:09:19,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:19,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662755524] [2020-01-16 19:09:19,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:20,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-01-16 19:09:20,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662755524] [2020-01-16 19:09:20,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:20,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:20,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928193934] [2020-01-16 19:09:20,170 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:20,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:20,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:20,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:20,171 INFO L87 Difference]: Start difference. First operand 374 states and 1279 transitions. Second operand 9 states. [2020-01-16 19:09:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:20,253 INFO L93 Difference]: Finished difference Result 540 states and 1601 transitions. [2020-01-16 19:09:20,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:20,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:20,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:20,254 INFO L225 Difference]: With dead ends: 540 [2020-01-16 19:09:20,255 INFO L226 Difference]: Without dead ends: 531 [2020-01-16 19:09:20,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:20,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-01-16 19:09:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 376. [2020-01-16 19:09:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:09:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1283 transitions. [2020-01-16 19:09:20,264 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1283 transitions. Word has length 22 [2020-01-16 19:09:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:20,264 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1283 transitions. [2020-01-16 19:09:20,264 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1283 transitions. [2020-01-16 19:09:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:20,265 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:20,265 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:20,265 INFO L426 AbstractCegarLoop]: === Iteration 1562 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:20,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:20,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1762270926, now seen corresponding path program 1556 times [2020-01-16 19:09:20,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:20,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111866592] [2020-01-16 19:09:20,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:20,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-01-16 19:09:20,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111866592] [2020-01-16 19:09:20,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:20,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:20,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189788509] [2020-01-16 19:09:20,562 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:20,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:20,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:20,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:20,562 INFO L87 Difference]: Start difference. First operand 376 states and 1283 transitions. Second operand 9 states. [2020-01-16 19:09:20,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:20,661 INFO L93 Difference]: Finished difference Result 541 states and 1602 transitions. [2020-01-16 19:09:20,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:20,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:20,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:20,663 INFO L225 Difference]: With dead ends: 541 [2020-01-16 19:09:20,663 INFO L226 Difference]: Without dead ends: 530 [2020-01-16 19:09:20,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:20,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-01-16 19:09:20,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 375. [2020-01-16 19:09:20,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1281 transitions. [2020-01-16 19:09:20,671 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1281 transitions. Word has length 22 [2020-01-16 19:09:20,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:20,672 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1281 transitions. [2020-01-16 19:09:20,672 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:20,672 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1281 transitions. [2020-01-16 19:09:20,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:20,672 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:20,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:20,672 INFO L426 AbstractCegarLoop]: === Iteration 1563 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:20,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:20,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1164022500, now seen corresponding path program 1557 times [2020-01-16 19:09:20,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:20,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302630109] [2020-01-16 19:09:20,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:20,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302630109] [2020-01-16 19:09:20,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:20,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:20,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852562911] [2020-01-16 19:09:20,961 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:20,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:20,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:20,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:20,961 INFO L87 Difference]: Start difference. First operand 375 states and 1281 transitions. Second operand 9 states. [2020-01-16 19:09:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:21,062 INFO L93 Difference]: Finished difference Result 542 states and 1604 transitions. [2020-01-16 19:09:21,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:21,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:21,064 INFO L225 Difference]: With dead ends: 542 [2020-01-16 19:09:21,064 INFO L226 Difference]: Without dead ends: 533 [2020-01-16 19:09:21,064 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-01-16 19:09:21,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 376. [2020-01-16 19:09:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:09:21,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1282 transitions. [2020-01-16 19:09:21,073 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1282 transitions. Word has length 22 [2020-01-16 19:09:21,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:21,074 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1282 transitions. [2020-01-16 19:09:21,074 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:21,074 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1282 transitions. [2020-01-16 19:09:21,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:21,074 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:21,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, 1, 1, 1] [2020-01-16 19:09:21,074 INFO L426 AbstractCegarLoop]: === Iteration 1564 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:21,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:21,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1699252302, now seen corresponding path program 1558 times [2020-01-16 19:09:21,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:21,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210211230] [2020-01-16 19:09:21,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:21,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210211230] [2020-01-16 19:09:21,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:21,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:21,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324699467] [2020-01-16 19:09:21,357 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:21,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:21,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:21,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:21,357 INFO L87 Difference]: Start difference. First operand 376 states and 1282 transitions. Second operand 9 states. [2020-01-16 19:09:21,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:21,455 INFO L93 Difference]: Finished difference Result 545 states and 1609 transitions. [2020-01-16 19:09:21,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:21,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:21,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:21,457 INFO L225 Difference]: With dead ends: 545 [2020-01-16 19:09:21,457 INFO L226 Difference]: Without dead ends: 532 [2020-01-16 19:09:21,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:21,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-01-16 19:09:21,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 375. [2020-01-16 19:09:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:21,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1280 transitions. [2020-01-16 19:09:21,466 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1280 transitions. Word has length 22 [2020-01-16 19:09:21,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:21,466 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1280 transitions. [2020-01-16 19:09:21,466 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1280 transitions. [2020-01-16 19:09:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:21,467 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:21,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, 1, 1, 1] [2020-01-16 19:09:21,467 INFO L426 AbstractCegarLoop]: === Iteration 1565 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:21,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:21,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1174525604, now seen corresponding path program 1559 times [2020-01-16 19:09:21,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:21,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901362042] [2020-01-16 19:09:21,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:21,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-01-16 19:09:21,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901362042] [2020-01-16 19:09:21,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:21,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:21,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363772128] [2020-01-16 19:09:21,744 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:21,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:21,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:21,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:21,745 INFO L87 Difference]: Start difference. First operand 375 states and 1280 transitions. Second operand 9 states. [2020-01-16 19:09:21,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:21,848 INFO L93 Difference]: Finished difference Result 545 states and 1610 transitions. [2020-01-16 19:09:21,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:21,848 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:21,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:21,850 INFO L225 Difference]: With dead ends: 545 [2020-01-16 19:09:21,850 INFO L226 Difference]: Without dead ends: 535 [2020-01-16 19:09:21,850 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:21,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-01-16 19:09:21,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 377. [2020-01-16 19:09:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:09:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1283 transitions. [2020-01-16 19:09:21,858 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1283 transitions. Word has length 22 [2020-01-16 19:09:21,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:21,858 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1283 transitions. [2020-01-16 19:09:21,858 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:21,858 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1283 transitions. [2020-01-16 19:09:21,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:21,859 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:21,859 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:21,859 INFO L426 AbstractCegarLoop]: === Iteration 1566 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:21,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:21,859 INFO L82 PathProgramCache]: Analyzing trace with hash 98814448, now seen corresponding path program 1560 times [2020-01-16 19:09:21,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:21,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539739959] [2020-01-16 19:09:21,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:22,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-01-16 19:09:22,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539739959] [2020-01-16 19:09:22,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:22,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:22,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440874884] [2020-01-16 19:09:22,148 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:22,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:22,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:22,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:22,149 INFO L87 Difference]: Start difference. First operand 377 states and 1283 transitions. Second operand 9 states. [2020-01-16 19:09:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:22,269 INFO L93 Difference]: Finished difference Result 547 states and 1612 transitions. [2020-01-16 19:09:22,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:22,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:22,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:22,271 INFO L225 Difference]: With dead ends: 547 [2020-01-16 19:09:22,271 INFO L226 Difference]: Without dead ends: 529 [2020-01-16 19:09:22,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-01-16 19:09:22,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 371. [2020-01-16 19:09:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:09:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1274 transitions. [2020-01-16 19:09:22,280 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1274 transitions. Word has length 22 [2020-01-16 19:09:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:22,280 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1274 transitions. [2020-01-16 19:09:22,280 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:22,281 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1274 transitions. [2020-01-16 19:09:22,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:22,281 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:22,281 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:22,281 INFO L426 AbstractCegarLoop]: === Iteration 1567 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:22,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:22,281 INFO L82 PathProgramCache]: Analyzing trace with hash -453357114, now seen corresponding path program 1561 times [2020-01-16 19:09:22,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:22,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132507679] [2020-01-16 19:09:22,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:22,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-01-16 19:09:22,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132507679] [2020-01-16 19:09:22,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:22,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:22,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729034597] [2020-01-16 19:09:22,545 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:22,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:22,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:22,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:22,545 INFO L87 Difference]: Start difference. First operand 371 states and 1274 transitions. Second operand 9 states. [2020-01-16 19:09:22,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:22,625 INFO L93 Difference]: Finished difference Result 576 states and 1678 transitions. [2020-01-16 19:09:22,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:22,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:22,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:22,627 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:09:22,627 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:09:22,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:22,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:09:22,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 377. [2020-01-16 19:09:22,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:09:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1286 transitions. [2020-01-16 19:09:22,636 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1286 transitions. Word has length 22 [2020-01-16 19:09:22,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:22,636 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1286 transitions. [2020-01-16 19:09:22,637 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:22,637 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1286 transitions. [2020-01-16 19:09:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:22,637 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:22,637 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:22,637 INFO L426 AbstractCegarLoop]: === Iteration 1568 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:22,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:22,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1136908772, now seen corresponding path program 1562 times [2020-01-16 19:09:22,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:22,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042908398] [2020-01-16 19:09:22,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:22,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-01-16 19:09:22,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042908398] [2020-01-16 19:09:22,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:22,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:22,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058373067] [2020-01-16 19:09:22,909 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:22,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:22,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:22,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:22,910 INFO L87 Difference]: Start difference. First operand 377 states and 1286 transitions. Second operand 9 states. [2020-01-16 19:09:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:23,017 INFO L93 Difference]: Finished difference Result 571 states and 1665 transitions. [2020-01-16 19:09:23,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:23,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:23,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:23,019 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:09:23,019 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:09:23,019 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:23,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:09:23,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 373. [2020-01-16 19:09:23,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1278 transitions. [2020-01-16 19:09:23,028 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1278 transitions. Word has length 22 [2020-01-16 19:09:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:23,028 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1278 transitions. [2020-01-16 19:09:23,028 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1278 transitions. [2020-01-16 19:09:23,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:23,028 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:23,029 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:23,029 INFO L426 AbstractCegarLoop]: === Iteration 1569 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:23,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:23,029 INFO L82 PathProgramCache]: Analyzing trace with hash 899193206, now seen corresponding path program 1563 times [2020-01-16 19:09:23,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:23,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323091260] [2020-01-16 19:09:23,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:23,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-01-16 19:09:23,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323091260] [2020-01-16 19:09:23,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:23,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:23,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344283394] [2020-01-16 19:09:23,290 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:23,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:23,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:23,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:23,290 INFO L87 Difference]: Start difference. First operand 373 states and 1278 transitions. Second operand 9 states. [2020-01-16 19:09:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:23,373 INFO L93 Difference]: Finished difference Result 572 states and 1666 transitions. [2020-01-16 19:09:23,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:23,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:23,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:23,375 INFO L225 Difference]: With dead ends: 572 [2020-01-16 19:09:23,375 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:09:23,375 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:23,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:09:23,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 375. [2020-01-16 19:09:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:23,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1280 transitions. [2020-01-16 19:09:23,383 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1280 transitions. Word has length 22 [2020-01-16 19:09:23,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:23,383 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1280 transitions. [2020-01-16 19:09:23,383 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:23,384 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1280 transitions. [2020-01-16 19:09:23,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:23,384 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:23,384 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:23,384 INFO L426 AbstractCegarLoop]: === Iteration 1570 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:23,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:23,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1460261698, now seen corresponding path program 1564 times [2020-01-16 19:09:23,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:23,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652990328] [2020-01-16 19:09:23,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:23,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-01-16 19:09:23,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652990328] [2020-01-16 19:09:23,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:23,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:23,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613582967] [2020-01-16 19:09:23,648 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:23,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:23,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:23,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:23,648 INFO L87 Difference]: Start difference. First operand 375 states and 1280 transitions. Second operand 9 states. [2020-01-16 19:09:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:23,729 INFO L93 Difference]: Finished difference Result 565 states and 1651 transitions. [2020-01-16 19:09:23,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:23,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:23,731 INFO L225 Difference]: With dead ends: 565 [2020-01-16 19:09:23,731 INFO L226 Difference]: Without dead ends: 554 [2020-01-16 19:09:23,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:23,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-01-16 19:09:23,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 373. [2020-01-16 19:09:23,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:23,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1276 transitions. [2020-01-16 19:09:23,740 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1276 transitions. Word has length 22 [2020-01-16 19:09:23,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:23,740 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1276 transitions. [2020-01-16 19:09:23,741 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:23,741 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1276 transitions. [2020-01-16 19:09:23,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:23,741 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:23,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, 1, 1, 1] [2020-01-16 19:09:23,741 INFO L426 AbstractCegarLoop]: === Iteration 1571 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:23,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:23,741 INFO L82 PathProgramCache]: Analyzing trace with hash -295097000, now seen corresponding path program 1565 times [2020-01-16 19:09:23,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:23,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101201887] [2020-01-16 19:09:23,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:24,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-01-16 19:09:24,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101201887] [2020-01-16 19:09:24,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:24,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:24,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335256420] [2020-01-16 19:09:24,005 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:24,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:24,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:24,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:24,006 INFO L87 Difference]: Start difference. First operand 373 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:09:24,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:24,120 INFO L93 Difference]: Finished difference Result 561 states and 1644 transitions. [2020-01-16 19:09:24,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:24,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:24,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:24,122 INFO L225 Difference]: With dead ends: 561 [2020-01-16 19:09:24,122 INFO L226 Difference]: Without dead ends: 550 [2020-01-16 19:09:24,122 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:24,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-01-16 19:09:24,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 374. [2020-01-16 19:09:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:09:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1277 transitions. [2020-01-16 19:09:24,131 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1277 transitions. Word has length 22 [2020-01-16 19:09:24,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:24,131 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1277 transitions. [2020-01-16 19:09:24,131 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:24,131 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1277 transitions. [2020-01-16 19:09:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:24,132 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:24,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, 1, 1, 1] [2020-01-16 19:09:24,132 INFO L426 AbstractCegarLoop]: === Iteration 1572 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:24,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:24,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1740614010, now seen corresponding path program 1566 times [2020-01-16 19:09:24,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:24,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955817143] [2020-01-16 19:09:24,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:24,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-01-16 19:09:24,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955817143] [2020-01-16 19:09:24,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:24,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:24,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190679177] [2020-01-16 19:09:24,407 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:24,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:24,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:24,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:24,407 INFO L87 Difference]: Start difference. First operand 374 states and 1277 transitions. Second operand 9 states. [2020-01-16 19:09:24,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:24,488 INFO L93 Difference]: Finished difference Result 559 states and 1639 transitions. [2020-01-16 19:09:24,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:24,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:24,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:24,489 INFO L225 Difference]: With dead ends: 559 [2020-01-16 19:09:24,489 INFO L226 Difference]: Without dead ends: 547 [2020-01-16 19:09:24,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:24,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-01-16 19:09:24,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 371. [2020-01-16 19:09:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:09:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1272 transitions. [2020-01-16 19:09:24,498 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1272 transitions. Word has length 22 [2020-01-16 19:09:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:24,498 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1272 transitions. [2020-01-16 19:09:24,498 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1272 transitions. [2020-01-16 19:09:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:24,499 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:24,499 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:24,499 INFO L426 AbstractCegarLoop]: === Iteration 1573 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:24,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:24,499 INFO L82 PathProgramCache]: Analyzing trace with hash -875842840, now seen corresponding path program 1567 times [2020-01-16 19:09:24,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:24,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010139935] [2020-01-16 19:09:24,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:24,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-01-16 19:09:24,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010139935] [2020-01-16 19:09:24,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:24,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:24,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64267922] [2020-01-16 19:09:24,767 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:24,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:24,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:24,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:24,767 INFO L87 Difference]: Start difference. First operand 371 states and 1272 transitions. Second operand 9 states. [2020-01-16 19:09:24,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:24,846 INFO L93 Difference]: Finished difference Result 580 states and 1688 transitions. [2020-01-16 19:09:24,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:24,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:24,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:24,848 INFO L225 Difference]: With dead ends: 580 [2020-01-16 19:09:24,848 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 19:09:24,848 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:24,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 19:09:24,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 378. [2020-01-16 19:09:24,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:09:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1288 transitions. [2020-01-16 19:09:24,857 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1288 transitions. Word has length 22 [2020-01-16 19:09:24,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:24,857 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1288 transitions. [2020-01-16 19:09:24,857 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1288 transitions. [2020-01-16 19:09:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:24,858 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:24,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, 1, 1, 1] [2020-01-16 19:09:24,858 INFO L426 AbstractCegarLoop]: === Iteration 1574 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:24,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:24,858 INFO L82 PathProgramCache]: Analyzing trace with hash 714423046, now seen corresponding path program 1568 times [2020-01-16 19:09:24,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:24,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769493193] [2020-01-16 19:09:24,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:25,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-01-16 19:09:25,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769493193] [2020-01-16 19:09:25,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:25,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:25,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538272622] [2020-01-16 19:09:25,119 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:25,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:25,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:25,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:25,119 INFO L87 Difference]: Start difference. First operand 378 states and 1288 transitions. Second operand 9 states. [2020-01-16 19:09:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:25,229 INFO L93 Difference]: Finished difference Result 575 states and 1675 transitions. [2020-01-16 19:09:25,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:25,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:25,231 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:09:25,231 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:09:25,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:25,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:09:25,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 374. [2020-01-16 19:09:25,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:09:25,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1279 transitions. [2020-01-16 19:09:25,240 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1279 transitions. Word has length 22 [2020-01-16 19:09:25,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:25,240 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1279 transitions. [2020-01-16 19:09:25,240 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:25,240 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1279 transitions. [2020-01-16 19:09:25,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:25,241 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:25,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, 1, 1, 1] [2020-01-16 19:09:25,241 INFO L426 AbstractCegarLoop]: === Iteration 1575 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:25,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:25,241 INFO L82 PathProgramCache]: Analyzing trace with hash -774930668, now seen corresponding path program 1569 times [2020-01-16 19:09:25,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:25,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393546888] [2020-01-16 19:09:25,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:25,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393546888] [2020-01-16 19:09:25,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:25,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:25,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916548410] [2020-01-16 19:09:25,503 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:25,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:25,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:25,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:25,503 INFO L87 Difference]: Start difference. First operand 374 states and 1279 transitions. Second operand 9 states. [2020-01-16 19:09:25,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:25,589 INFO L93 Difference]: Finished difference Result 578 states and 1680 transitions. [2020-01-16 19:09:25,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:25,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:25,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:25,591 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:09:25,591 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:09:25,591 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:09:25,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 377. [2020-01-16 19:09:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:09:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1283 transitions. [2020-01-16 19:09:25,600 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1283 transitions. Word has length 22 [2020-01-16 19:09:25,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:25,600 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1283 transitions. [2020-01-16 19:09:25,600 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:25,601 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1283 transitions. [2020-01-16 19:09:25,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:25,601 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:25,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, 1, 1, 1] [2020-01-16 19:09:25,601 INFO L426 AbstractCegarLoop]: === Iteration 1576 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:25,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:25,601 INFO L82 PathProgramCache]: Analyzing trace with hash -648294294, now seen corresponding path program 1570 times [2020-01-16 19:09:25,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:25,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291547508] [2020-01-16 19:09:25,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:25,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-01-16 19:09:25,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291547508] [2020-01-16 19:09:25,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:25,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:25,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769195232] [2020-01-16 19:09:25,861 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:25,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:25,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:25,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:25,862 INFO L87 Difference]: Start difference. First operand 377 states and 1283 transitions. Second operand 9 states. [2020-01-16 19:09:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:25,978 INFO L93 Difference]: Finished difference Result 572 states and 1666 transitions. [2020-01-16 19:09:25,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:25,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:25,979 INFO L225 Difference]: With dead ends: 572 [2020-01-16 19:09:25,979 INFO L226 Difference]: Without dead ends: 559 [2020-01-16 19:09:25,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:25,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-01-16 19:09:25,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 374. [2020-01-16 19:09:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:09:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1276 transitions. [2020-01-16 19:09:25,988 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1276 transitions. Word has length 22 [2020-01-16 19:09:25,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:25,988 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1276 transitions. [2020-01-16 19:09:25,988 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1276 transitions. [2020-01-16 19:09:25,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:25,989 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:25,989 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:25,989 INFO L426 AbstractCegarLoop]: === Iteration 1577 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:25,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:25,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1231654834, now seen corresponding path program 1571 times [2020-01-16 19:09:25,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:25,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721548399] [2020-01-16 19:09:25,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:26,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721548399] [2020-01-16 19:09:26,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:26,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:26,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156844887] [2020-01-16 19:09:26,255 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:26,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:26,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:26,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:26,255 INFO L87 Difference]: Start difference. First operand 374 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:09:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:26,356 INFO L93 Difference]: Finished difference Result 567 states and 1657 transitions. [2020-01-16 19:09:26,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:26,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:26,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:26,358 INFO L225 Difference]: With dead ends: 567 [2020-01-16 19:09:26,358 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:09:26,358 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:26,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:09:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 376. [2020-01-16 19:09:26,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:09:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1279 transitions. [2020-01-16 19:09:26,367 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1279 transitions. Word has length 22 [2020-01-16 19:09:26,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:26,367 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1279 transitions. [2020-01-16 19:09:26,367 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:26,367 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1279 transitions. [2020-01-16 19:09:26,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:26,368 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:26,368 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:26,368 INFO L426 AbstractCegarLoop]: === Iteration 1578 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:26,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:26,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1721379674, now seen corresponding path program 1572 times [2020-01-16 19:09:26,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:26,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384250883] [2020-01-16 19:09:26,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:26,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-01-16 19:09:26,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384250883] [2020-01-16 19:09:26,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:26,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:26,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011206818] [2020-01-16 19:09:26,638 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:26,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:26,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:26,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:26,638 INFO L87 Difference]: Start difference. First operand 376 states and 1279 transitions. Second operand 9 states. [2020-01-16 19:09:26,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:26,739 INFO L93 Difference]: Finished difference Result 566 states and 1653 transitions. [2020-01-16 19:09:26,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:26,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:26,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:26,740 INFO L225 Difference]: With dead ends: 566 [2020-01-16 19:09:26,741 INFO L226 Difference]: Without dead ends: 551 [2020-01-16 19:09:26,741 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:26,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-01-16 19:09:26,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 371. [2020-01-16 19:09:26,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:09:26,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1270 transitions. [2020-01-16 19:09:26,749 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1270 transitions. Word has length 22 [2020-01-16 19:09:26,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:26,749 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1270 transitions. [2020-01-16 19:09:26,749 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:26,749 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1270 transitions. [2020-01-16 19:09:26,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:26,750 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:26,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, 1, 1, 1] [2020-01-16 19:09:26,750 INFO L426 AbstractCegarLoop]: === Iteration 1579 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:26,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:26,750 INFO L82 PathProgramCache]: Analyzing trace with hash 880605302, now seen corresponding path program 1573 times [2020-01-16 19:09:26,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:26,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079761986] [2020-01-16 19:09:26,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:27,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079761986] [2020-01-16 19:09:27,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:27,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:27,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899244121] [2020-01-16 19:09:27,017 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:27,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:27,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:27,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:27,017 INFO L87 Difference]: Start difference. First operand 371 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:09:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:27,092 INFO L93 Difference]: Finished difference Result 570 states and 1659 transitions. [2020-01-16 19:09:27,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:27,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:27,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:27,094 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:09:27,094 INFO L226 Difference]: Without dead ends: 554 [2020-01-16 19:09:27,094 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:27,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-01-16 19:09:27,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 375. [2020-01-16 19:09:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1278 transitions. [2020-01-16 19:09:27,103 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1278 transitions. Word has length 22 [2020-01-16 19:09:27,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:27,103 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1278 transitions. [2020-01-16 19:09:27,103 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:27,103 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1278 transitions. [2020-01-16 19:09:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:27,104 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:27,104 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:27,104 INFO L426 AbstractCegarLoop]: === Iteration 1580 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:27,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:27,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1441673794, now seen corresponding path program 1574 times [2020-01-16 19:09:27,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:27,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933809355] [2020-01-16 19:09:27,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:27,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-01-16 19:09:27,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933809355] [2020-01-16 19:09:27,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:27,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:27,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030818913] [2020-01-16 19:09:27,368 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:27,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:27,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:27,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:27,369 INFO L87 Difference]: Start difference. First operand 375 states and 1278 transitions. Second operand 9 states. [2020-01-16 19:09:27,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:27,467 INFO L93 Difference]: Finished difference Result 563 states and 1644 transitions. [2020-01-16 19:09:27,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:27,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:27,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:27,469 INFO L225 Difference]: With dead ends: 563 [2020-01-16 19:09:27,469 INFO L226 Difference]: Without dead ends: 552 [2020-01-16 19:09:27,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:27,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-01-16 19:09:27,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 373. [2020-01-16 19:09:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1274 transitions. [2020-01-16 19:09:27,477 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1274 transitions. Word has length 22 [2020-01-16 19:09:27,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:27,477 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1274 transitions. [2020-01-16 19:09:27,477 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1274 transitions. [2020-01-16 19:09:27,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:27,478 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:27,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, 1, 1, 1] [2020-01-16 19:09:27,478 INFO L426 AbstractCegarLoop]: === Iteration 1581 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:27,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:27,478 INFO L82 PathProgramCache]: Analyzing trace with hash -719832552, now seen corresponding path program 1575 times [2020-01-16 19:09:27,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:27,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454920386] [2020-01-16 19:09:27,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:27,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-01-16 19:09:27,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454920386] [2020-01-16 19:09:27,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:27,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:27,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222170164] [2020-01-16 19:09:27,750 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:27,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:27,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:27,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:27,750 INFO L87 Difference]: Start difference. First operand 373 states and 1274 transitions. Second operand 9 states. [2020-01-16 19:09:27,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:27,828 INFO L93 Difference]: Finished difference Result 572 states and 1662 transitions. [2020-01-16 19:09:27,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:27,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:27,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:27,830 INFO L225 Difference]: With dead ends: 572 [2020-01-16 19:09:27,830 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:09:27,830 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:27,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:09:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 376. [2020-01-16 19:09:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:09:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1278 transitions. [2020-01-16 19:09:27,840 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1278 transitions. Word has length 22 [2020-01-16 19:09:27,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:27,840 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1278 transitions. [2020-01-16 19:09:27,840 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:27,840 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1278 transitions. [2020-01-16 19:09:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:27,840 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:27,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, 1, 1, 1] [2020-01-16 19:09:27,841 INFO L426 AbstractCegarLoop]: === Iteration 1582 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:27,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:27,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1682036214, now seen corresponding path program 1576 times [2020-01-16 19:09:27,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:27,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362562086] [2020-01-16 19:09:27,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:28,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-01-16 19:09:28,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362562086] [2020-01-16 19:09:28,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:28,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:28,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894022598] [2020-01-16 19:09:28,101 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:28,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:28,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:28,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:28,101 INFO L87 Difference]: Start difference. First operand 376 states and 1278 transitions. Second operand 9 states. [2020-01-16 19:09:28,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:28,223 INFO L93 Difference]: Finished difference Result 566 states and 1648 transitions. [2020-01-16 19:09:28,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:28,224 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:28,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:28,225 INFO L225 Difference]: With dead ends: 566 [2020-01-16 19:09:28,225 INFO L226 Difference]: Without dead ends: 553 [2020-01-16 19:09:28,226 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:28,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-01-16 19:09:28,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 373. [2020-01-16 19:09:28,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-01-16 19:09:28,235 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-01-16 19:09:28,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:28,235 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-01-16 19:09:28,235 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:28,235 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-01-16 19:09:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:28,236 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:28,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, 1, 1, 1] [2020-01-16 19:09:28,236 INFO L426 AbstractCegarLoop]: === Iteration 1583 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:28,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:28,236 INFO L82 PathProgramCache]: Analyzing trace with hash -665110326, now seen corresponding path program 1577 times [2020-01-16 19:09:28,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:28,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605261387] [2020-01-16 19:09:28,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:28,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-01-16 19:09:28,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605261387] [2020-01-16 19:09:28,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:28,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:28,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115367673] [2020-01-16 19:09:28,511 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:28,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:28,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:28,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:28,511 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-01-16 19:09:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:28,592 INFO L93 Difference]: Finished difference Result 556 states and 1629 transitions. [2020-01-16 19:09:28,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:28,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:28,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:28,593 INFO L225 Difference]: With dead ends: 556 [2020-01-16 19:09:28,594 INFO L226 Difference]: Without dead ends: 547 [2020-01-16 19:09:28,594 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:28,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-01-16 19:09:28,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 374. [2020-01-16 19:09:28,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:09:28,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1273 transitions. [2020-01-16 19:09:28,602 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1273 transitions. Word has length 22 [2020-01-16 19:09:28,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:28,602 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1273 transitions. [2020-01-16 19:09:28,602 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1273 transitions. [2020-01-16 19:09:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:28,603 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:28,603 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:28,603 INFO L426 AbstractCegarLoop]: === Iteration 1584 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:28,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:28,603 INFO L82 PathProgramCache]: Analyzing trace with hash 945830632, now seen corresponding path program 1578 times [2020-01-16 19:09:28,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:28,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184646191] [2020-01-16 19:09:28,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:28,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-01-16 19:09:28,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184646191] [2020-01-16 19:09:28,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:28,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:28,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759296200] [2020-01-16 19:09:28,879 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:28,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:28,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:28,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:28,879 INFO L87 Difference]: Start difference. First operand 374 states and 1273 transitions. Second operand 9 states. [2020-01-16 19:09:28,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:28,981 INFO L93 Difference]: Finished difference Result 557 states and 1630 transitions. [2020-01-16 19:09:28,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:28,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:28,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:28,982 INFO L225 Difference]: With dead ends: 557 [2020-01-16 19:09:28,983 INFO L226 Difference]: Without dead ends: 544 [2020-01-16 19:09:28,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:28,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-01-16 19:09:28,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 371. [2020-01-16 19:09:28,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:09:28,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1268 transitions. [2020-01-16 19:09:28,991 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1268 transitions. Word has length 22 [2020-01-16 19:09:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:28,991 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1268 transitions. [2020-01-16 19:09:28,991 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:28,991 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1268 transitions. [2020-01-16 19:09:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:28,992 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:28,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, 1, 1, 1] [2020-01-16 19:09:28,992 INFO L426 AbstractCegarLoop]: === Iteration 1585 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:28,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:28,992 INFO L82 PathProgramCache]: Analyzing trace with hash -756584044, now seen corresponding path program 1579 times [2020-01-16 19:09:28,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:28,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798817237] [2020-01-16 19:09:28,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:29,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-01-16 19:09:29,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798817237] [2020-01-16 19:09:29,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:29,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:29,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903132758] [2020-01-16 19:09:29,271 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:29,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:29,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:29,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:29,271 INFO L87 Difference]: Start difference. First operand 371 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:09:29,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:29,371 INFO L93 Difference]: Finished difference Result 551 states and 1621 transitions. [2020-01-16 19:09:29,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:29,371 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:29,372 INFO L225 Difference]: With dead ends: 551 [2020-01-16 19:09:29,372 INFO L226 Difference]: Without dead ends: 540 [2020-01-16 19:09:29,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:29,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-01-16 19:09:29,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 373. [2020-01-16 19:09:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-01-16 19:09:29,382 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-01-16 19:09:29,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:29,382 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-01-16 19:09:29,382 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:29,382 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-01-16 19:09:29,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:29,382 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:29,382 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:29,382 INFO L426 AbstractCegarLoop]: === Iteration 1586 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:29,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:29,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2092866242, now seen corresponding path program 1580 times [2020-01-16 19:09:29,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:29,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715664634] [2020-01-16 19:09:29,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:29,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715664634] [2020-01-16 19:09:29,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:29,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:29,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557676087] [2020-01-16 19:09:29,666 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:29,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:29,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:29,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:29,667 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-01-16 19:09:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:29,745 INFO L93 Difference]: Finished difference Result 549 states and 1616 transitions. [2020-01-16 19:09:29,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:29,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:29,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:29,747 INFO L225 Difference]: With dead ends: 549 [2020-01-16 19:09:29,747 INFO L226 Difference]: Without dead ends: 539 [2020-01-16 19:09:29,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:29,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-01-16 19:09:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 372. [2020-01-16 19:09:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:09:29,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1270 transitions. [2020-01-16 19:09:29,755 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1270 transitions. Word has length 22 [2020-01-16 19:09:29,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:29,755 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1270 transitions. [2020-01-16 19:09:29,755 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:29,755 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1270 transitions. [2020-01-16 19:09:29,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:29,756 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:29,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, 1, 1, 1] [2020-01-16 19:09:29,756 INFO L426 AbstractCegarLoop]: === Iteration 1587 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:29,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:29,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1937945398, now seen corresponding path program 1581 times [2020-01-16 19:09:29,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:29,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236945442] [2020-01-16 19:09:29,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:30,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236945442] [2020-01-16 19:09:30,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:30,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:30,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742389325] [2020-01-16 19:09:30,034 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:30,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:30,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:30,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:30,035 INFO L87 Difference]: Start difference. First operand 372 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:09:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:30,148 INFO L93 Difference]: Finished difference Result 553 states and 1625 transitions. [2020-01-16 19:09:30,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:30,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:30,149 INFO L225 Difference]: With dead ends: 553 [2020-01-16 19:09:30,149 INFO L226 Difference]: Without dead ends: 542 [2020-01-16 19:09:30,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:30,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-01-16 19:09:30,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 374. [2020-01-16 19:09:30,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:09:30,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1273 transitions. [2020-01-16 19:09:30,158 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1273 transitions. Word has length 22 [2020-01-16 19:09:30,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:30,158 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1273 transitions. [2020-01-16 19:09:30,158 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:30,158 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1273 transitions. [2020-01-16 19:09:30,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:30,159 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:30,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, 1, 1, 1] [2020-01-16 19:09:30,159 INFO L426 AbstractCegarLoop]: === Iteration 1588 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:30,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:30,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2103929146, now seen corresponding path program 1582 times [2020-01-16 19:09:30,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:30,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387871653] [2020-01-16 19:09:30,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:30,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-01-16 19:09:30,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387871653] [2020-01-16 19:09:30,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:30,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:30,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196567150] [2020-01-16 19:09:30,439 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:30,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:30,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:30,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:30,440 INFO L87 Difference]: Start difference. First operand 374 states and 1273 transitions. Second operand 9 states. [2020-01-16 19:09:30,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:30,558 INFO L93 Difference]: Finished difference Result 552 states and 1621 transitions. [2020-01-16 19:09:30,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:30,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:30,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:30,560 INFO L225 Difference]: With dead ends: 552 [2020-01-16 19:09:30,560 INFO L226 Difference]: Without dead ends: 540 [2020-01-16 19:09:30,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:30,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-01-16 19:09:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 372. [2020-01-16 19:09:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:09:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1269 transitions. [2020-01-16 19:09:30,569 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1269 transitions. Word has length 22 [2020-01-16 19:09:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:30,569 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1269 transitions. [2020-01-16 19:09:30,569 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:30,569 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1269 transitions. [2020-01-16 19:09:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:30,570 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:30,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, 1, 1, 1] [2020-01-16 19:09:30,570 INFO L426 AbstractCegarLoop]: === Iteration 1589 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:30,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:30,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1108009466, now seen corresponding path program 1583 times [2020-01-16 19:09:30,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:30,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285253193] [2020-01-16 19:09:30,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:30,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:30,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285253193] [2020-01-16 19:09:30,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:30,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:30,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741047063] [2020-01-16 19:09:30,854 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:30,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:30,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:30,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:30,854 INFO L87 Difference]: Start difference. First operand 372 states and 1269 transitions. Second operand 9 states. [2020-01-16 19:09:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:30,931 INFO L93 Difference]: Finished difference Result 548 states and 1613 transitions. [2020-01-16 19:09:30,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:30,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:30,933 INFO L225 Difference]: With dead ends: 548 [2020-01-16 19:09:30,933 INFO L226 Difference]: Without dead ends: 539 [2020-01-16 19:09:30,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:30,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-01-16 19:09:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 373. [2020-01-16 19:09:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-01-16 19:09:30,943 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-01-16 19:09:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:30,943 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-01-16 19:09:30,943 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:30,943 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-01-16 19:09:30,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:30,944 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:30,944 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:30,944 INFO L426 AbstractCegarLoop]: === Iteration 1590 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:30,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:30,944 INFO L82 PathProgramCache]: Analyzing trace with hash 502931492, now seen corresponding path program 1584 times [2020-01-16 19:09:30,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:30,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137944202] [2020-01-16 19:09:30,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:31,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-01-16 19:09:31,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137944202] [2020-01-16 19:09:31,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:31,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:31,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040096046] [2020-01-16 19:09:31,228 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:31,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:31,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:31,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:31,228 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:09:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:31,334 INFO L93 Difference]: Finished difference Result 549 states and 1614 transitions. [2020-01-16 19:09:31,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:31,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:31,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:31,335 INFO L225 Difference]: With dead ends: 549 [2020-01-16 19:09:31,335 INFO L226 Difference]: Without dead ends: 535 [2020-01-16 19:09:31,336 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:31,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-01-16 19:09:31,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 369. [2020-01-16 19:09:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-01-16 19:09:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1264 transitions. [2020-01-16 19:09:31,344 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1264 transitions. Word has length 22 [2020-01-16 19:09:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:31,344 INFO L478 AbstractCegarLoop]: Abstraction has 369 states and 1264 transitions. [2020-01-16 19:09:31,344 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:31,344 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1264 transitions. [2020-01-16 19:09:31,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:31,345 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09: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, 1, 1, 1] [2020-01-16 19:09:31,345 INFO L426 AbstractCegarLoop]: === Iteration 1591 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:31,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:31,345 INFO L82 PathProgramCache]: Analyzing trace with hash 607420976, now seen corresponding path program 1585 times [2020-01-16 19:09:31,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:31,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564836903] [2020-01-16 19:09:31,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:31,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-01-16 19:09:31,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564836903] [2020-01-16 19:09:31,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:31,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:31,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704875206] [2020-01-16 19:09:31,599 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:31,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:31,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:31,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:31,599 INFO L87 Difference]: Start difference. First operand 369 states and 1264 transitions. Second operand 9 states. [2020-01-16 19:09:31,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:31,677 INFO L93 Difference]: Finished difference Result 582 states and 1692 transitions. [2020-01-16 19:09:31,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:31,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:31,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:31,679 INFO L225 Difference]: With dead ends: 582 [2020-01-16 19:09:31,679 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:09:31,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:31,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:09:31,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 377. [2020-01-16 19:09:31,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:09:31,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1284 transitions. [2020-01-16 19:09:31,688 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1284 transitions. Word has length 22 [2020-01-16 19:09:31,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:31,688 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1284 transitions. [2020-01-16 19:09:31,688 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:31,688 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1284 transitions. [2020-01-16 19:09:31,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:31,689 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:31,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, 1, 1, 1] [2020-01-16 19:09:31,689 INFO L426 AbstractCegarLoop]: === Iteration 1592 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:31,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:31,689 INFO L82 PathProgramCache]: Analyzing trace with hash -2097280434, now seen corresponding path program 1586 times [2020-01-16 19:09:31,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:31,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363424960] [2020-01-16 19:09:31,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:31,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363424960] [2020-01-16 19:09:31,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:31,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:31,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376285559] [2020-01-16 19:09:31,939 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:31,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:31,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:31,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:31,939 INFO L87 Difference]: Start difference. First operand 377 states and 1284 transitions. Second operand 9 states. [2020-01-16 19:09:32,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:32,042 INFO L93 Difference]: Finished difference Result 577 states and 1679 transitions. [2020-01-16 19:09:32,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:32,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:32,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:32,044 INFO L225 Difference]: With dead ends: 577 [2020-01-16 19:09:32,044 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:09:32,044 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:32,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:09:32,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 373. [2020-01-16 19:09:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1276 transitions. [2020-01-16 19:09:32,054 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1276 transitions. Word has length 22 [2020-01-16 19:09:32,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:32,054 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1276 transitions. [2020-01-16 19:09:32,054 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:32,054 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1276 transitions. [2020-01-16 19:09:32,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:32,054 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:32,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, 1, 1, 1] [2020-01-16 19:09:32,054 INFO L426 AbstractCegarLoop]: === Iteration 1593 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:32,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:32,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1959971296, now seen corresponding path program 1587 times [2020-01-16 19:09:32,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:32,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824376276] [2020-01-16 19:09:32,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:32,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824376276] [2020-01-16 19:09:32,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:32,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:32,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479246964] [2020-01-16 19:09:32,304 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:32,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:32,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:32,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:32,305 INFO L87 Difference]: Start difference. First operand 373 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:09:32,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:32,383 INFO L93 Difference]: Finished difference Result 578 states and 1680 transitions. [2020-01-16 19:09:32,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:32,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:32,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:32,384 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:09:32,384 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:09:32,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:32,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:09:32,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 375. [2020-01-16 19:09:32,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:32,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1278 transitions. [2020-01-16 19:09:32,393 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1278 transitions. Word has length 22 [2020-01-16 19:09:32,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:32,393 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1278 transitions. [2020-01-16 19:09:32,393 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:32,393 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1278 transitions. [2020-01-16 19:09:32,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:32,393 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:32,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, 1, 1, 1] [2020-01-16 19:09:32,394 INFO L426 AbstractCegarLoop]: === Iteration 1594 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:32,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:32,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1773927508, now seen corresponding path program 1588 times [2020-01-16 19:09:32,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:32,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341715932] [2020-01-16 19:09:32,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:32,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341715932] [2020-01-16 19:09:32,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:32,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:32,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270465867] [2020-01-16 19:09:32,643 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:32,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:32,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:32,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:32,643 INFO L87 Difference]: Start difference. First operand 375 states and 1278 transitions. Second operand 9 states. [2020-01-16 19:09:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:32,725 INFO L93 Difference]: Finished difference Result 571 states and 1665 transitions. [2020-01-16 19:09:32,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:32,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:32,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:32,727 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:09:32,727 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:09:32,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:09:32,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 373. [2020-01-16 19:09:32,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1274 transitions. [2020-01-16 19:09:32,736 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1274 transitions. Word has length 22 [2020-01-16 19:09:32,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:32,736 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1274 transitions. [2020-01-16 19:09:32,736 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1274 transitions. [2020-01-16 19:09:32,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:32,737 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:32,737 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:32,737 INFO L426 AbstractCegarLoop]: === Iteration 1595 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:32,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:32,737 INFO L82 PathProgramCache]: Analyzing trace with hash 765681090, now seen corresponding path program 1589 times [2020-01-16 19:09:32,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:32,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858123682] [2020-01-16 19:09:32,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:33,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858123682] [2020-01-16 19:09:33,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:33,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:33,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262059418] [2020-01-16 19:09:33,008 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:33,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:33,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:33,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:33,008 INFO L87 Difference]: Start difference. First operand 373 states and 1274 transitions. Second operand 9 states. [2020-01-16 19:09:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:33,108 INFO L93 Difference]: Finished difference Result 567 states and 1658 transitions. [2020-01-16 19:09:33,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:33,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:33,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:33,110 INFO L225 Difference]: With dead ends: 567 [2020-01-16 19:09:33,110 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:09:33,110 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:33,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:09:33,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 374. [2020-01-16 19:09:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:09:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1275 transitions. [2020-01-16 19:09:33,118 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1275 transitions. Word has length 22 [2020-01-16 19:09:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:33,118 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1275 transitions. [2020-01-16 19:09:33,118 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:33,119 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1275 transitions. [2020-01-16 19:09:33,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:33,119 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:33,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, 1, 1, 1] [2020-01-16 19:09:33,119 INFO L426 AbstractCegarLoop]: === Iteration 1596 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:33,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:33,119 INFO L82 PathProgramCache]: Analyzing trace with hash -679835920, now seen corresponding path program 1590 times [2020-01-16 19:09:33,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:33,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093066021] [2020-01-16 19:09:33,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:33,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:33,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093066021] [2020-01-16 19:09:33,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:33,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:33,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185076459] [2020-01-16 19:09:33,378 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:33,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:33,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:33,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:33,379 INFO L87 Difference]: Start difference. First operand 374 states and 1275 transitions. Second operand 9 states. [2020-01-16 19:09:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:33,459 INFO L93 Difference]: Finished difference Result 565 states and 1653 transitions. [2020-01-16 19:09:33,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:33,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:33,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:33,461 INFO L225 Difference]: With dead ends: 565 [2020-01-16 19:09:33,461 INFO L226 Difference]: Without dead ends: 553 [2020-01-16 19:09:33,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:33,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-01-16 19:09:33,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 371. [2020-01-16 19:09:33,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:09:33,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1270 transitions. [2020-01-16 19:09:33,469 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1270 transitions. Word has length 22 [2020-01-16 19:09:33,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:33,469 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1270 transitions. [2020-01-16 19:09:33,469 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:33,469 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1270 transitions. [2020-01-16 19:09:33,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:33,470 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:33,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, 1, 1, 1] [2020-01-16 19:09:33,470 INFO L426 AbstractCegarLoop]: === Iteration 1597 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:33,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:33,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1997603416, now seen corresponding path program 1591 times [2020-01-16 19:09:33,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:33,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787067822] [2020-01-16 19:09:33,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:33,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787067822] [2020-01-16 19:09:33,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:33,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:33,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031444429] [2020-01-16 19:09:33,727 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:33,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:33,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:33,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:33,727 INFO L87 Difference]: Start difference. First operand 371 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:09:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:33,804 INFO L93 Difference]: Finished difference Result 590 states and 1714 transitions. [2020-01-16 19:09:33,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:33,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:33,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:33,806 INFO L225 Difference]: With dead ends: 590 [2020-01-16 19:09:33,806 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:09:33,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:33,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:09:33,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 379. [2020-01-16 19:09:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:09:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1290 transitions. [2020-01-16 19:09:33,815 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1290 transitions. Word has length 22 [2020-01-16 19:09:33,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:33,815 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1290 transitions. [2020-01-16 19:09:33,815 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:33,815 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1290 transitions. [2020-01-16 19:09:33,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:33,816 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:33,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, 1, 1, 1] [2020-01-16 19:09:33,816 INFO L426 AbstractCegarLoop]: === Iteration 1598 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:33,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:33,816 INFO L82 PathProgramCache]: Analyzing trace with hash -407337530, now seen corresponding path program 1592 times [2020-01-16 19:09:33,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:33,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664843877] [2020-01-16 19:09:33,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:34,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664843877] [2020-01-16 19:09:34,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:34,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:34,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873367548] [2020-01-16 19:09:34,065 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:34,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:34,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:34,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:34,066 INFO L87 Difference]: Start difference. First operand 379 states and 1290 transitions. Second operand 9 states. [2020-01-16 19:09:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:34,167 INFO L93 Difference]: Finished difference Result 585 states and 1701 transitions. [2020-01-16 19:09:34,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:34,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:34,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:34,169 INFO L225 Difference]: With dead ends: 585 [2020-01-16 19:09:34,169 INFO L226 Difference]: Without dead ends: 570 [2020-01-16 19:09:34,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:34,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-01-16 19:09:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 375. [2020-01-16 19:09:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1280 transitions. [2020-01-16 19:09:34,179 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1280 transitions. Word has length 22 [2020-01-16 19:09:34,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:34,179 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1280 transitions. [2020-01-16 19:09:34,179 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:34,179 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1280 transitions. [2020-01-16 19:09:34,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:34,179 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:34,179 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:34,180 INFO L426 AbstractCegarLoop]: === Iteration 1599 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:34,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:34,180 INFO L82 PathProgramCache]: Analyzing trace with hash -665040488, now seen corresponding path program 1593 times [2020-01-16 19:09:34,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:34,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784142203] [2020-01-16 19:09:34,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:34,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784142203] [2020-01-16 19:09:34,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:34,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:34,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749523056] [2020-01-16 19:09:34,440 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:34,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:34,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:34,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:34,440 INFO L87 Difference]: Start difference. First operand 375 states and 1280 transitions. Second operand 9 states. [2020-01-16 19:09:34,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:34,517 INFO L93 Difference]: Finished difference Result 586 states and 1706 transitions. [2020-01-16 19:09:34,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:34,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:34,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:34,519 INFO L225 Difference]: With dead ends: 586 [2020-01-16 19:09:34,519 INFO L226 Difference]: Without dead ends: 570 [2020-01-16 19:09:34,519 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:34,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-01-16 19:09:34,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 381. [2020-01-16 19:09:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:09:34,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1290 transitions. [2020-01-16 19:09:34,527 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1290 transitions. Word has length 22 [2020-01-16 19:09:34,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:34,528 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1290 transitions. [2020-01-16 19:09:34,528 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:34,528 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1290 transitions. [2020-01-16 19:09:34,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:34,528 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:34,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, 1, 1, 1] [2020-01-16 19:09:34,528 INFO L426 AbstractCegarLoop]: === Iteration 1600 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:34,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:34,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2038826780, now seen corresponding path program 1594 times [2020-01-16 19:09:34,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:34,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329728387] [2020-01-16 19:09:34,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:34,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-01-16 19:09:34,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329728387] [2020-01-16 19:09:34,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:34,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:34,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639792360] [2020-01-16 19:09:34,784 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:34,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:34,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:34,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:34,785 INFO L87 Difference]: Start difference. First operand 381 states and 1290 transitions. Second operand 9 states. [2020-01-16 19:09:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:34,889 INFO L93 Difference]: Finished difference Result 574 states and 1687 transitions. [2020-01-16 19:09:34,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:34,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:34,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:34,890 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:09:34,891 INFO L226 Difference]: Without dead ends: 555 [2020-01-16 19:09:34,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:34,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-01-16 19:09:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 375. [2020-01-16 19:09:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-01-16 19:09:34,899 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-01-16 19:09:34,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:34,899 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-01-16 19:09:34,899 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:34,899 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-01-16 19:09:34,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:34,900 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:34,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:34,900 INFO L426 AbstractCegarLoop]: === Iteration 1601 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:34,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:34,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1880336902, now seen corresponding path program 1595 times [2020-01-16 19:09:34,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:34,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299805699] [2020-01-16 19:09:34,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:35,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-01-16 19:09:35,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299805699] [2020-01-16 19:09:35,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:35,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:35,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134846745] [2020-01-16 19:09:35,153 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:35,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:35,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:35,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:35,153 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:09:35,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:35,255 INFO L93 Difference]: Finished difference Result 578 states and 1685 transitions. [2020-01-16 19:09:35,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:35,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:35,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:35,257 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:09:35,257 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 19:09:35,257 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:35,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 19:09:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 378. [2020-01-16 19:09:35,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:09:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1281 transitions. [2020-01-16 19:09:35,267 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1281 transitions. Word has length 22 [2020-01-16 19:09:35,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:35,267 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1281 transitions. [2020-01-16 19:09:35,267 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:35,267 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1281 transitions. [2020-01-16 19:09:35,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:35,267 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:35,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, 1, 1, 1] [2020-01-16 19:09:35,268 INFO L426 AbstractCegarLoop]: === Iteration 1602 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:35,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:35,268 INFO L82 PathProgramCache]: Analyzing trace with hash -151289568, now seen corresponding path program 1596 times [2020-01-16 19:09:35,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:35,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438272407] [2020-01-16 19:09:35,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:35,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:35,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438272407] [2020-01-16 19:09:35,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:35,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:35,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717801981] [2020-01-16 19:09:35,516 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:35,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:35,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:35,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:35,517 INFO L87 Difference]: Start difference. First operand 378 states and 1281 transitions. Second operand 9 states. [2020-01-16 19:09:35,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:35,621 INFO L93 Difference]: Finished difference Result 571 states and 1678 transitions. [2020-01-16 19:09:35,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:35,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:35,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:35,623 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:09:35,623 INFO L226 Difference]: Without dead ends: 551 [2020-01-16 19:09:35,623 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:35,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-01-16 19:09:35,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 371. [2020-01-16 19:09:35,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:09:35,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1268 transitions. [2020-01-16 19:09:35,632 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1268 transitions. Word has length 22 [2020-01-16 19:09:35,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:35,632 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1268 transitions. [2020-01-16 19:09:35,632 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1268 transitions. [2020-01-16 19:09:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:35,632 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:35,632 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:35,632 INFO L426 AbstractCegarLoop]: === Iteration 1603 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:35,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:35,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1281391072, now seen corresponding path program 1597 times [2020-01-16 19:09:35,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:35,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861003025] [2020-01-16 19:09:35,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:35,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861003025] [2020-01-16 19:09:35,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:35,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:35,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622509483] [2020-01-16 19:09:35,880 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:35,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:35,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:35,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:35,881 INFO L87 Difference]: Start difference. First operand 371 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:09:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:35,972 INFO L93 Difference]: Finished difference Result 580 states and 1684 transitions. [2020-01-16 19:09:35,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:35,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:35,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:35,974 INFO L225 Difference]: With dead ends: 580 [2020-01-16 19:09:35,974 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 19:09:35,974 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:35,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 19:09:35,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 375. [2020-01-16 19:09:35,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-01-16 19:09:35,983 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-01-16 19:09:35,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:35,983 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-01-16 19:09:35,983 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-01-16 19:09:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:35,984 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:35,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, 1, 1, 1] [2020-01-16 19:09:35,984 INFO L426 AbstractCegarLoop]: === Iteration 1604 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:35,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:35,984 INFO L82 PathProgramCache]: Analyzing trace with hash -720322580, now seen corresponding path program 1598 times [2020-01-16 19:09:35,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:35,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230585667] [2020-01-16 19:09:35,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:36,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-01-16 19:09:36,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230585667] [2020-01-16 19:09:36,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:36,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:36,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889876243] [2020-01-16 19:09:36,230 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:36,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:36,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:36,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:36,230 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:09:36,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:36,310 INFO L93 Difference]: Finished difference Result 573 states and 1669 transitions. [2020-01-16 19:09:36,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:36,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:36,311 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:09:36,311 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:09:36,312 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:36,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:09:36,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 373. [2020-01-16 19:09:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-01-16 19:09:36,320 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-01-16 19:09:36,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:36,320 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-01-16 19:09:36,320 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-01-16 19:09:36,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:36,321 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:36,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, 1, 1, 1] [2020-01-16 19:09:36,321 INFO L426 AbstractCegarLoop]: === Iteration 1605 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:36,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:36,321 INFO L82 PathProgramCache]: Analyzing trace with hash 825393048, now seen corresponding path program 1599 times [2020-01-16 19:09:36,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:36,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987920107] [2020-01-16 19:09:36,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:36,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-01-16 19:09:36,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987920107] [2020-01-16 19:09:36,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:36,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:36,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764152122] [2020-01-16 19:09:36,582 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:36,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:36,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:36,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:36,582 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-01-16 19:09:36,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:36,671 INFO L93 Difference]: Finished difference Result 580 states and 1688 transitions. [2020-01-16 19:09:36,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:36,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:36,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:36,672 INFO L225 Difference]: With dead ends: 580 [2020-01-16 19:09:36,672 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 19:09:36,673 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:36,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 19:09:36,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 379. [2020-01-16 19:09:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:09:36,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1282 transitions. [2020-01-16 19:09:36,681 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1282 transitions. Word has length 22 [2020-01-16 19:09:36,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:36,682 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1282 transitions. [2020-01-16 19:09:36,682 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1282 transitions. [2020-01-16 19:09:36,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:36,682 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:36,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, 1, 1, 1] [2020-01-16 19:09:36,682 INFO L426 AbstractCegarLoop]: === Iteration 1606 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:36,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:36,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1018213740, now seen corresponding path program 1600 times [2020-01-16 19:09:36,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:36,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020197285] [2020-01-16 19:09:36,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:36,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:36,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020197285] [2020-01-16 19:09:36,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:36,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:36,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879286801] [2020-01-16 19:09:36,938 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:36,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:36,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:36,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:36,938 INFO L87 Difference]: Start difference. First operand 379 states and 1282 transitions. Second operand 9 states. [2020-01-16 19:09:37,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:37,038 INFO L93 Difference]: Finished difference Result 568 states and 1669 transitions. [2020-01-16 19:09:37,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:37,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:37,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:37,040 INFO L225 Difference]: With dead ends: 568 [2020-01-16 19:09:37,040 INFO L226 Difference]: Without dead ends: 549 [2020-01-16 19:09:37,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-01-16 19:09:37,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 373. [2020-01-16 19:09:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-01-16 19:09:37,048 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-01-16 19:09:37,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:37,048 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-01-16 19:09:37,049 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-01-16 19:09:37,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:37,049 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:37,049 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:37,049 INFO L426 AbstractCegarLoop]: === Iteration 1607 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:37,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:37,049 INFO L82 PathProgramCache]: Analyzing trace with hash 880115274, now seen corresponding path program 1601 times [2020-01-16 19:09:37,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:37,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413807736] [2020-01-16 19:09:37,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:37,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-01-16 19:09:37,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413807736] [2020-01-16 19:09:37,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:37,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:37,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747338192] [2020-01-16 19:09:37,301 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:37,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:37,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:37,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:37,302 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:09:37,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:37,385 INFO L93 Difference]: Finished difference Result 568 states and 1659 transitions. [2020-01-16 19:09:37,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:37,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:37,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:37,387 INFO L225 Difference]: With dead ends: 568 [2020-01-16 19:09:37,387 INFO L226 Difference]: Without dead ends: 559 [2020-01-16 19:09:37,387 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:37,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-01-16 19:09:37,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 374. [2020-01-16 19:09:37,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:09:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1271 transitions. [2020-01-16 19:09:37,396 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1271 transitions. Word has length 22 [2020-01-16 19:09:37,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:37,396 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1271 transitions. [2020-01-16 19:09:37,397 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:37,397 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1271 transitions. [2020-01-16 19:09:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:37,397 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:37,397 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:37,397 INFO L426 AbstractCegarLoop]: === Iteration 1608 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:37,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:37,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1268681262, now seen corresponding path program 1602 times [2020-01-16 19:09:37,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:37,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954700746] [2020-01-16 19:09:37,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:37,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954700746] [2020-01-16 19:09:37,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:37,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:37,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601527062] [2020-01-16 19:09:37,642 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:37,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:37,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:37,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:37,643 INFO L87 Difference]: Start difference. First operand 374 states and 1271 transitions. Second operand 9 states. [2020-01-16 19:09:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:37,764 INFO L93 Difference]: Finished difference Result 563 states and 1658 transitions. [2020-01-16 19:09:37,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:37,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:37,766 INFO L225 Difference]: With dead ends: 563 [2020-01-16 19:09:37,766 INFO L226 Difference]: Without dead ends: 547 [2020-01-16 19:09:37,767 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:37,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-01-16 19:09:37,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 371. [2020-01-16 19:09:37,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:09:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1266 transitions. [2020-01-16 19:09:37,775 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1266 transitions. Word has length 22 [2020-01-16 19:09:37,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:37,775 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1266 transitions. [2020-01-16 19:09:37,775 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:37,775 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1266 transitions. [2020-01-16 19:09:37,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:37,775 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:37,776 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:37,776 INFO L426 AbstractCegarLoop]: === Iteration 1609 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:37,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:37,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1376386878, now seen corresponding path program 1603 times [2020-01-16 19:09:37,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:37,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998930917] [2020-01-16 19:09:37,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:38,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998930917] [2020-01-16 19:09:38,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:38,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:38,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000700043] [2020-01-16 19:09:38,031 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:38,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:38,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:38,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:38,031 INFO L87 Difference]: Start difference. First operand 371 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:09:38,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:38,136 INFO L93 Difference]: Finished difference Result 560 states and 1642 transitions. [2020-01-16 19:09:38,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:38,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:38,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:38,138 INFO L225 Difference]: With dead ends: 560 [2020-01-16 19:09:38,138 INFO L226 Difference]: Without dead ends: 549 [2020-01-16 19:09:38,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:38,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-01-16 19:09:38,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 373. [2020-01-16 19:09:38,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:38,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-01-16 19:09:38,148 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-01-16 19:09:38,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:38,148 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-01-16 19:09:38,148 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:38,148 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-01-16 19:09:38,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:38,148 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:38,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, 1, 1, 1] [2020-01-16 19:09:38,149 INFO L426 AbstractCegarLoop]: === Iteration 1610 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:38,149 INFO L82 PathProgramCache]: Analyzing trace with hash -69130132, now seen corresponding path program 1604 times [2020-01-16 19:09:38,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:38,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347899489] [2020-01-16 19:09:38,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:38,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347899489] [2020-01-16 19:09:38,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:38,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:38,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906552236] [2020-01-16 19:09:38,419 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:38,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:38,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:38,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:38,419 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:09:38,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:38,505 INFO L93 Difference]: Finished difference Result 558 states and 1637 transitions. [2020-01-16 19:09:38,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:38,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:38,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:38,507 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:09:38,507 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:09:38,507 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:38,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:09:38,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 372. [2020-01-16 19:09:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:09:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1268 transitions. [2020-01-16 19:09:38,516 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1268 transitions. Word has length 22 [2020-01-16 19:09:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:38,517 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1268 transitions. [2020-01-16 19:09:38,517 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:38,517 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1268 transitions. [2020-01-16 19:09:38,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:38,517 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:38,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, 1, 1, 1] [2020-01-16 19:09:38,517 INFO L426 AbstractCegarLoop]: === Iteration 1611 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:38,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:38,518 INFO L82 PathProgramCache]: Analyzing trace with hash -811796298, now seen corresponding path program 1605 times [2020-01-16 19:09:38,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:38,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013322674] [2020-01-16 19:09:38,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:38,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-01-16 19:09:38,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013322674] [2020-01-16 19:09:38,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:38,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:38,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626278006] [2020-01-16 19:09:38,772 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:38,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:38,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:38,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:38,772 INFO L87 Difference]: Start difference. First operand 372 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:09:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:38,871 INFO L93 Difference]: Finished difference Result 563 states and 1650 transitions. [2020-01-16 19:09:38,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:38,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:38,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:38,873 INFO L225 Difference]: With dead ends: 563 [2020-01-16 19:09:38,873 INFO L226 Difference]: Without dead ends: 552 [2020-01-16 19:09:38,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:38,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-01-16 19:09:38,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 375. [2020-01-16 19:09:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1273 transitions. [2020-01-16 19:09:38,881 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1273 transitions. Word has length 22 [2020-01-16 19:09:38,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:38,881 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1273 transitions. [2020-01-16 19:09:38,882 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1273 transitions. [2020-01-16 19:09:38,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:38,882 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:38,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, 1, 1, 1] [2020-01-16 19:09:38,882 INFO L426 AbstractCegarLoop]: === Iteration 1612 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:38,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:38,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1593795540, now seen corresponding path program 1606 times [2020-01-16 19:09:38,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:38,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700679087] [2020-01-16 19:09:38,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:39,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:39,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700679087] [2020-01-16 19:09:39,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:39,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:39,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974603437] [2020-01-16 19:09:39,130 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:39,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:39,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:39,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:39,131 INFO L87 Difference]: Start difference. First operand 375 states and 1273 transitions. Second operand 9 states. [2020-01-16 19:09:39,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:39,233 INFO L93 Difference]: Finished difference Result 556 states and 1643 transitions. [2020-01-16 19:09:39,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:39,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:39,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:39,235 INFO L225 Difference]: With dead ends: 556 [2020-01-16 19:09:39,235 INFO L226 Difference]: Without dead ends: 540 [2020-01-16 19:09:39,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-01-16 19:09:39,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 372. [2020-01-16 19:09:39,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:09:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1267 transitions. [2020-01-16 19:09:39,243 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1267 transitions. Word has length 22 [2020-01-16 19:09:39,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:39,243 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1267 transitions. [2020-01-16 19:09:39,244 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:39,244 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1267 transitions. [2020-01-16 19:09:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:39,244 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:39,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, 1, 1, 1] [2020-01-16 19:09:39,244 INFO L426 AbstractCegarLoop]: === Iteration 1613 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:39,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:39,244 INFO L82 PathProgramCache]: Analyzing trace with hash 437216134, now seen corresponding path program 1607 times [2020-01-16 19:09:39,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:39,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872754377] [2020-01-16 19:09:39,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:39,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872754377] [2020-01-16 19:09:39,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:39,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:39,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959861232] [2020-01-16 19:09:39,500 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:39,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:39,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:39,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:39,500 INFO L87 Difference]: Start difference. First operand 372 states and 1267 transitions. Second operand 9 states. [2020-01-16 19:09:39,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:39,579 INFO L93 Difference]: Finished difference Result 559 states and 1639 transitions. [2020-01-16 19:09:39,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:39,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:39,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:39,580 INFO L225 Difference]: With dead ends: 559 [2020-01-16 19:09:39,581 INFO L226 Difference]: Without dead ends: 550 [2020-01-16 19:09:39,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:39,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-01-16 19:09:39,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 373. [2020-01-16 19:09:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-01-16 19:09:39,590 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-01-16 19:09:39,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:39,590 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-01-16 19:09:39,590 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:39,590 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-01-16 19:09:39,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:39,590 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:39,590 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:39,591 INFO L426 AbstractCegarLoop]: === Iteration 1614 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:39,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:39,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1711580402, now seen corresponding path program 1608 times [2020-01-16 19:09:39,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:39,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345167711] [2020-01-16 19:09:39,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:39,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:39,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345167711] [2020-01-16 19:09:39,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:39,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:39,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829604890] [2020-01-16 19:09:39,844 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:39,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:39,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:39,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:39,845 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:09:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:39,948 INFO L93 Difference]: Finished difference Result 554 states and 1638 transitions. [2020-01-16 19:09:39,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:39,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:39,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:39,950 INFO L225 Difference]: With dead ends: 554 [2020-01-16 19:09:39,950 INFO L226 Difference]: Without dead ends: 537 [2020-01-16 19:09:39,950 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-01-16 19:09:39,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 369. [2020-01-16 19:09:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-01-16 19:09:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1262 transitions. [2020-01-16 19:09:39,958 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1262 transitions. Word has length 22 [2020-01-16 19:09:39,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:39,958 INFO L478 AbstractCegarLoop]: Abstraction has 369 states and 1262 transitions. [2020-01-16 19:09:39,958 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:39,958 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1262 transitions. [2020-01-16 19:09:39,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:39,959 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:39,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, 1, 1, 1] [2020-01-16 19:09:39,959 INFO L426 AbstractCegarLoop]: === Iteration 1615 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:39,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:39,959 INFO L82 PathProgramCache]: Analyzing trace with hash -27220368, now seen corresponding path program 1609 times [2020-01-16 19:09:39,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:39,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398228676] [2020-01-16 19:09:39,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:40,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-01-16 19:09:40,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398228676] [2020-01-16 19:09:40,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:40,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:40,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107976583] [2020-01-16 19:09:40,211 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:40,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:40,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:40,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:40,211 INFO L87 Difference]: Start difference. First operand 369 states and 1262 transitions. Second operand 9 states. [2020-01-16 19:09:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:40,305 INFO L93 Difference]: Finished difference Result 593 states and 1726 transitions. [2020-01-16 19:09:40,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:40,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:40,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:40,306 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:09:40,307 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:09:40,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:09:40,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 379. [2020-01-16 19:09:40,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:09:40,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1291 transitions. [2020-01-16 19:09:40,316 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1291 transitions. Word has length 22 [2020-01-16 19:09:40,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:40,316 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1291 transitions. [2020-01-16 19:09:40,316 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:40,316 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1291 transitions. [2020-01-16 19:09:40,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:40,317 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:40,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, 1, 1, 1] [2020-01-16 19:09:40,317 INFO L426 AbstractCegarLoop]: === Iteration 1616 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:40,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:40,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1563045518, now seen corresponding path program 1610 times [2020-01-16 19:09:40,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:40,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394292380] [2020-01-16 19:09:40,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:40,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394292380] [2020-01-16 19:09:40,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:40,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:40,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428912925] [2020-01-16 19:09:40,567 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:40,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:40,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:40,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:40,567 INFO L87 Difference]: Start difference. First operand 379 states and 1291 transitions. Second operand 9 states. [2020-01-16 19:09:40,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:40,673 INFO L93 Difference]: Finished difference Result 588 states and 1713 transitions. [2020-01-16 19:09:40,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:40,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:40,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:40,674 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:09:40,675 INFO L226 Difference]: Without dead ends: 573 [2020-01-16 19:09:40,675 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:40,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-01-16 19:09:40,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 375. [2020-01-16 19:09:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1282 transitions. [2020-01-16 19:09:40,684 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1282 transitions. Word has length 22 [2020-01-16 19:09:40,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:40,684 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1282 transitions. [2020-01-16 19:09:40,684 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:40,684 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1282 transitions. [2020-01-16 19:09:40,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:40,684 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:40,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, 1, 1, 1] [2020-01-16 19:09:40,685 INFO L426 AbstractCegarLoop]: === Iteration 1617 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:40,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:40,685 INFO L82 PathProgramCache]: Analyzing trace with hash 73691804, now seen corresponding path program 1611 times [2020-01-16 19:09:40,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:40,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327418813] [2020-01-16 19:09:40,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:40,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-01-16 19:09:40,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327418813] [2020-01-16 19:09:40,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:40,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:40,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566628511] [2020-01-16 19:09:40,941 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:40,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:40,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:40,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:40,941 INFO L87 Difference]: Start difference. First operand 375 states and 1282 transitions. Second operand 9 states. [2020-01-16 19:09:41,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:41,017 INFO L93 Difference]: Finished difference Result 591 states and 1718 transitions. [2020-01-16 19:09:41,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:41,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:41,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:41,018 INFO L225 Difference]: With dead ends: 591 [2020-01-16 19:09:41,018 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:09:41,019 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:09:41,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 378. [2020-01-16 19:09:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:09:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1286 transitions. [2020-01-16 19:09:41,027 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1286 transitions. Word has length 22 [2020-01-16 19:09:41,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:41,027 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1286 transitions. [2020-01-16 19:09:41,027 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:41,027 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1286 transitions. [2020-01-16 19:09:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:41,028 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:41,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:41,028 INFO L426 AbstractCegarLoop]: === Iteration 1618 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:41,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:41,028 INFO L82 PathProgramCache]: Analyzing trace with hash 200328178, now seen corresponding path program 1612 times [2020-01-16 19:09:41,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:41,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314944771] [2020-01-16 19:09:41,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:41,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-01-16 19:09:41,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314944771] [2020-01-16 19:09:41,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:41,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:41,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439666483] [2020-01-16 19:09:41,272 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:41,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:41,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:41,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:41,272 INFO L87 Difference]: Start difference. First operand 378 states and 1286 transitions. Second operand 9 states. [2020-01-16 19:09:41,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:41,378 INFO L93 Difference]: Finished difference Result 585 states and 1704 transitions. [2020-01-16 19:09:41,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:41,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:41,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:41,380 INFO L225 Difference]: With dead ends: 585 [2020-01-16 19:09:41,380 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:09:41,380 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:41,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:09:41,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 375. [2020-01-16 19:09:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1279 transitions. [2020-01-16 19:09:41,389 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1279 transitions. Word has length 22 [2020-01-16 19:09:41,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:41,389 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1279 transitions. [2020-01-16 19:09:41,389 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:41,389 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1279 transitions. [2020-01-16 19:09:41,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:41,390 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:41,390 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:41,390 INFO L426 AbstractCegarLoop]: === Iteration 1619 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:41,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:41,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2080277306, now seen corresponding path program 1613 times [2020-01-16 19:09:41,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:41,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903219235] [2020-01-16 19:09:41,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:41,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-01-16 19:09:41,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903219235] [2020-01-16 19:09:41,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:41,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:41,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005689091] [2020-01-16 19:09:41,643 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:41,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:41,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:41,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:41,644 INFO L87 Difference]: Start difference. First operand 375 states and 1279 transitions. Second operand 9 states. [2020-01-16 19:09:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:41,745 INFO L93 Difference]: Finished difference Result 580 states and 1695 transitions. [2020-01-16 19:09:41,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:41,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:41,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:41,747 INFO L225 Difference]: With dead ends: 580 [2020-01-16 19:09:41,747 INFO L226 Difference]: Without dead ends: 569 [2020-01-16 19:09:41,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-01-16 19:09:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 377. [2020-01-16 19:09:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:09:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1282 transitions. [2020-01-16 19:09:41,756 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1282 transitions. Word has length 22 [2020-01-16 19:09:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:41,756 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1282 transitions. [2020-01-16 19:09:41,756 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1282 transitions. [2020-01-16 19:09:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:41,757 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:41,757 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:41,757 INFO L426 AbstractCegarLoop]: === Iteration 1620 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:41,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:41,757 INFO L82 PathProgramCache]: Analyzing trace with hash -872757202, now seen corresponding path program 1614 times [2020-01-16 19:09:41,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:41,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245148499] [2020-01-16 19:09:41,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:42,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245148499] [2020-01-16 19:09:42,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:42,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:42,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394402003] [2020-01-16 19:09:42,010 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:42,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:42,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:42,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:42,011 INFO L87 Difference]: Start difference. First operand 377 states and 1282 transitions. Second operand 9 states. [2020-01-16 19:09:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:42,115 INFO L93 Difference]: Finished difference Result 579 states and 1691 transitions. [2020-01-16 19:09:42,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:42,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:42,117 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:09:42,117 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 19:09:42,117 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:42,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 19:09:42,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 372. [2020-01-16 19:09:42,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:09:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1272 transitions. [2020-01-16 19:09:42,126 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1272 transitions. Word has length 22 [2020-01-16 19:09:42,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:42,126 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1272 transitions. [2020-01-16 19:09:42,126 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:42,126 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1272 transitions. [2020-01-16 19:09:42,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:42,127 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:42,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, 1, 1, 1] [2020-01-16 19:09:42,127 INFO L426 AbstractCegarLoop]: === Iteration 1621 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:42,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:42,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2085208262, now seen corresponding path program 1615 times [2020-01-16 19:09:42,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:42,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378068402] [2020-01-16 19:09:42,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:42,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-01-16 19:09:42,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378068402] [2020-01-16 19:09:42,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:42,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:42,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385447792] [2020-01-16 19:09:42,383 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:42,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:42,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:42,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:42,384 INFO L87 Difference]: Start difference. First operand 372 states and 1272 transitions. Second operand 9 states. [2020-01-16 19:09:42,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:42,477 INFO L93 Difference]: Finished difference Result 597 states and 1735 transitions. [2020-01-16 19:09:42,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:42,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:42,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:42,479 INFO L225 Difference]: With dead ends: 597 [2020-01-16 19:09:42,479 INFO L226 Difference]: Without dead ends: 581 [2020-01-16 19:09:42,479 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:42,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-01-16 19:09:42,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 380. [2020-01-16 19:09:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:09:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1292 transitions. [2020-01-16 19:09:42,488 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1292 transitions. Word has length 22 [2020-01-16 19:09:42,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:42,488 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1292 transitions. [2020-01-16 19:09:42,488 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:42,488 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1292 transitions. [2020-01-16 19:09:42,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:42,489 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:42,489 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:42,489 INFO L426 AbstractCegarLoop]: === Iteration 1622 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:42,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:42,489 INFO L82 PathProgramCache]: Analyzing trace with hash -619493148, now seen corresponding path program 1616 times [2020-01-16 19:09:42,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:42,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309711937] [2020-01-16 19:09:42,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:42,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:42,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309711937] [2020-01-16 19:09:42,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:42,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:42,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769417871] [2020-01-16 19:09:42,736 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:42,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:42,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:42,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:42,736 INFO L87 Difference]: Start difference. First operand 380 states and 1292 transitions. Second operand 9 states. [2020-01-16 19:09:42,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:42,839 INFO L93 Difference]: Finished difference Result 592 states and 1722 transitions. [2020-01-16 19:09:42,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:42,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:42,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:42,841 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:09:42,841 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:09:42,841 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:42,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:09:42,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 376. [2020-01-16 19:09:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:09:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1282 transitions. [2020-01-16 19:09:42,850 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1282 transitions. Word has length 22 [2020-01-16 19:09:42,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:42,851 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1282 transitions. [2020-01-16 19:09:42,851 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1282 transitions. [2020-01-16 19:09:42,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:42,851 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:42,851 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:42,852 INFO L426 AbstractCegarLoop]: === Iteration 1623 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:42,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:42,852 INFO L82 PathProgramCache]: Analyzing trace with hash -877196106, now seen corresponding path program 1617 times [2020-01-16 19:09:42,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:42,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780566414] [2020-01-16 19:09:42,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:43,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:43,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780566414] [2020-01-16 19:09:43,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:43,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:43,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330885342] [2020-01-16 19:09:43,112 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:43,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:43,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:43,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:43,112 INFO L87 Difference]: Start difference. First operand 376 states and 1282 transitions. Second operand 9 states. [2020-01-16 19:09:43,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:43,200 INFO L93 Difference]: Finished difference Result 593 states and 1727 transitions. [2020-01-16 19:09:43,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:43,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:43,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:43,201 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:09:43,201 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:09:43,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:43,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:09:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 382. [2020-01-16 19:09:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:09:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1292 transitions. [2020-01-16 19:09:43,210 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1292 transitions. Word has length 22 [2020-01-16 19:09:43,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:43,210 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1292 transitions. [2020-01-16 19:09:43,210 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1292 transitions. [2020-01-16 19:09:43,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:43,211 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:43,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, 1, 1, 1] [2020-01-16 19:09:43,211 INFO L426 AbstractCegarLoop]: === Iteration 1624 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:43,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:43,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1826671162, now seen corresponding path program 1618 times [2020-01-16 19:09:43,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:43,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106003036] [2020-01-16 19:09:43,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:43,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106003036] [2020-01-16 19:09:43,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:43,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:43,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743384271] [2020-01-16 19:09:43,467 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:43,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:43,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:43,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:43,467 INFO L87 Difference]: Start difference. First operand 382 states and 1292 transitions. Second operand 9 states. [2020-01-16 19:09:43,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:43,571 INFO L93 Difference]: Finished difference Result 581 states and 1708 transitions. [2020-01-16 19:09:43,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:43,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:43,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:43,573 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:09:43,573 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:09:43,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:09:43,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 376. [2020-01-16 19:09:43,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:09:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1278 transitions. [2020-01-16 19:09:43,589 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1278 transitions. Word has length 22 [2020-01-16 19:09:43,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:43,589 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1278 transitions. [2020-01-16 19:09:43,589 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:43,589 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1278 transitions. [2020-01-16 19:09:43,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:43,590 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:43,590 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:43,590 INFO L426 AbstractCegarLoop]: === Iteration 1625 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:43,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:43,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2092492520, now seen corresponding path program 1619 times [2020-01-16 19:09:43,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:43,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130579223] [2020-01-16 19:09:43,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:43,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130579223] [2020-01-16 19:09:43,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:43,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:43,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875080503] [2020-01-16 19:09:43,838 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:43,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:43,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:43,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:43,838 INFO L87 Difference]: Start difference. First operand 376 states and 1278 transitions. Second operand 9 states. [2020-01-16 19:09:43,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:43,938 INFO L93 Difference]: Finished difference Result 585 states and 1706 transitions. [2020-01-16 19:09:43,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:43,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:43,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:43,940 INFO L225 Difference]: With dead ends: 585 [2020-01-16 19:09:43,940 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:09:43,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:43,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:09:43,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 379. [2020-01-16 19:09:43,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:09:43,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1283 transitions. [2020-01-16 19:09:43,949 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1283 transitions. Word has length 22 [2020-01-16 19:09:43,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:43,949 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1283 transitions. [2020-01-16 19:09:43,949 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1283 transitions. [2020-01-16 19:09:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:43,950 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:43,950 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:43,950 INFO L426 AbstractCegarLoop]: === Iteration 1626 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:43,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:43,950 INFO L82 PathProgramCache]: Analyzing trace with hash -363445186, now seen corresponding path program 1620 times [2020-01-16 19:09:43,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:43,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247326040] [2020-01-16 19:09:43,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:44,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-01-16 19:09:44,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247326040] [2020-01-16 19:09:44,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:44,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:44,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094641207] [2020-01-16 19:09:44,222 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:44,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:44,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:44,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:44,222 INFO L87 Difference]: Start difference. First operand 379 states and 1283 transitions. Second operand 9 states. [2020-01-16 19:09:44,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:44,323 INFO L93 Difference]: Finished difference Result 578 states and 1699 transitions. [2020-01-16 19:09:44,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:44,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:44,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:44,325 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:09:44,325 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:09:44,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:44,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:09:44,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 372. [2020-01-16 19:09:44,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:09:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1269 transitions. [2020-01-16 19:09:44,334 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1269 transitions. Word has length 22 [2020-01-16 19:09:44,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:44,334 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1269 transitions. [2020-01-16 19:09:44,334 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:44,334 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1269 transitions. [2020-01-16 19:09:44,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:44,335 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:44,335 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:44,335 INFO L426 AbstractCegarLoop]: === Iteration 1627 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:44,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:44,335 INFO L82 PathProgramCache]: Analyzing trace with hash -621679530, now seen corresponding path program 1621 times [2020-01-16 19:09:44,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:44,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876693771] [2020-01-16 19:09:44,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:44,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876693771] [2020-01-16 19:09:44,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:44,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:44,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137835711] [2020-01-16 19:09:44,585 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:44,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:44,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:44,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:44,585 INFO L87 Difference]: Start difference. First operand 372 states and 1269 transitions. Second operand 9 states. [2020-01-16 19:09:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:44,664 INFO L93 Difference]: Finished difference Result 592 states and 1718 transitions. [2020-01-16 19:09:44,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:44,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:44,666 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:09:44,666 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:09:44,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:44,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:09:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 378. [2020-01-16 19:09:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:09:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1283 transitions. [2020-01-16 19:09:44,675 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1283 transitions. Word has length 22 [2020-01-16 19:09:44,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:44,675 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1283 transitions. [2020-01-16 19:09:44,675 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1283 transitions. [2020-01-16 19:09:44,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:44,675 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:44,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, 1, 1, 1] [2020-01-16 19:09:44,676 INFO L426 AbstractCegarLoop]: === Iteration 1628 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:44,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:44,676 INFO L82 PathProgramCache]: Analyzing trace with hash -495043156, now seen corresponding path program 1622 times [2020-01-16 19:09:44,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:44,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004621409] [2020-01-16 19:09:44,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:44,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004621409] [2020-01-16 19:09:44,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:44,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:44,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914255653] [2020-01-16 19:09:44,922 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:44,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:44,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:44,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:44,923 INFO L87 Difference]: Start difference. First operand 378 states and 1283 transitions. Second operand 9 states. [2020-01-16 19:09:45,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:45,022 INFO L93 Difference]: Finished difference Result 586 states and 1704 transitions. [2020-01-16 19:09:45,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:45,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:45,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:45,024 INFO L225 Difference]: With dead ends: 586 [2020-01-16 19:09:45,024 INFO L226 Difference]: Without dead ends: 573 [2020-01-16 19:09:45,024 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:45,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-01-16 19:09:45,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 375. [2020-01-16 19:09:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:45,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-01-16 19:09:45,032 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-01-16 19:09:45,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:45,032 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-01-16 19:09:45,032 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:45,032 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-01-16 19:09:45,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:45,033 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:45,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, 1, 1, 1] [2020-01-16 19:09:45,033 INFO L426 AbstractCegarLoop]: === Iteration 1629 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:45,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:45,033 INFO L82 PathProgramCache]: Analyzing trace with hash -86449728, now seen corresponding path program 1623 times [2020-01-16 19:09:45,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:45,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482193407] [2020-01-16 19:09:45,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:45,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-01-16 19:09:45,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482193407] [2020-01-16 19:09:45,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:45,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:45,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023898834] [2020-01-16 19:09:45,290 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:45,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:45,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:45,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:45,290 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:09:45,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:45,368 INFO L93 Difference]: Finished difference Result 590 states and 1716 transitions. [2020-01-16 19:09:45,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:45,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:45,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:45,370 INFO L225 Difference]: With dead ends: 590 [2020-01-16 19:09:45,370 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:09:45,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:45,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:09:45,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 381. [2020-01-16 19:09:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:09:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1286 transitions. [2020-01-16 19:09:45,380 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1286 transitions. Word has length 22 [2020-01-16 19:09:45,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:45,380 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1286 transitions. [2020-01-16 19:09:45,380 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:45,380 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1286 transitions. [2020-01-16 19:09:45,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:45,381 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:45,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:45,381 INFO L426 AbstractCegarLoop]: === Iteration 1630 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:45,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:45,381 INFO L82 PathProgramCache]: Analyzing trace with hash 659981198, now seen corresponding path program 1624 times [2020-01-16 19:09:45,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:45,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871050085] [2020-01-16 19:09:45,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:45,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-01-16 19:09:45,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871050085] [2020-01-16 19:09:45,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:45,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:45,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276253032] [2020-01-16 19:09:45,632 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:45,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:45,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:45,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:45,632 INFO L87 Difference]: Start difference. First operand 381 states and 1286 transitions. Second operand 9 states. [2020-01-16 19:09:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:45,737 INFO L93 Difference]: Finished difference Result 578 states and 1697 transitions. [2020-01-16 19:09:45,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:45,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:45,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:45,738 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:09:45,739 INFO L226 Difference]: Without dead ends: 559 [2020-01-16 19:09:45,739 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:45,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-01-16 19:09:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 375. [2020-01-16 19:09:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:45,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1273 transitions. [2020-01-16 19:09:45,747 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1273 transitions. Word has length 22 [2020-01-16 19:09:45,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:45,747 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1273 transitions. [2020-01-16 19:09:45,747 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1273 transitions. [2020-01-16 19:09:45,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:45,748 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:45,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, 1, 1, 1] [2020-01-16 19:09:45,748 INFO L426 AbstractCegarLoop]: === Iteration 1631 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:45,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:45,748 INFO L82 PathProgramCache]: Analyzing trace with hash -2105984114, now seen corresponding path program 1625 times [2020-01-16 19:09:45,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:45,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290772111] [2020-01-16 19:09:45,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:45,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-01-16 19:09:45,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290772111] [2020-01-16 19:09:45,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:45,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:45,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244638313] [2020-01-16 19:09:45,997 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:45,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:45,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:45,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:45,997 INFO L87 Difference]: Start difference. First operand 375 states and 1273 transitions. Second operand 9 states. [2020-01-16 19:09:46,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:46,100 INFO L93 Difference]: Finished difference Result 580 states and 1691 transitions. [2020-01-16 19:09:46,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:46,100 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:46,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:46,102 INFO L225 Difference]: With dead ends: 580 [2020-01-16 19:09:46,102 INFO L226 Difference]: Without dead ends: 570 [2020-01-16 19:09:46,102 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:46,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-01-16 19:09:46,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 377. [2020-01-16 19:09:46,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:09:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1276 transitions. [2020-01-16 19:09:46,110 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1276 transitions. Word has length 22 [2020-01-16 19:09:46,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:46,110 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1276 transitions. [2020-01-16 19:09:46,110 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:46,110 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1276 transitions. [2020-01-16 19:09:46,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:46,111 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:46,111 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:46,111 INFO L426 AbstractCegarLoop]: === Iteration 1632 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:46,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:46,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1534529308, now seen corresponding path program 1626 times [2020-01-16 19:09:46,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:46,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031471013] [2020-01-16 19:09:46,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:46,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031471013] [2020-01-16 19:09:46,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:46,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:46,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083184898] [2020-01-16 19:09:46,377 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:46,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:46,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:46,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:46,377 INFO L87 Difference]: Start difference. First operand 377 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:09:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:46,480 INFO L93 Difference]: Finished difference Result 574 states and 1687 transitions. [2020-01-16 19:09:46,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:46,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:46,481 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:09:46,482 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:09:46,482 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:09:46,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 372. [2020-01-16 19:09:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:09:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1266 transitions. [2020-01-16 19:09:46,490 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1266 transitions. Word has length 22 [2020-01-16 19:09:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:46,491 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1266 transitions. [2020-01-16 19:09:46,491 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:46,491 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1266 transitions. [2020-01-16 19:09:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:46,491 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:46,491 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:46,491 INFO L426 AbstractCegarLoop]: === Iteration 1633 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:46,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:46,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1815969736, now seen corresponding path program 1627 times [2020-01-16 19:09:46,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:46,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761294437] [2020-01-16 19:09:46,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:46,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761294437] [2020-01-16 19:09:46,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:46,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:46,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436793386] [2020-01-16 19:09:46,746 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:46,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:46,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:46,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:46,747 INFO L87 Difference]: Start difference. First operand 372 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:09:46,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:46,851 INFO L93 Difference]: Finished difference Result 572 states and 1675 transitions. [2020-01-16 19:09:46,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:46,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:46,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:46,853 INFO L225 Difference]: With dead ends: 572 [2020-01-16 19:09:46,853 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:09:46,853 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:46,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:09:46,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 376. [2020-01-16 19:09:46,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:09:46,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1276 transitions. [2020-01-16 19:09:46,861 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1276 transitions. Word has length 22 [2020-01-16 19:09:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:46,861 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1276 transitions. [2020-01-16 19:09:46,862 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1276 transitions. [2020-01-16 19:09:46,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:46,862 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:46,862 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:46,862 INFO L426 AbstractCegarLoop]: === Iteration 1634 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:46,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:46,862 INFO L82 PathProgramCache]: Analyzing trace with hash -474036948, now seen corresponding path program 1628 times [2020-01-16 19:09:46,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:46,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390750292] [2020-01-16 19:09:46,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:47,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:47,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390750292] [2020-01-16 19:09:47,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:47,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:47,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868349953] [2020-01-16 19:09:47,117 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:47,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:47,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:47,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:47,117 INFO L87 Difference]: Start difference. First operand 376 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:09:47,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:47,231 INFO L93 Difference]: Finished difference Result 571 states and 1671 transitions. [2020-01-16 19:09:47,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:47,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:47,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:47,233 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:09:47,233 INFO L226 Difference]: Without dead ends: 559 [2020-01-16 19:09:47,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:47,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-01-16 19:09:47,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 374. [2020-01-16 19:09:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:09:47,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1271 transitions. [2020-01-16 19:09:47,242 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1271 transitions. Word has length 22 [2020-01-16 19:09:47,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:47,242 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1271 transitions. [2020-01-16 19:09:47,242 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:47,242 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1271 transitions. [2020-01-16 19:09:47,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:47,243 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:47,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, 1, 1, 1] [2020-01-16 19:09:47,243 INFO L426 AbstractCegarLoop]: === Iteration 1635 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:47,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:47,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1280739934, now seen corresponding path program 1629 times [2020-01-16 19:09:47,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:47,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749786844] [2020-01-16 19:09:47,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:47,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749786844] [2020-01-16 19:09:47,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:47,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:47,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140845675] [2020-01-16 19:09:47,491 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:47,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:47,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:47,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:47,492 INFO L87 Difference]: Start difference. First operand 374 states and 1271 transitions. Second operand 9 states. [2020-01-16 19:09:47,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:47,593 INFO L93 Difference]: Finished difference Result 573 states and 1677 transitions. [2020-01-16 19:09:47,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:47,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:47,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:47,595 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:09:47,595 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:09:47,595 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:47,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:09:47,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 377. [2020-01-16 19:09:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:09:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1276 transitions. [2020-01-16 19:09:47,604 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1276 transitions. Word has length 22 [2020-01-16 19:09:47,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:47,605 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1276 transitions. [2020-01-16 19:09:47,605 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:47,605 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1276 transitions. [2020-01-16 19:09:47,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:47,605 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:47,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, 1, 1, 1] [2020-01-16 19:09:47,605 INFO L426 AbstractCegarLoop]: === Iteration 1636 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:47,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:47,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1509128942, now seen corresponding path program 1630 times [2020-01-16 19:09:47,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:47,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482718356] [2020-01-16 19:09:47,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:47,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482718356] [2020-01-16 19:09:47,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:47,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:47,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325841384] [2020-01-16 19:09:47,853 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:47,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:47,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:47,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:47,853 INFO L87 Difference]: Start difference. First operand 377 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:09:47,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:47,954 INFO L93 Difference]: Finished difference Result 566 states and 1670 transitions. [2020-01-16 19:09:47,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:47,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:47,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:47,955 INFO L225 Difference]: With dead ends: 566 [2020-01-16 19:09:47,956 INFO L226 Difference]: Without dead ends: 550 [2020-01-16 19:09:47,956 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:47,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-01-16 19:09:47,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 374. [2020-01-16 19:09:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:09:47,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1269 transitions. [2020-01-16 19:09:47,965 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1269 transitions. Word has length 22 [2020-01-16 19:09:47,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:47,965 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1269 transitions. [2020-01-16 19:09:47,965 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1269 transitions. [2020-01-16 19:09:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:47,966 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:47,966 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:47,966 INFO L426 AbstractCegarLoop]: === Iteration 1637 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:47,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:47,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1011892526, now seen corresponding path program 1631 times [2020-01-16 19:09:47,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:47,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352641855] [2020-01-16 19:09:47,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:48,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:48,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352641855] [2020-01-16 19:09:48,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:48,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:48,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741415598] [2020-01-16 19:09:48,210 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:48,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:48,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:48,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:48,210 INFO L87 Difference]: Start difference. First operand 374 states and 1269 transitions. Second operand 9 states. [2020-01-16 19:09:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:48,311 INFO L93 Difference]: Finished difference Result 571 states and 1670 transitions. [2020-01-16 19:09:48,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:48,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:48,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:48,312 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:09:48,313 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:09:48,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:48,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:09:48,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 376. [2020-01-16 19:09:48,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:09:48,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1272 transitions. [2020-01-16 19:09:48,321 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1272 transitions. Word has length 22 [2020-01-16 19:09:48,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:48,321 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1272 transitions. [2020-01-16 19:09:48,322 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1272 transitions. [2020-01-16 19:09:48,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:48,322 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:48,322 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:48,322 INFO L426 AbstractCegarLoop]: === Iteration 1638 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:48,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:48,322 INFO L82 PathProgramCache]: Analyzing trace with hash -440437720, now seen corresponding path program 1632 times [2020-01-16 19:09:48,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:48,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403264755] [2020-01-16 19:09:48,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:48,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-01-16 19:09:48,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403264755] [2020-01-16 19:09:48,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:48,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:48,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173034827] [2020-01-16 19:09:48,571 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:48,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:48,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:48,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:48,571 INFO L87 Difference]: Start difference. First operand 376 states and 1272 transitions. Second operand 9 states. [2020-01-16 19:09:48,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:48,693 INFO L93 Difference]: Finished difference Result 565 states and 1666 transitions. [2020-01-16 19:09:48,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:48,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:48,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:48,695 INFO L225 Difference]: With dead ends: 565 [2020-01-16 19:09:48,695 INFO L226 Difference]: Without dead ends: 545 [2020-01-16 19:09:48,695 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-01-16 19:09:48,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 369. [2020-01-16 19:09:48,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-01-16 19:09:48,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1260 transitions. [2020-01-16 19:09:48,703 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1260 transitions. Word has length 22 [2020-01-16 19:09:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:48,703 INFO L478 AbstractCegarLoop]: Abstraction has 369 states and 1260 transitions. [2020-01-16 19:09:48,703 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1260 transitions. [2020-01-16 19:09:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:48,704 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:48,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, 1, 1, 1] [2020-01-16 19:09:48,704 INFO L426 AbstractCegarLoop]: === Iteration 1639 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:48,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:48,704 INFO L82 PathProgramCache]: Analyzing trace with hash -817380298, now seen corresponding path program 1633 times [2020-01-16 19:09:48,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:48,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975047240] [2020-01-16 19:09:48,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:48,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:48,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975047240] [2020-01-16 19:09:48,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:48,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:48,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158559572] [2020-01-16 19:09:48,973 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:48,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:48,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:48,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:48,973 INFO L87 Difference]: Start difference. First operand 369 states and 1260 transitions. Second operand 9 states. [2020-01-16 19:09:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:49,054 INFO L93 Difference]: Finished difference Result 572 states and 1661 transitions. [2020-01-16 19:09:49,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:49,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:49,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:49,056 INFO L225 Difference]: With dead ends: 572 [2020-01-16 19:09:49,056 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:09:49,056 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:49,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:09:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 375. [2020-01-16 19:09:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-01-16 19:09:49,072 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-01-16 19:09:49,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:49,072 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-01-16 19:09:49,072 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-01-16 19:09:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:49,073 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:49,073 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:49,073 INFO L426 AbstractCegarLoop]: === Iteration 1640 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:49,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:49,073 INFO L82 PathProgramCache]: Analyzing trace with hash -256311806, now seen corresponding path program 1634 times [2020-01-16 19:09:49,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:49,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818499572] [2020-01-16 19:09:49,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:49,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818499572] [2020-01-16 19:09:49,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:49,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:49,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800568203] [2020-01-16 19:09:49,340 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:49,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:49,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:49,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:49,340 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:09:49,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:49,417 INFO L93 Difference]: Finished difference Result 565 states and 1646 transitions. [2020-01-16 19:09:49,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:49,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:49,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:49,419 INFO L225 Difference]: With dead ends: 565 [2020-01-16 19:09:49,419 INFO L226 Difference]: Without dead ends: 554 [2020-01-16 19:09:49,419 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:49,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-01-16 19:09:49,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 373. [2020-01-16 19:09:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-01-16 19:09:49,428 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-01-16 19:09:49,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:49,428 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-01-16 19:09:49,429 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:49,429 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-01-16 19:09:49,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:49,429 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:49,429 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:49,429 INFO L426 AbstractCegarLoop]: === Iteration 1641 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:49,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:49,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1877149144, now seen corresponding path program 1635 times [2020-01-16 19:09:49,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:49,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336239330] [2020-01-16 19:09:49,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:49,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336239330] [2020-01-16 19:09:49,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:49,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:49,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231240971] [2020-01-16 19:09:49,695 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:49,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:49,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:49,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:49,695 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-01-16 19:09:49,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:49,776 INFO L93 Difference]: Finished difference Result 574 states and 1664 transitions. [2020-01-16 19:09:49,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:49,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:49,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:49,777 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:09:49,777 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:09:49,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:49,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:09:49,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 376. [2020-01-16 19:09:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:09:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1276 transitions. [2020-01-16 19:09:49,786 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1276 transitions. Word has length 22 [2020-01-16 19:09:49,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:49,786 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1276 transitions. [2020-01-16 19:09:49,786 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1276 transitions. [2020-01-16 19:09:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:49,786 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:49,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, 1, 1, 1] [2020-01-16 19:09:49,787 INFO L426 AbstractCegarLoop]: === Iteration 1642 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:49,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:49,787 INFO L82 PathProgramCache]: Analyzing trace with hash 914945482, now seen corresponding path program 1636 times [2020-01-16 19:09:49,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:49,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304622482] [2020-01-16 19:09:49,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:50,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-01-16 19:09:50,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304622482] [2020-01-16 19:09:50,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:50,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:50,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995608916] [2020-01-16 19:09:50,048 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:50,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:50,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:50,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:50,048 INFO L87 Difference]: Start difference. First operand 376 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:09:50,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:50,150 INFO L93 Difference]: Finished difference Result 568 states and 1650 transitions. [2020-01-16 19:09:50,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:50,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:50,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:50,152 INFO L225 Difference]: With dead ends: 568 [2020-01-16 19:09:50,152 INFO L226 Difference]: Without dead ends: 555 [2020-01-16 19:09:50,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:50,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-01-16 19:09:50,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 373. [2020-01-16 19:09:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-01-16 19:09:50,161 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-01-16 19:09:50,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:50,162 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-01-16 19:09:50,162 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:50,162 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-01-16 19:09:50,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:50,162 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:50,162 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:50,162 INFO L426 AbstractCegarLoop]: === Iteration 1643 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:50,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:50,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1931871370, now seen corresponding path program 1637 times [2020-01-16 19:09:50,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:50,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623432151] [2020-01-16 19:09:50,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:50,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623432151] [2020-01-16 19:09:50,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:50,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:50,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244251810] [2020-01-16 19:09:50,440 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:50,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:50,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:50,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:50,441 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:09:50,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:50,514 INFO L93 Difference]: Finished difference Result 558 states and 1631 transitions. [2020-01-16 19:09:50,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:50,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:50,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:50,516 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:09:50,516 INFO L226 Difference]: Without dead ends: 549 [2020-01-16 19:09:50,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:50,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-01-16 19:09:50,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 374. [2020-01-16 19:09:50,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:09:50,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1271 transitions. [2020-01-16 19:09:50,524 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1271 transitions. Word has length 22 [2020-01-16 19:09:50,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:50,524 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1271 transitions. [2020-01-16 19:09:50,524 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:50,524 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1271 transitions. [2020-01-16 19:09:50,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:50,525 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:50,525 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:50,525 INFO L426 AbstractCegarLoop]: === Iteration 1644 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:50,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:50,525 INFO L82 PathProgramCache]: Analyzing trace with hash -752154968, now seen corresponding path program 1638 times [2020-01-16 19:09:50,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:50,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086159313] [2020-01-16 19:09:50,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:50,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-01-16 19:09:50,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086159313] [2020-01-16 19:09:50,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:50,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:50,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695357372] [2020-01-16 19:09:50,797 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:50,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:50,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:50,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:50,797 INFO L87 Difference]: Start difference. First operand 374 states and 1271 transitions. Second operand 9 states. [2020-01-16 19:09:50,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:50,899 INFO L93 Difference]: Finished difference Result 559 states and 1632 transitions. [2020-01-16 19:09:50,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:50,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:50,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:50,901 INFO L225 Difference]: With dead ends: 559 [2020-01-16 19:09:50,901 INFO L226 Difference]: Without dead ends: 546 [2020-01-16 19:09:50,902 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:50,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-01-16 19:09:50,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 371. [2020-01-16 19:09:50,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:09:50,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1266 transitions. [2020-01-16 19:09:50,910 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1266 transitions. Word has length 22 [2020-01-16 19:09:50,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:50,910 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1266 transitions. [2020-01-16 19:09:50,910 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:50,910 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1266 transitions. [2020-01-16 19:09:50,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:50,911 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:50,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:50,911 INFO L426 AbstractCegarLoop]: === Iteration 1645 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:50,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:50,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1857616096, now seen corresponding path program 1639 times [2020-01-16 19:09:50,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:50,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40594529] [2020-01-16 19:09:50,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:51,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40594529] [2020-01-16 19:09:51,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:51,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:51,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272518879] [2020-01-16 19:09:51,182 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:51,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:51,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:51,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:51,182 INFO L87 Difference]: Start difference. First operand 371 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:09:51,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:51,258 INFO L93 Difference]: Finished difference Result 576 states and 1670 transitions. [2020-01-16 19:09:51,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:51,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:51,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:51,259 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:09:51,259 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:09:51,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:09:51,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 375. [2020-01-16 19:09:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:09:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1274 transitions. [2020-01-16 19:09:51,268 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1274 transitions. Word has length 22 [2020-01-16 19:09:51,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:51,269 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1274 transitions. [2020-01-16 19:09:51,269 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:51,269 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1274 transitions. [2020-01-16 19:09:51,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:51,269 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:51,269 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:51,269 INFO L426 AbstractCegarLoop]: === Iteration 1646 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:51,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:51,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1296547604, now seen corresponding path program 1640 times [2020-01-16 19:09:51,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:51,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348389691] [2020-01-16 19:09:51,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:51,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348389691] [2020-01-16 19:09:51,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:51,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:51,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970354718] [2020-01-16 19:09:51,534 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:51,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:51,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:51,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:51,534 INFO L87 Difference]: Start difference. First operand 375 states and 1274 transitions. Second operand 9 states. [2020-01-16 19:09:51,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:51,609 INFO L93 Difference]: Finished difference Result 569 states and 1655 transitions. [2020-01-16 19:09:51,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:51,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:51,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:51,611 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:09:51,611 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:09:51,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:51,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:09:51,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 373. [2020-01-16 19:09:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-01-16 19:09:51,621 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-01-16 19:09:51,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:51,621 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-01-16 19:09:51,621 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-01-16 19:09:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:51,621 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:51,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, 1, 1, 1] [2020-01-16 19:09:51,622 INFO L426 AbstractCegarLoop]: === Iteration 1647 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:51,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:51,622 INFO L82 PathProgramCache]: Analyzing trace with hash 249168024, now seen corresponding path program 1641 times [2020-01-16 19:09:51,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:51,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566970944] [2020-01-16 19:09:51,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:51,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566970944] [2020-01-16 19:09:51,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:51,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:51,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013213662] [2020-01-16 19:09:51,900 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:51,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:51,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:51,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:51,901 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:09:51,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:51,975 INFO L93 Difference]: Finished difference Result 576 states and 1674 transitions. [2020-01-16 19:09:51,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:51,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:51,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:51,977 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:09:51,977 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:09:51,977 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:51,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:09:51,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 379. [2020-01-16 19:09:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:09:51,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1280 transitions. [2020-01-16 19:09:51,986 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1280 transitions. Word has length 22 [2020-01-16 19:09:51,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:51,986 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1280 transitions. [2020-01-16 19:09:51,986 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:51,986 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1280 transitions. [2020-01-16 19:09:51,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:51,987 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:51,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, 1, 1, 1] [2020-01-16 19:09:51,987 INFO L426 AbstractCegarLoop]: === Iteration 1648 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:51,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:51,987 INFO L82 PathProgramCache]: Analyzing trace with hash 441988716, now seen corresponding path program 1642 times [2020-01-16 19:09:51,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:51,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677035296] [2020-01-16 19:09:51,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:52,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677035296] [2020-01-16 19:09:52,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:52,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:52,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921451178] [2020-01-16 19:09:52,255 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:52,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:52,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:52,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:52,255 INFO L87 Difference]: Start difference. First operand 379 states and 1280 transitions. Second operand 9 states. [2020-01-16 19:09:52,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:52,360 INFO L93 Difference]: Finished difference Result 564 states and 1655 transitions. [2020-01-16 19:09:52,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:52,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:52,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:52,361 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:09:52,362 INFO L226 Difference]: Without dead ends: 545 [2020-01-16 19:09:52,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:52,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-01-16 19:09:52,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 373. [2020-01-16 19:09:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-01-16 19:09:52,370 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-01-16 19:09:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:52,371 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-01-16 19:09:52,371 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-01-16 19:09:52,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:52,371 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:52,371 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:52,371 INFO L426 AbstractCegarLoop]: === Iteration 1649 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:52,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:52,372 INFO L82 PathProgramCache]: Analyzing trace with hash 303890250, now seen corresponding path program 1643 times [2020-01-16 19:09:52,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:52,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393383764] [2020-01-16 19:09:52,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:52,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-01-16 19:09:52,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393383764] [2020-01-16 19:09:52,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:52,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:52,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253620629] [2020-01-16 19:09:52,641 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:52,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:52,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:52,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:52,642 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:09:52,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:52,725 INFO L93 Difference]: Finished difference Result 564 states and 1645 transitions. [2020-01-16 19:09:52,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:52,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:52,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:52,727 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:09:52,727 INFO L226 Difference]: Without dead ends: 555 [2020-01-16 19:09:52,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:52,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-01-16 19:09:52,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 374. [2020-01-16 19:09:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:09:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1269 transitions. [2020-01-16 19:09:52,736 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1269 transitions. Word has length 22 [2020-01-16 19:09:52,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:52,736 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1269 transitions. [2020-01-16 19:09:52,737 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1269 transitions. [2020-01-16 19:09:52,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:52,737 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:52,737 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:52,737 INFO L426 AbstractCegarLoop]: === Iteration 1650 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:52,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:52,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1844906286, now seen corresponding path program 1644 times [2020-01-16 19:09:52,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:52,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732110946] [2020-01-16 19:09:52,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:53,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-01-16 19:09:53,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732110946] [2020-01-16 19:09:53,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:53,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:53,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861120493] [2020-01-16 19:09:53,006 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:53,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:53,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:53,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:53,006 INFO L87 Difference]: Start difference. First operand 374 states and 1269 transitions. Second operand 9 states. [2020-01-16 19:09:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:53,110 INFO L93 Difference]: Finished difference Result 559 states and 1644 transitions. [2020-01-16 19:09:53,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:53,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:53,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:53,112 INFO L225 Difference]: With dead ends: 559 [2020-01-16 19:09:53,112 INFO L226 Difference]: Without dead ends: 543 [2020-01-16 19:09:53,112 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-01-16 19:09:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 371. [2020-01-16 19:09:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:09:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1264 transitions. [2020-01-16 19:09:53,121 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1264 transitions. Word has length 22 [2020-01-16 19:09:53,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:53,121 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1264 transitions. [2020-01-16 19:09:53,121 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:53,121 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1264 transitions. [2020-01-16 19:09:53,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:53,121 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:53,122 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:53,122 INFO L426 AbstractCegarLoop]: === Iteration 1651 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:53,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:53,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1532019872, now seen corresponding path program 1645 times [2020-01-16 19:09:53,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:53,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680395145] [2020-01-16 19:09:53,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:53,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-01-16 19:09:53,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680395145] [2020-01-16 19:09:53,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:53,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:53,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869563137] [2020-01-16 19:09:53,387 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:53,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:53,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:53,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:53,388 INFO L87 Difference]: Start difference. First operand 371 states and 1264 transitions. Second operand 9 states. [2020-01-16 19:09:53,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:53,467 INFO L93 Difference]: Finished difference Result 581 states and 1682 transitions. [2020-01-16 19:09:53,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:53,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:53,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:53,469 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:09:53,469 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:09:53,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:53,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:09:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 377. [2020-01-16 19:09:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:09:53,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1278 transitions. [2020-01-16 19:09:53,478 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1278 transitions. Word has length 22 [2020-01-16 19:09:53,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:53,478 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1278 transitions. [2020-01-16 19:09:53,478 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:53,478 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1278 transitions. [2020-01-16 19:09:53,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:53,479 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:53,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, 1, 1, 1] [2020-01-16 19:09:53,479 INFO L426 AbstractCegarLoop]: === Iteration 1652 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:53,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:53,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1800743762, now seen corresponding path program 1646 times [2020-01-16 19:09:53,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:53,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122470265] [2020-01-16 19:09:53,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:53,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122470265] [2020-01-16 19:09:53,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:53,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:53,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007907877] [2020-01-16 19:09:53,746 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:53,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:53,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:53,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:53,746 INFO L87 Difference]: Start difference. First operand 377 states and 1278 transitions. Second operand 9 states. [2020-01-16 19:09:53,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:53,854 INFO L93 Difference]: Finished difference Result 575 states and 1668 transitions. [2020-01-16 19:09:53,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:53,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:53,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:53,855 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:09:53,856 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:09:53,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:09:53,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 374. [2020-01-16 19:09:53,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:09:53,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1271 transitions. [2020-01-16 19:09:53,864 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1271 transitions. Word has length 22 [2020-01-16 19:09:53,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:53,864 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1271 transitions. [2020-01-16 19:09:53,865 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:53,865 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1271 transitions. [2020-01-16 19:09:53,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:53,865 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:53,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, 1, 1, 1] [2020-01-16 19:09:53,865 INFO L426 AbstractCegarLoop]: === Iteration 1653 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:53,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:53,865 INFO L82 PathProgramCache]: Analyzing trace with hash -2119765194, now seen corresponding path program 1647 times [2020-01-16 19:09:53,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:53,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129399642] [2020-01-16 19:09:53,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:54,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129399642] [2020-01-16 19:09:54,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:54,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:54,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657501709] [2020-01-16 19:09:54,139 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:54,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:54,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:54,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:54,139 INFO L87 Difference]: Start difference. First operand 374 states and 1271 transitions. Second operand 9 states. [2020-01-16 19:09:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:54,245 INFO L93 Difference]: Finished difference Result 579 states and 1680 transitions. [2020-01-16 19:09:54,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:54,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:54,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:54,247 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:09:54,247 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:09:54,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:54,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:09:54,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 380. [2020-01-16 19:09:54,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:09:54,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1281 transitions. [2020-01-16 19:09:54,255 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1281 transitions. Word has length 22 [2020-01-16 19:09:54,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:54,255 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1281 transitions. [2020-01-16 19:09:54,255 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:54,255 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1281 transitions. [2020-01-16 19:09:54,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:54,256 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:54,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, 1, 1, 1] [2020-01-16 19:09:54,256 INFO L426 AbstractCegarLoop]: === Iteration 1654 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:54,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:54,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1926944502, now seen corresponding path program 1648 times [2020-01-16 19:09:54,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:54,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363156466] [2020-01-16 19:09:54,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:54,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-01-16 19:09:54,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363156466] [2020-01-16 19:09:54,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:54,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:54,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809038293] [2020-01-16 19:09:54,519 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:54,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:54,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:54,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:54,520 INFO L87 Difference]: Start difference. First operand 380 states and 1281 transitions. Second operand 9 states. [2020-01-16 19:09:54,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:54,626 INFO L93 Difference]: Finished difference Result 567 states and 1661 transitions. [2020-01-16 19:09:54,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:54,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:54,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:54,628 INFO L225 Difference]: With dead ends: 567 [2020-01-16 19:09:54,628 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:09:54,628 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:54,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:09:54,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 374. [2020-01-16 19:09:54,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:09:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1268 transitions. [2020-01-16 19:09:54,638 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1268 transitions. Word has length 22 [2020-01-16 19:09:54,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:54,638 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1268 transitions. [2020-01-16 19:09:54,638 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:54,638 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1268 transitions. [2020-01-16 19:09:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:54,639 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:54,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, 1, 1, 1] [2020-01-16 19:09:54,639 INFO L426 AbstractCegarLoop]: === Iteration 1655 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:54,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:54,639 INFO L82 PathProgramCache]: Analyzing trace with hash 207754734, now seen corresponding path program 1649 times [2020-01-16 19:09:54,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:54,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250514843] [2020-01-16 19:09:54,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:54,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-01-16 19:09:54,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250514843] [2020-01-16 19:09:54,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:54,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:54,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109212214] [2020-01-16 19:09:54,915 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:54,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:54,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:54,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:54,916 INFO L87 Difference]: Start difference. First operand 374 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:09:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:55,023 INFO L93 Difference]: Finished difference Result 569 states and 1655 transitions. [2020-01-16 19:09:55,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:55,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:55,025 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:09:55,025 INFO L226 Difference]: Without dead ends: 559 [2020-01-16 19:09:55,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:55,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-01-16 19:09:55,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 376. [2020-01-16 19:09:55,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:09:55,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1271 transitions. [2020-01-16 19:09:55,034 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1271 transitions. Word has length 22 [2020-01-16 19:09:55,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:55,034 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1271 transitions. [2020-01-16 19:09:55,034 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1271 transitions. [2020-01-16 19:09:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:55,035 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09: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, 1, 1, 1] [2020-01-16 19:09:55,035 INFO L426 AbstractCegarLoop]: === Iteration 1656 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:55,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:55,035 INFO L82 PathProgramCache]: Analyzing trace with hash 779209540, now seen corresponding path program 1650 times [2020-01-16 19:09:55,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:55,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535467113] [2020-01-16 19:09:55,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:55,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-01-16 19:09:55,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535467113] [2020-01-16 19:09:55,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:55,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:55,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345783503] [2020-01-16 19:09:55,300 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:55,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:55,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:55,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:55,300 INFO L87 Difference]: Start difference. First operand 376 states and 1271 transitions. Second operand 9 states. [2020-01-16 19:09:55,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:55,408 INFO L93 Difference]: Finished difference Result 563 states and 1651 transitions. [2020-01-16 19:09:55,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:55,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:55,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:55,409 INFO L225 Difference]: With dead ends: 563 [2020-01-16 19:09:55,410 INFO L226 Difference]: Without dead ends: 545 [2020-01-16 19:09:55,410 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-01-16 19:09:55,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 371. [2020-01-16 19:09:55,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:09:55,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1262 transitions. [2020-01-16 19:09:55,418 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1262 transitions. Word has length 22 [2020-01-16 19:09:55,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:55,419 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1262 transitions. [2020-01-16 19:09:55,419 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1262 transitions. [2020-01-16 19:09:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:55,419 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:55,419 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:55,419 INFO L426 AbstractCegarLoop]: === Iteration 1657 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:55,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:55,420 INFO L82 PathProgramCache]: Analyzing trace with hash 5837292, now seen corresponding path program 1651 times [2020-01-16 19:09:55,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:55,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142716726] [2020-01-16 19:09:55,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:55,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:55,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142716726] [2020-01-16 19:09:55,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:55,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:55,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687029237] [2020-01-16 19:09:55,700 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:55,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:55,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:55,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:55,700 INFO L87 Difference]: Start difference. First operand 371 states and 1262 transitions. Second operand 9 states. [2020-01-16 19:09:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:55,785 INFO L93 Difference]: Finished difference Result 551 states and 1615 transitions. [2020-01-16 19:09:55,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:55,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:55,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:55,786 INFO L225 Difference]: With dead ends: 551 [2020-01-16 19:09:55,786 INFO L226 Difference]: Without dead ends: 542 [2020-01-16 19:09:55,787 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:55,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-01-16 19:09:55,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 373. [2020-01-16 19:09:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-01-16 19:09:55,795 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-01-16 19:09:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:55,795 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-01-16 19:09:55,796 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-01-16 19:09:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:55,796 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:55,796 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:55,796 INFO L426 AbstractCegarLoop]: === Iteration 1658 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:55,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:55,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1616778250, now seen corresponding path program 1652 times [2020-01-16 19:09:55,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:55,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634141985] [2020-01-16 19:09:55,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:56,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634141985] [2020-01-16 19:09:56,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:56,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:56,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049037038] [2020-01-16 19:09:56,075 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:56,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:56,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:56,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:56,075 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:09:56,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:56,186 INFO L93 Difference]: Finished difference Result 552 states and 1616 transitions. [2020-01-16 19:09:56,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:56,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:56,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:56,188 INFO L225 Difference]: With dead ends: 552 [2020-01-16 19:09:56,188 INFO L226 Difference]: Without dead ends: 541 [2020-01-16 19:09:56,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:56,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-01-16 19:09:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 372. [2020-01-16 19:09:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:09:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1264 transitions. [2020-01-16 19:09:56,196 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1264 transitions. Word has length 22 [2020-01-16 19:09:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:56,196 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1264 transitions. [2020-01-16 19:09:56,196 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1264 transitions. [2020-01-16 19:09:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:56,197 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:56,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:56,197 INFO L426 AbstractCegarLoop]: === Iteration 1659 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:56,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:56,197 INFO L82 PathProgramCache]: Analyzing trace with hash -581908030, now seen corresponding path program 1653 times [2020-01-16 19:09:56,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:56,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574478873] [2020-01-16 19:09:56,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:56,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-01-16 19:09:56,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574478873] [2020-01-16 19:09:56,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:56,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:56,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788822523] [2020-01-16 19:09:56,468 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:56,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:56,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:56,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:56,468 INFO L87 Difference]: Start difference. First operand 372 states and 1264 transitions. Second operand 9 states. [2020-01-16 19:09:56,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:56,554 INFO L93 Difference]: Finished difference Result 553 states and 1619 transitions. [2020-01-16 19:09:56,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:56,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:56,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:56,556 INFO L225 Difference]: With dead ends: 553 [2020-01-16 19:09:56,556 INFO L226 Difference]: Without dead ends: 544 [2020-01-16 19:09:56,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:56,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-01-16 19:09:56,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 373. [2020-01-16 19:09:56,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1265 transitions. [2020-01-16 19:09:56,565 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1265 transitions. Word has length 22 [2020-01-16 19:09:56,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:56,565 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1265 transitions. [2020-01-16 19:09:56,565 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1265 transitions. [2020-01-16 19:09:56,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:56,566 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:56,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:56,566 INFO L426 AbstractCegarLoop]: === Iteration 1660 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:56,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:56,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1564262730, now seen corresponding path program 1654 times [2020-01-16 19:09:56,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:56,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18438935] [2020-01-16 19:09:56,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:56,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18438935] [2020-01-16 19:09:56,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:56,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:56,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399432740] [2020-01-16 19:09:56,837 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:56,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:56,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:56,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:56,837 INFO L87 Difference]: Start difference. First operand 373 states and 1265 transitions. Second operand 9 states. [2020-01-16 19:09:56,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:56,970 INFO L93 Difference]: Finished difference Result 548 states and 1618 transitions. [2020-01-16 19:09:56,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:56,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:56,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:56,972 INFO L225 Difference]: With dead ends: 548 [2020-01-16 19:09:56,972 INFO L226 Difference]: Without dead ends: 534 [2020-01-16 19:09:56,972 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:56,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-01-16 19:09:56,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 372. [2020-01-16 19:09:56,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:09:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1263 transitions. [2020-01-16 19:09:56,981 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1263 transitions. Word has length 22 [2020-01-16 19:09:56,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:56,981 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1263 transitions. [2020-01-16 19:09:56,981 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:56,981 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1263 transitions. [2020-01-16 19:09:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:56,981 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:56,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, 1, 1, 1] [2020-01-16 19:09:56,982 INFO L426 AbstractCegarLoop]: === Iteration 1661 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:56,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:56,982 INFO L82 PathProgramCache]: Analyzing trace with hash -571404926, now seen corresponding path program 1655 times [2020-01-16 19:09:56,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:56,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787838465] [2020-01-16 19:09:56,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:57,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787838465] [2020-01-16 19:09:57,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:57,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:57,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299413412] [2020-01-16 19:09:57,250 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:57,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:57,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:57,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:57,250 INFO L87 Difference]: Start difference. First operand 372 states and 1263 transitions. Second operand 9 states. [2020-01-16 19:09:57,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:57,359 INFO L93 Difference]: Finished difference Result 555 states and 1623 transitions. [2020-01-16 19:09:57,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:57,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:57,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:57,360 INFO L225 Difference]: With dead ends: 555 [2020-01-16 19:09:57,361 INFO L226 Difference]: Without dead ends: 545 [2020-01-16 19:09:57,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-01-16 19:09:57,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 374. [2020-01-16 19:09:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:09:57,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1266 transitions. [2020-01-16 19:09:57,370 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1266 transitions. Word has length 22 [2020-01-16 19:09:57,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:57,370 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1266 transitions. [2020-01-16 19:09:57,370 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1266 transitions. [2020-01-16 19:09:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:57,370 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:57,371 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:57,371 INFO L426 AbstractCegarLoop]: === Iteration 1662 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:57,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:57,371 INFO L82 PathProgramCache]: Analyzing trace with hash -36175124, now seen corresponding path program 1656 times [2020-01-16 19:09:57,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:57,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182903336] [2020-01-16 19:09:57,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:57,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-01-16 19:09:57,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182903336] [2020-01-16 19:09:57,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:57,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:57,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922487070] [2020-01-16 19:09:57,643 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:57,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:57,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:57,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:57,644 INFO L87 Difference]: Start difference. First operand 374 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:09:57,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:57,756 INFO L93 Difference]: Finished difference Result 549 states and 1619 transitions. [2020-01-16 19:09:57,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:57,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:57,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:57,757 INFO L225 Difference]: With dead ends: 549 [2020-01-16 19:09:57,758 INFO L226 Difference]: Without dead ends: 531 [2020-01-16 19:09:57,758 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:57,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-01-16 19:09:57,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 369. [2020-01-16 19:09:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-01-16 19:09:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1258 transitions. [2020-01-16 19:09:57,766 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1258 transitions. Word has length 22 [2020-01-16 19:09:57,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:57,766 INFO L478 AbstractCegarLoop]: Abstraction has 369 states and 1258 transitions. [2020-01-16 19:09:57,766 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:57,766 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1258 transitions. [2020-01-16 19:09:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:57,767 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:57,767 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:57,767 INFO L426 AbstractCegarLoop]: === Iteration 1663 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:57,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:57,767 INFO L82 PathProgramCache]: Analyzing trace with hash 995426200, now seen corresponding path program 1657 times [2020-01-16 19:09:57,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:57,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423083181] [2020-01-16 19:09:57,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:58,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-01-16 19:09:58,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423083181] [2020-01-16 19:09:58,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:58,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:58,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928326750] [2020-01-16 19:09:58,046 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:58,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:58,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:58,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:58,047 INFO L87 Difference]: Start difference. First operand 369 states and 1258 transitions. Second operand 9 states. [2020-01-16 19:09:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:58,154 INFO L93 Difference]: Finished difference Result 540 states and 1592 transitions. [2020-01-16 19:09:58,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:58,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:58,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:58,156 INFO L225 Difference]: With dead ends: 540 [2020-01-16 19:09:58,156 INFO L226 Difference]: Without dead ends: 529 [2020-01-16 19:09:58,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:58,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-01-16 19:09:58,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 372. [2020-01-16 19:09:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:09:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1266 transitions. [2020-01-16 19:09:58,165 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1266 transitions. Word has length 22 [2020-01-16 19:09:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:58,165 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1266 transitions. [2020-01-16 19:09:58,165 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1266 transitions. [2020-01-16 19:09:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:58,166 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:58,166 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:09:58,166 INFO L426 AbstractCegarLoop]: === Iteration 1664 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:58,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:58,166 INFO L82 PathProgramCache]: Analyzing trace with hash -450090810, now seen corresponding path program 1658 times [2020-01-16 19:09:58,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:58,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410016444] [2020-01-16 19:09:58,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:58,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:58,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410016444] [2020-01-16 19:09:58,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:58,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:58,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720939898] [2020-01-16 19:09:58,449 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:58,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:58,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:58,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:58,449 INFO L87 Difference]: Start difference. First operand 372 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:09:58,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:58,535 INFO L93 Difference]: Finished difference Result 538 states and 1587 transitions. [2020-01-16 19:09:58,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:58,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:58,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:58,537 INFO L225 Difference]: With dead ends: 538 [2020-01-16 19:09:58,537 INFO L226 Difference]: Without dead ends: 528 [2020-01-16 19:09:58,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:58,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-01-16 19:09:58,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 371. [2020-01-16 19:09:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:09:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1264 transitions. [2020-01-16 19:09:58,546 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1264 transitions. Word has length 22 [2020-01-16 19:09:58,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:58,547 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1264 transitions. [2020-01-16 19:09:58,547 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1264 transitions. [2020-01-16 19:09:58,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:58,547 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:58,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, 1, 1, 1] [2020-01-16 19:09:58,547 INFO L426 AbstractCegarLoop]: === Iteration 1665 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:58,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:58,547 INFO L82 PathProgramCache]: Analyzing trace with hash -605011654, now seen corresponding path program 1659 times [2020-01-16 19:09:58,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:58,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735504219] [2020-01-16 19:09:58,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:58,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735504219] [2020-01-16 19:09:58,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:58,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:58,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421690632] [2020-01-16 19:09:58,830 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:58,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:58,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:58,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:58,831 INFO L87 Difference]: Start difference. First operand 371 states and 1264 transitions. Second operand 9 states. [2020-01-16 19:09:58,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:58,941 INFO L93 Difference]: Finished difference Result 542 states and 1596 transitions. [2020-01-16 19:09:58,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:58,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:58,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:58,943 INFO L225 Difference]: With dead ends: 542 [2020-01-16 19:09:58,943 INFO L226 Difference]: Without dead ends: 531 [2020-01-16 19:09:58,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:58,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-01-16 19:09:58,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 373. [2020-01-16 19:09:58,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:09:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1267 transitions. [2020-01-16 19:09:58,952 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1267 transitions. Word has length 22 [2020-01-16 19:09:58,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:58,953 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1267 transitions. [2020-01-16 19:09:58,953 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:58,953 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1267 transitions. [2020-01-16 19:09:58,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:58,953 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:58,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, 1, 1, 1] [2020-01-16 19:09:58,953 INFO L426 AbstractCegarLoop]: === Iteration 1666 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:58,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:58,954 INFO L82 PathProgramCache]: Analyzing trace with hash -351918902, now seen corresponding path program 1660 times [2020-01-16 19:09:58,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:58,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523356157] [2020-01-16 19:09:58,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:59,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523356157] [2020-01-16 19:09:59,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:59,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:59,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203604061] [2020-01-16 19:09:59,229 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:59,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:59,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:59,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:59,229 INFO L87 Difference]: Start difference. First operand 373 states and 1267 transitions. Second operand 9 states. [2020-01-16 19:09:59,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:59,343 INFO L93 Difference]: Finished difference Result 541 states and 1592 transitions. [2020-01-16 19:09:59,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:59,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:59,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:59,345 INFO L225 Difference]: With dead ends: 541 [2020-01-16 19:09:59,345 INFO L226 Difference]: Without dead ends: 529 [2020-01-16 19:09:59,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:59,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-01-16 19:09:59,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 371. [2020-01-16 19:09:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:09:59,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1263 transitions. [2020-01-16 19:09:59,354 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1263 transitions. Word has length 22 [2020-01-16 19:09:59,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:59,354 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1263 transitions. [2020-01-16 19:09:59,354 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:59,354 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1263 transitions. [2020-01-16 19:09:59,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:59,355 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:59,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, 1, 1, 1] [2020-01-16 19:09:59,355 INFO L426 AbstractCegarLoop]: === Iteration 1667 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:59,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:59,355 INFO L82 PathProgramCache]: Analyzing trace with hash 644000778, now seen corresponding path program 1661 times [2020-01-16 19:09:59,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:59,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098635525] [2020-01-16 19:09:59,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:09:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:09:59,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098635525] [2020-01-16 19:09:59,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:09:59,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:09:59,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218111653] [2020-01-16 19:09:59,643 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:09:59,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:09:59,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:09:59,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:09:59,644 INFO L87 Difference]: Start difference. First operand 371 states and 1263 transitions. Second operand 9 states. [2020-01-16 19:09:59,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:09:59,727 INFO L93 Difference]: Finished difference Result 537 states and 1584 transitions. [2020-01-16 19:09:59,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:09:59,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:09:59,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:09:59,729 INFO L225 Difference]: With dead ends: 537 [2020-01-16 19:09:59,729 INFO L226 Difference]: Without dead ends: 528 [2020-01-16 19:09:59,729 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:09:59,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-01-16 19:09:59,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 372. [2020-01-16 19:09:59,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:09:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1264 transitions. [2020-01-16 19:09:59,737 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1264 transitions. Word has length 22 [2020-01-16 19:09:59,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:09:59,737 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1264 transitions. [2020-01-16 19:09:59,737 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:09:59,737 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1264 transitions. [2020-01-16 19:09:59,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:09:59,738 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:09:59,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, 1, 1, 1] [2020-01-16 19:09:59,738 INFO L426 AbstractCegarLoop]: === Iteration 1668 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:09:59,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:09:59,738 INFO L82 PathProgramCache]: Analyzing trace with hash -2040025560, now seen corresponding path program 1662 times [2020-01-16 19:09:59,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:09:59,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379824363] [2020-01-16 19:09:59,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:09:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:00,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-01-16 19:10:00,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379824363] [2020-01-16 19:10:00,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:00,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:00,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255518383] [2020-01-16 19:10:00,022 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:00,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:00,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:00,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:00,022 INFO L87 Difference]: Start difference. First operand 372 states and 1264 transitions. Second operand 9 states. [2020-01-16 19:10:00,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:00,131 INFO L93 Difference]: Finished difference Result 538 states and 1585 transitions. [2020-01-16 19:10:00,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:00,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:00,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:00,133 INFO L225 Difference]: With dead ends: 538 [2020-01-16 19:10:00,133 INFO L226 Difference]: Without dead ends: 526 [2020-01-16 19:10:00,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-01-16 19:10:00,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 370. [2020-01-16 19:10:00,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-01-16 19:10:00,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1261 transitions. [2020-01-16 19:10:00,141 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1261 transitions. Word has length 22 [2020-01-16 19:10:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:00,141 INFO L478 AbstractCegarLoop]: Abstraction has 370 states and 1261 transitions. [2020-01-16 19:10:00,141 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1261 transitions. [2020-01-16 19:10:00,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:00,142 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:00,142 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:00,142 INFO L426 AbstractCegarLoop]: === Iteration 1669 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:00,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:00,142 INFO L82 PathProgramCache]: Analyzing trace with hash -44809598, now seen corresponding path program 1663 times [2020-01-16 19:10:00,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:00,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663686488] [2020-01-16 19:10:00,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:00,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-01-16 19:10:00,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663686488] [2020-01-16 19:10:00,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:00,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:00,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045278051] [2020-01-16 19:10:00,412 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:00,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:00,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:00,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:00,412 INFO L87 Difference]: Start difference. First operand 370 states and 1261 transitions. Second operand 9 states. [2020-01-16 19:10:00,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:00,520 INFO L93 Difference]: Finished difference Result 543 states and 1598 transitions. [2020-01-16 19:10:00,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:00,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:00,522 INFO L225 Difference]: With dead ends: 543 [2020-01-16 19:10:00,522 INFO L226 Difference]: Without dead ends: 532 [2020-01-16 19:10:00,522 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:00,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-01-16 19:10:00,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 372. [2020-01-16 19:10:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:10:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1265 transitions. [2020-01-16 19:10:00,537 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1265 transitions. Word has length 22 [2020-01-16 19:10:00,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:00,538 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1265 transitions. [2020-01-16 19:10:00,538 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:00,538 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1265 transitions. [2020-01-16 19:10:00,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:00,538 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:00,538 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:00,538 INFO L426 AbstractCegarLoop]: === Iteration 1670 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:00,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:00,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1490326608, now seen corresponding path program 1664 times [2020-01-16 19:10:00,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:00,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493739064] [2020-01-16 19:10:00,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:00,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-01-16 19:10:00,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493739064] [2020-01-16 19:10:00,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:00,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:00,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694333290] [2020-01-16 19:10:00,811 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:00,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:00,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:00,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:00,811 INFO L87 Difference]: Start difference. First operand 372 states and 1265 transitions. Second operand 9 states. [2020-01-16 19:10:00,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:00,915 INFO L93 Difference]: Finished difference Result 541 states and 1593 transitions. [2020-01-16 19:10:00,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:00,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:00,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:00,917 INFO L225 Difference]: With dead ends: 541 [2020-01-16 19:10:00,917 INFO L226 Difference]: Without dead ends: 531 [2020-01-16 19:10:00,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:00,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-01-16 19:10:00,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 371. [2020-01-16 19:10:00,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:10:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1263 transitions. [2020-01-16 19:10:00,926 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1263 transitions. Word has length 22 [2020-01-16 19:10:00,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:00,926 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1263 transitions. [2020-01-16 19:10:00,926 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:00,926 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1263 transitions. [2020-01-16 19:10:00,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:00,927 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:00,927 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:00,927 INFO L426 AbstractCegarLoop]: === Iteration 1671 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:00,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:00,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2061974522, now seen corresponding path program 1665 times [2020-01-16 19:10:00,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:00,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261644099] [2020-01-16 19:10:00,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:01,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-01-16 19:10:01,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261644099] [2020-01-16 19:10:01,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:01,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:01,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125366198] [2020-01-16 19:10:01,191 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:01,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:01,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:01,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:01,191 INFO L87 Difference]: Start difference. First operand 371 states and 1263 transitions. Second operand 9 states. [2020-01-16 19:10:01,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:01,295 INFO L93 Difference]: Finished difference Result 546 states and 1606 transitions. [2020-01-16 19:10:01,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:01,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:01,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:01,297 INFO L225 Difference]: With dead ends: 546 [2020-01-16 19:10:01,297 INFO L226 Difference]: Without dead ends: 535 [2020-01-16 19:10:01,297 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:01,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-01-16 19:10:01,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 374. [2020-01-16 19:10:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:10:01,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1268 transitions. [2020-01-16 19:10:01,306 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1268 transitions. Word has length 22 [2020-01-16 19:10:01,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:01,306 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1268 transitions. [2020-01-16 19:10:01,306 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:01,306 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1268 transitions. [2020-01-16 19:10:01,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:01,307 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:01,307 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:01,307 INFO L426 AbstractCegarLoop]: === Iteration 1672 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:01,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:01,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1279975280, now seen corresponding path program 1666 times [2020-01-16 19:10:01,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:01,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112905884] [2020-01-16 19:10:01,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:01,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-01-16 19:10:01,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112905884] [2020-01-16 19:10:01,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:01,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:01,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296798743] [2020-01-16 19:10:01,568 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:01,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:01,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:01,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:01,569 INFO L87 Difference]: Start difference. First operand 374 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:10:01,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:01,679 INFO L93 Difference]: Finished difference Result 539 states and 1599 transitions. [2020-01-16 19:10:01,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:01,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:01,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:01,681 INFO L225 Difference]: With dead ends: 539 [2020-01-16 19:10:01,681 INFO L226 Difference]: Without dead ends: 523 [2020-01-16 19:10:01,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:01,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-01-16 19:10:01,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 371. [2020-01-16 19:10:01,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:10:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1262 transitions. [2020-01-16 19:10:01,690 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1262 transitions. Word has length 22 [2020-01-16 19:10:01,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:01,690 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1262 transitions. [2020-01-16 19:10:01,691 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1262 transitions. [2020-01-16 19:10:01,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:01,691 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:01,691 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:01,691 INFO L426 AbstractCegarLoop]: === Iteration 1673 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:01,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:01,691 INFO L82 PathProgramCache]: Analyzing trace with hash -983980342, now seen corresponding path program 1667 times [2020-01-16 19:10:01,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:01,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776192504] [2020-01-16 19:10:01,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:01,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-01-16 19:10:01,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776192504] [2020-01-16 19:10:01,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:01,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:01,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20119370] [2020-01-16 19:10:01,956 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:01,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:01,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:01,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:01,957 INFO L87 Difference]: Start difference. First operand 371 states and 1262 transitions. Second operand 9 states. [2020-01-16 19:10:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:02,066 INFO L93 Difference]: Finished difference Result 542 states and 1595 transitions. [2020-01-16 19:10:02,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:02,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:02,068 INFO L225 Difference]: With dead ends: 542 [2020-01-16 19:10:02,068 INFO L226 Difference]: Without dead ends: 533 [2020-01-16 19:10:02,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:02,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-01-16 19:10:02,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 372. [2020-01-16 19:10:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:10:02,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1263 transitions. [2020-01-16 19:10:02,077 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1263 transitions. Word has length 22 [2020-01-16 19:10:02,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:02,077 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1263 transitions. [2020-01-16 19:10:02,077 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1263 transitions. [2020-01-16 19:10:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:02,078 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:02,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, 1, 1, 1] [2020-01-16 19:10:02,078 INFO L426 AbstractCegarLoop]: === Iteration 1674 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:02,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:02,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1162190418, now seen corresponding path program 1668 times [2020-01-16 19:10:02,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:02,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116764239] [2020-01-16 19:10:02,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:02,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116764239] [2020-01-16 19:10:02,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:02,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:02,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927458847] [2020-01-16 19:10:02,356 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:02,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:02,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:02,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:02,356 INFO L87 Difference]: Start difference. First operand 372 states and 1263 transitions. Second operand 9 states. [2020-01-16 19:10:02,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:02,472 INFO L93 Difference]: Finished difference Result 537 states and 1594 transitions. [2020-01-16 19:10:02,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:02,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:02,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:02,473 INFO L225 Difference]: With dead ends: 537 [2020-01-16 19:10:02,473 INFO L226 Difference]: Without dead ends: 522 [2020-01-16 19:10:02,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:02,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-01-16 19:10:02,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 370. [2020-01-16 19:10:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-01-16 19:10:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1260 transitions. [2020-01-16 19:10:02,482 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1260 transitions. Word has length 22 [2020-01-16 19:10:02,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:02,482 INFO L478 AbstractCegarLoop]: Abstraction has 370 states and 1260 transitions. [2020-01-16 19:10:02,482 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:02,482 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1260 transitions. [2020-01-16 19:10:02,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:02,483 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:02,483 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:02,483 INFO L426 AbstractCegarLoop]: === Iteration 1675 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:02,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:02,483 INFO L82 PathProgramCache]: Analyzing trace with hash 280786626, now seen corresponding path program 1669 times [2020-01-16 19:10:02,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:02,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320690377] [2020-01-16 19:10:02,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:02,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:02,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320690377] [2020-01-16 19:10:02,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:02,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:02,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15470569] [2020-01-16 19:10:02,754 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:02,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:02,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:02,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:02,755 INFO L87 Difference]: Start difference. First operand 370 states and 1260 transitions. Second operand 9 states. [2020-01-16 19:10:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:02,864 INFO L93 Difference]: Finished difference Result 548 states and 1611 transitions. [2020-01-16 19:10:02,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:02,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:02,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:02,866 INFO L225 Difference]: With dead ends: 548 [2020-01-16 19:10:02,866 INFO L226 Difference]: Without dead ends: 537 [2020-01-16 19:10:02,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-01-16 19:10:02,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 374. [2020-01-16 19:10:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:10:02,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1270 transitions. [2020-01-16 19:10:02,875 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1270 transitions. Word has length 22 [2020-01-16 19:10:02,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:02,875 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1270 transitions. [2020-01-16 19:10:02,875 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:02,875 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1270 transitions. [2020-01-16 19:10:02,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:02,876 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:02,876 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:02,876 INFO L426 AbstractCegarLoop]: === Iteration 1676 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:02,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:02,876 INFO L82 PathProgramCache]: Analyzing trace with hash 533879378, now seen corresponding path program 1670 times [2020-01-16 19:10:02,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:02,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034049246] [2020-01-16 19:10:02,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:03,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034049246] [2020-01-16 19:10:03,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:03,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:03,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516497290] [2020-01-16 19:10:03,145 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:03,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:03,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:03,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:03,145 INFO L87 Difference]: Start difference. First operand 374 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:10:03,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:03,256 INFO L93 Difference]: Finished difference Result 547 states and 1607 transitions. [2020-01-16 19:10:03,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:03,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:03,258 INFO L225 Difference]: With dead ends: 547 [2020-01-16 19:10:03,258 INFO L226 Difference]: Without dead ends: 535 [2020-01-16 19:10:03,259 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:03,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-01-16 19:10:03,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 372. [2020-01-16 19:10:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:10:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1265 transitions. [2020-01-16 19:10:03,267 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1265 transitions. Word has length 22 [2020-01-16 19:10:03,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:03,267 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1265 transitions. [2020-01-16 19:10:03,268 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1265 transitions. [2020-01-16 19:10:03,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:03,268 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:03,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, 1, 1, 1] [2020-01-16 19:10:03,268 INFO L426 AbstractCegarLoop]: === Iteration 1677 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:03,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:03,268 INFO L82 PathProgramCache]: Analyzing trace with hash -306958696, now seen corresponding path program 1671 times [2020-01-16 19:10:03,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:03,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812890972] [2020-01-16 19:10:03,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:03,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:03,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812890972] [2020-01-16 19:10:03,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:03,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:03,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62658447] [2020-01-16 19:10:03,541 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:03,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:03,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:03,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:03,541 INFO L87 Difference]: Start difference. First operand 372 states and 1265 transitions. Second operand 9 states. [2020-01-16 19:10:03,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:03,646 INFO L93 Difference]: Finished difference Result 549 states and 1613 transitions. [2020-01-16 19:10:03,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:03,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:03,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:03,647 INFO L225 Difference]: With dead ends: 549 [2020-01-16 19:10:03,648 INFO L226 Difference]: Without dead ends: 538 [2020-01-16 19:10:03,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:03,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-01-16 19:10:03,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 375. [2020-01-16 19:10:03,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:10:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1270 transitions. [2020-01-16 19:10:03,656 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1270 transitions. Word has length 22 [2020-01-16 19:10:03,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:03,656 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1270 transitions. [2020-01-16 19:10:03,656 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1270 transitions. [2020-01-16 19:10:03,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:03,657 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:03,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, 1, 1, 1] [2020-01-16 19:10:03,657 INFO L426 AbstractCegarLoop]: === Iteration 1678 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:03,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:03,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1088957938, now seen corresponding path program 1672 times [2020-01-16 19:10:03,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:03,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556092888] [2020-01-16 19:10:03,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:03,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-01-16 19:10:03,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556092888] [2020-01-16 19:10:03,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:03,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:03,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395579591] [2020-01-16 19:10:03,919 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:03,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:03,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:03,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:03,920 INFO L87 Difference]: Start difference. First operand 375 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:10:04,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:04,030 INFO L93 Difference]: Finished difference Result 542 states and 1606 transitions. [2020-01-16 19:10:04,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:04,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:04,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:04,032 INFO L225 Difference]: With dead ends: 542 [2020-01-16 19:10:04,032 INFO L226 Difference]: Without dead ends: 526 [2020-01-16 19:10:04,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:04,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-01-16 19:10:04,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 372. [2020-01-16 19:10:04,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:10:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1263 transitions. [2020-01-16 19:10:04,040 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1263 transitions. Word has length 22 [2020-01-16 19:10:04,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:04,041 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1263 transitions. [2020-01-16 19:10:04,041 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1263 transitions. [2020-01-16 19:10:04,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:04,041 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:04,041 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:04,041 INFO L426 AbstractCegarLoop]: === Iteration 1679 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:04,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:04,042 INFO L82 PathProgramCache]: Analyzing trace with hash 13975730, now seen corresponding path program 1673 times [2020-01-16 19:10:04,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:04,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106433629] [2020-01-16 19:10:04,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:04,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106433629] [2020-01-16 19:10:04,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:04,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:04,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635260511] [2020-01-16 19:10:04,310 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:04,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:04,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:04,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:04,311 INFO L87 Difference]: Start difference. First operand 372 states and 1263 transitions. Second operand 9 states. [2020-01-16 19:10:04,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:04,420 INFO L93 Difference]: Finished difference Result 547 states and 1606 transitions. [2020-01-16 19:10:04,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:04,420 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:04,421 INFO L225 Difference]: With dead ends: 547 [2020-01-16 19:10:04,421 INFO L226 Difference]: Without dead ends: 537 [2020-01-16 19:10:04,422 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-01-16 19:10:04,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 374. [2020-01-16 19:10:04,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:10:04,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1266 transitions. [2020-01-16 19:10:04,430 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1266 transitions. Word has length 22 [2020-01-16 19:10:04,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:04,430 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1266 transitions. [2020-01-16 19:10:04,430 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1266 transitions. [2020-01-16 19:10:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:04,430 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:04,430 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:04,430 INFO L426 AbstractCegarLoop]: === Iteration 1680 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:04,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:04,431 INFO L82 PathProgramCache]: Analyzing trace with hash 585430536, now seen corresponding path program 1674 times [2020-01-16 19:10:04,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:04,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781466436] [2020-01-16 19:10:04,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:04,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781466436] [2020-01-16 19:10:04,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:04,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:04,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958485231] [2020-01-16 19:10:04,703 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:04,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:04,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:04,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:04,703 INFO L87 Difference]: Start difference. First operand 374 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:10:04,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:04,814 INFO L93 Difference]: Finished difference Result 541 states and 1602 transitions. [2020-01-16 19:10:04,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:04,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:04,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:04,815 INFO L225 Difference]: With dead ends: 541 [2020-01-16 19:10:04,815 INFO L226 Difference]: Without dead ends: 524 [2020-01-16 19:10:04,816 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-01-16 19:10:04,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 370. [2020-01-16 19:10:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-01-16 19:10:04,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1259 transitions. [2020-01-16 19:10:04,825 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1259 transitions. Word has length 22 [2020-01-16 19:10:04,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:04,825 INFO L478 AbstractCegarLoop]: Abstraction has 370 states and 1259 transitions. [2020-01-16 19:10:04,825 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:04,825 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1259 transitions. [2020-01-16 19:10:04,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:04,825 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:04,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, 1, 1, 1] [2020-01-16 19:10:04,826 INFO L426 AbstractCegarLoop]: === Iteration 1681 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:04,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:04,826 INFO L82 PathProgramCache]: Analyzing trace with hash -839134160, now seen corresponding path program 1675 times [2020-01-16 19:10:04,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:04,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612227647] [2020-01-16 19:10:04,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:05,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612227647] [2020-01-16 19:10:05,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:05,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:05,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937782079] [2020-01-16 19:10:05,111 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:05,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:05,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:05,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:05,111 INFO L87 Difference]: Start difference. First operand 370 states and 1259 transitions. Second operand 9 states. [2020-01-16 19:10:05,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:05,218 INFO L93 Difference]: Finished difference Result 538 states and 1585 transitions. [2020-01-16 19:10:05,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:05,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:05,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:05,220 INFO L225 Difference]: With dead ends: 538 [2020-01-16 19:10:05,220 INFO L226 Difference]: Without dead ends: 529 [2020-01-16 19:10:05,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:05,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-01-16 19:10:05,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 372. [2020-01-16 19:10:05,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:10:05,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1263 transitions. [2020-01-16 19:10:05,229 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1263 transitions. Word has length 22 [2020-01-16 19:10:05,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:05,229 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1263 transitions. [2020-01-16 19:10:05,229 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1263 transitions. [2020-01-16 19:10:05,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:05,230 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:05,230 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:05,230 INFO L426 AbstractCegarLoop]: === Iteration 1682 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:05,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:05,230 INFO L82 PathProgramCache]: Analyzing trace with hash 771806798, now seen corresponding path program 1676 times [2020-01-16 19:10:05,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:05,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527358267] [2020-01-16 19:10:05,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:05,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-01-16 19:10:05,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527358267] [2020-01-16 19:10:05,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:05,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:05,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222220561] [2020-01-16 19:10:05,515 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:05,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:05,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:05,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:05,515 INFO L87 Difference]: Start difference. First operand 372 states and 1263 transitions. Second operand 9 states. [2020-01-16 19:10:05,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:05,626 INFO L93 Difference]: Finished difference Result 539 states and 1586 transitions. [2020-01-16 19:10:05,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:05,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:05,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:05,628 INFO L225 Difference]: With dead ends: 539 [2020-01-16 19:10:05,628 INFO L226 Difference]: Without dead ends: 528 [2020-01-16 19:10:05,628 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:05,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-01-16 19:10:05,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 371. [2020-01-16 19:10:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:10:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1261 transitions. [2020-01-16 19:10:05,637 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1261 transitions. Word has length 22 [2020-01-16 19:10:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:05,637 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1261 transitions. [2020-01-16 19:10:05,637 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:05,637 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1261 transitions. [2020-01-16 19:10:05,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:05,638 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:05,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, 1, 1, 1] [2020-01-16 19:10:05,638 INFO L426 AbstractCegarLoop]: === Iteration 1683 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:05,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:05,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1426879482, now seen corresponding path program 1677 times [2020-01-16 19:10:05,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:05,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632985543] [2020-01-16 19:10:05,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:05,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-01-16 19:10:05,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632985543] [2020-01-16 19:10:05,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:05,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:05,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297188423] [2020-01-16 19:10:05,914 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:05,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:05,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:05,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:05,914 INFO L87 Difference]: Start difference. First operand 371 states and 1261 transitions. Second operand 9 states. [2020-01-16 19:10:06,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:06,001 INFO L93 Difference]: Finished difference Result 540 states and 1589 transitions. [2020-01-16 19:10:06,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:06,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:06,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:06,002 INFO L225 Difference]: With dead ends: 540 [2020-01-16 19:10:06,002 INFO L226 Difference]: Without dead ends: 531 [2020-01-16 19:10:06,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:06,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-01-16 19:10:06,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 372. [2020-01-16 19:10:06,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:10:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1262 transitions. [2020-01-16 19:10:06,011 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1262 transitions. Word has length 22 [2020-01-16 19:10:06,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:06,011 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1262 transitions. [2020-01-16 19:10:06,011 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:06,011 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1262 transitions. [2020-01-16 19:10:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:06,012 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:06,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, 1, 1, 1] [2020-01-16 19:10:06,012 INFO L426 AbstractCegarLoop]: === Iteration 1684 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:06,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:06,012 INFO L82 PathProgramCache]: Analyzing trace with hash 719291278, now seen corresponding path program 1678 times [2020-01-16 19:10:06,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:06,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897270425] [2020-01-16 19:10:06,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:06,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897270425] [2020-01-16 19:10:06,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:06,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:06,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561251918] [2020-01-16 19:10:06,280 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:06,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:06,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:06,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:06,280 INFO L87 Difference]: Start difference. First operand 372 states and 1262 transitions. Second operand 9 states. [2020-01-16 19:10:06,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:06,385 INFO L93 Difference]: Finished difference Result 535 states and 1588 transitions. [2020-01-16 19:10:06,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:06,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:06,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:06,387 INFO L225 Difference]: With dead ends: 535 [2020-01-16 19:10:06,387 INFO L226 Difference]: Without dead ends: 521 [2020-01-16 19:10:06,387 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-01-16 19:10:06,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 371. [2020-01-16 19:10:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:10:06,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1260 transitions. [2020-01-16 19:10:06,396 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1260 transitions. Word has length 22 [2020-01-16 19:10:06,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:06,397 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1260 transitions. [2020-01-16 19:10:06,397 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:06,397 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1260 transitions. [2020-01-16 19:10:06,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:06,397 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:06,397 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:06,397 INFO L426 AbstractCegarLoop]: === Iteration 1685 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:06,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:06,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1416376378, now seen corresponding path program 1679 times [2020-01-16 19:10:06,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:06,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587071838] [2020-01-16 19:10:06,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10: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-01-16 19:10:06,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587071838] [2020-01-16 19:10:06,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:06,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:06,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076660201] [2020-01-16 19:10:06,679 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:06,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:06,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:06,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:06,680 INFO L87 Difference]: Start difference. First operand 371 states and 1260 transitions. Second operand 9 states. [2020-01-16 19:10:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:06,811 INFO L93 Difference]: Finished difference Result 542 states and 1593 transitions. [2020-01-16 19:10:06,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:06,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:06,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:06,813 INFO L225 Difference]: With dead ends: 542 [2020-01-16 19:10:06,813 INFO L226 Difference]: Without dead ends: 532 [2020-01-16 19:10:06,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:06,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-01-16 19:10:06,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 373. [2020-01-16 19:10:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1263 transitions. [2020-01-16 19:10:06,822 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1263 transitions. Word has length 22 [2020-01-16 19:10:06,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:06,822 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1263 transitions. [2020-01-16 19:10:06,822 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1263 transitions. [2020-01-16 19:10:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:06,823 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:06,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, 1, 1, 1] [2020-01-16 19:10:06,823 INFO L426 AbstractCegarLoop]: === Iteration 1686 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:06,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:06,823 INFO L82 PathProgramCache]: Analyzing trace with hash -881146576, now seen corresponding path program 1680 times [2020-01-16 19:10:06,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:06,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619323319] [2020-01-16 19:10:06,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:07,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619323319] [2020-01-16 19:10:07,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:07,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:07,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561691788] [2020-01-16 19:10:07,095 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:07,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:07,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:07,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:07,096 INFO L87 Difference]: Start difference. First operand 373 states and 1263 transitions. Second operand 9 states. [2020-01-16 19:10:07,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:07,205 INFO L93 Difference]: Finished difference Result 536 states and 1589 transitions. [2020-01-16 19:10:07,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:07,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:07,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:07,206 INFO L225 Difference]: With dead ends: 536 [2020-01-16 19:10:07,206 INFO L226 Difference]: Without dead ends: 517 [2020-01-16 19:10:07,207 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:07,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-01-16 19:10:07,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 367. [2020-01-16 19:10:07,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2020-01-16 19:10:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1254 transitions. [2020-01-16 19:10:07,214 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1254 transitions. Word has length 22 [2020-01-16 19:10:07,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:07,215 INFO L478 AbstractCegarLoop]: Abstraction has 367 states and 1254 transitions. [2020-01-16 19:10:07,215 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:07,215 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1254 transitions. [2020-01-16 19:10:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:07,215 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:07,215 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:07,215 INFO L426 AbstractCegarLoop]: === Iteration 1687 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:07,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:07,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1625815878, now seen corresponding path program 1681 times [2020-01-16 19:10:07,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:07,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856174363] [2020-01-16 19:10:07,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:07,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:07,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856174363] [2020-01-16 19:10:07,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:07,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:07,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531404738] [2020-01-16 19:10:07,487 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:07,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:07,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:07,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:07,487 INFO L87 Difference]: Start difference. First operand 367 states and 1254 transitions. Second operand 9 states. [2020-01-16 19:10:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:07,569 INFO L93 Difference]: Finished difference Result 592 states and 1727 transitions. [2020-01-16 19:10:07,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:07,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:07,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:07,570 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:10:07,571 INFO L226 Difference]: Without dead ends: 576 [2020-01-16 19:10:07,571 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:07,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-01-16 19:10:07,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 377. [2020-01-16 19:10:07,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:10:07,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1284 transitions. [2020-01-16 19:10:07,579 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1284 transitions. Word has length 22 [2020-01-16 19:10:07,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:07,579 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1284 transitions. [2020-01-16 19:10:07,579 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1284 transitions. [2020-01-16 19:10:07,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:07,580 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:07,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, 1, 1, 1] [2020-01-16 19:10:07,580 INFO L426 AbstractCegarLoop]: === Iteration 1688 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:07,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:07,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1078885532, now seen corresponding path program 1682 times [2020-01-16 19:10:07,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:07,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19986192] [2020-01-16 19:10:07,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:07,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19986192] [2020-01-16 19:10:07,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:07,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:07,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622606169] [2020-01-16 19:10:07,850 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:07,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:07,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:07,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:07,850 INFO L87 Difference]: Start difference. First operand 377 states and 1284 transitions. Second operand 9 states. [2020-01-16 19:10:07,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:07,977 INFO L93 Difference]: Finished difference Result 587 states and 1714 transitions. [2020-01-16 19:10:07,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:07,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:07,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:07,978 INFO L225 Difference]: With dead ends: 587 [2020-01-16 19:10:07,978 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:10:07,979 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:07,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:10:07,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 373. [2020-01-16 19:10:07,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1276 transitions. [2020-01-16 19:10:07,987 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1276 transitions. Word has length 22 [2020-01-16 19:10:07,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:07,987 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1276 transitions. [2020-01-16 19:10:07,987 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:07,987 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1276 transitions. [2020-01-16 19:10:07,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:07,988 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:07,988 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:07,988 INFO L426 AbstractCegarLoop]: === Iteration 1689 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:07,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:07,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1316601098, now seen corresponding path program 1683 times [2020-01-16 19:10:07,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:07,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310567185] [2020-01-16 19:10:07,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:08,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310567185] [2020-01-16 19:10:08,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:08,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:08,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096257032] [2020-01-16 19:10:08,254 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:08,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:08,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:08,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:08,255 INFO L87 Difference]: Start difference. First operand 373 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:10:08,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:08,358 INFO L93 Difference]: Finished difference Result 588 states and 1715 transitions. [2020-01-16 19:10:08,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:08,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:08,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:08,359 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:10:08,359 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:10:08,360 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:08,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:10:08,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 375. [2020-01-16 19:10:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:10:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1278 transitions. [2020-01-16 19:10:08,368 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1278 transitions. Word has length 22 [2020-01-16 19:10:08,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:08,368 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1278 transitions. [2020-01-16 19:10:08,369 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:08,369 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1278 transitions. [2020-01-16 19:10:08,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:08,369 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:08,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, 1, 1, 1] [2020-01-16 19:10:08,369 INFO L426 AbstractCegarLoop]: === Iteration 1690 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:08,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:08,370 INFO L82 PathProgramCache]: Analyzing trace with hash -755532606, now seen corresponding path program 1684 times [2020-01-16 19:10:08,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:08,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352565578] [2020-01-16 19:10:08,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:08,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-01-16 19:10:08,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352565578] [2020-01-16 19:10:08,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:08,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:08,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378217881] [2020-01-16 19:10:08,639 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:08,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:08,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:08,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:08,639 INFO L87 Difference]: Start difference. First operand 375 states and 1278 transitions. Second operand 9 states. [2020-01-16 19:10:08,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:08,726 INFO L93 Difference]: Finished difference Result 581 states and 1700 transitions. [2020-01-16 19:10:08,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:08,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:08,727 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:10:08,728 INFO L226 Difference]: Without dead ends: 570 [2020-01-16 19:10:08,728 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:08,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-01-16 19:10:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 373. [2020-01-16 19:10:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1274 transitions. [2020-01-16 19:10:08,736 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1274 transitions. Word has length 22 [2020-01-16 19:10:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:08,736 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1274 transitions. [2020-01-16 19:10:08,736 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1274 transitions. [2020-01-16 19:10:08,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:08,737 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:08,737 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:08,737 INFO L426 AbstractCegarLoop]: === Iteration 1691 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:08,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:08,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1784075992, now seen corresponding path program 1685 times [2020-01-16 19:10:08,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:08,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57423938] [2020-01-16 19:10:08,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:09,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:09,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57423938] [2020-01-16 19:10:09,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:09,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:09,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290627360] [2020-01-16 19:10:09,008 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:09,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:09,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:09,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:09,009 INFO L87 Difference]: Start difference. First operand 373 states and 1274 transitions. Second operand 9 states. [2020-01-16 19:10:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:09,135 INFO L93 Difference]: Finished difference Result 577 states and 1693 transitions. [2020-01-16 19:10:09,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:09,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:09,136 INFO L225 Difference]: With dead ends: 577 [2020-01-16 19:10:09,136 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:10:09,137 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:09,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:10:09,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 374. [2020-01-16 19:10:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:10:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1275 transitions. [2020-01-16 19:10:09,146 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1275 transitions. Word has length 22 [2020-01-16 19:10:09,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:09,146 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1275 transitions. [2020-01-16 19:10:09,146 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:09,146 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1275 transitions. [2020-01-16 19:10:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:09,147 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:09,147 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:09,147 INFO L426 AbstractCegarLoop]: === Iteration 1692 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:09,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:09,147 INFO L82 PathProgramCache]: Analyzing trace with hash 338558982, now seen corresponding path program 1686 times [2020-01-16 19:10:09,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:09,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468957577] [2020-01-16 19:10:09,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:09,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-01-16 19:10:09,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468957577] [2020-01-16 19:10:09,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:09,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:09,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252035084] [2020-01-16 19:10:09,422 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:09,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:09,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:09,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:09,422 INFO L87 Difference]: Start difference. First operand 374 states and 1275 transitions. Second operand 9 states. [2020-01-16 19:10:09,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:09,509 INFO L93 Difference]: Finished difference Result 575 states and 1688 transitions. [2020-01-16 19:10:09,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:09,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:09,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:09,511 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:10:09,511 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:10:09,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:09,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:10:09,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 371. [2020-01-16 19:10:09,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:10:09,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1270 transitions. [2020-01-16 19:10:09,527 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1270 transitions. Word has length 22 [2020-01-16 19:10:09,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:09,527 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1270 transitions. [2020-01-16 19:10:09,527 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:09,527 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1270 transitions. [2020-01-16 19:10:09,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:09,528 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:09,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, 1, 1, 1] [2020-01-16 19:10:09,528 INFO L426 AbstractCegarLoop]: === Iteration 1693 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:09,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:09,528 INFO L82 PathProgramCache]: Analyzing trace with hash -556722788, now seen corresponding path program 1687 times [2020-01-16 19:10:09,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:09,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155793325] [2020-01-16 19:10:09,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:09,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-01-16 19:10:09,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155793325] [2020-01-16 19:10:09,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:09,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:09,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75781202] [2020-01-16 19:10:09,809 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:09,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:09,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:09,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:09,810 INFO L87 Difference]: Start difference. First operand 371 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:10:09,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:09,889 INFO L93 Difference]: Finished difference Result 602 states and 1754 transitions. [2020-01-16 19:10:09,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:09,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:09,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:09,890 INFO L225 Difference]: With dead ends: 602 [2020-01-16 19:10:09,891 INFO L226 Difference]: Without dead ends: 586 [2020-01-16 19:10:09,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:09,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-01-16 19:10:09,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 379. [2020-01-16 19:10:09,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:10:09,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1290 transitions. [2020-01-16 19:10:09,899 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1290 transitions. Word has length 22 [2020-01-16 19:10:09,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:09,900 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1290 transitions. [2020-01-16 19:10:09,900 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:09,900 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1290 transitions. [2020-01-16 19:10:09,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:09,900 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:09,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:09,900 INFO L426 AbstractCegarLoop]: === Iteration 1694 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:09,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:09,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1033543098, now seen corresponding path program 1688 times [2020-01-16 19:10:09,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:09,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064146732] [2020-01-16 19:10:09,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:10,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064146732] [2020-01-16 19:10:10,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:10,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:10,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658552204] [2020-01-16 19:10:10,169 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:10,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:10,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:10,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:10,169 INFO L87 Difference]: Start difference. First operand 379 states and 1290 transitions. Second operand 9 states. [2020-01-16 19:10:10,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:10,281 INFO L93 Difference]: Finished difference Result 597 states and 1741 transitions. [2020-01-16 19:10:10,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:10,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:10,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:10,282 INFO L225 Difference]: With dead ends: 597 [2020-01-16 19:10:10,283 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 19:10:10,283 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:10,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 19:10:10,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 375. [2020-01-16 19:10:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:10:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1280 transitions. [2020-01-16 19:10:10,291 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1280 transitions. Word has length 22 [2020-01-16 19:10:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:10,292 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1280 transitions. [2020-01-16 19:10:10,292 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1280 transitions. [2020-01-16 19:10:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:10,292 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:10,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, 1, 1, 1] [2020-01-16 19:10:10,292 INFO L426 AbstractCegarLoop]: === Iteration 1695 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:10,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:10,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1905399540, now seen corresponding path program 1689 times [2020-01-16 19:10:10,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:10,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392480984] [2020-01-16 19:10:10,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:10,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-01-16 19:10:10,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392480984] [2020-01-16 19:10:10,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:10,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:10,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111584774] [2020-01-16 19:10:10,570 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:10,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:10,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:10,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:10,571 INFO L87 Difference]: Start difference. First operand 375 states and 1280 transitions. Second operand 9 states. [2020-01-16 19:10:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:10,676 INFO L93 Difference]: Finished difference Result 604 states and 1755 transitions. [2020-01-16 19:10:10,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:10,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:10,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:10,678 INFO L225 Difference]: With dead ends: 604 [2020-01-16 19:10:10,678 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 19:10:10,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:10,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 19:10:10,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 380. [2020-01-16 19:10:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:10:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1288 transitions. [2020-01-16 19:10:10,687 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1288 transitions. Word has length 22 [2020-01-16 19:10:10,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:10,687 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1288 transitions. [2020-01-16 19:10:10,687 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:10,687 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1288 transitions. [2020-01-16 19:10:10,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:10,688 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:10,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, 1, 1, 1] [2020-01-16 19:10:10,688 INFO L426 AbstractCegarLoop]: === Iteration 1696 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:10,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:10,688 INFO L82 PathProgramCache]: Analyzing trace with hash 688239854, now seen corresponding path program 1690 times [2020-01-16 19:10:10,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:10,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040678889] [2020-01-16 19:10:10,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:10,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-01-16 19:10:10,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040678889] [2020-01-16 19:10:10,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:10,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:10,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011617316] [2020-01-16 19:10:10,960 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:10,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:10,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:10,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:10,960 INFO L87 Difference]: Start difference. First operand 380 states and 1288 transitions. Second operand 9 states. [2020-01-16 19:10:11,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:11,090 INFO L93 Difference]: Finished difference Result 600 states and 1743 transitions. [2020-01-16 19:10:11,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:11,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:11,092 INFO L225 Difference]: With dead ends: 600 [2020-01-16 19:10:11,092 INFO L226 Difference]: Without dead ends: 583 [2020-01-16 19:10:11,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-01-16 19:10:11,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 375. [2020-01-16 19:10:11,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:10:11,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-01-16 19:10:11,102 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-01-16 19:10:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:11,102 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-01-16 19:10:11,102 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-01-16 19:10:11,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:11,102 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:11,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, 1, 1, 1] [2020-01-16 19:10:11,103 INFO L426 AbstractCegarLoop]: === Iteration 1697 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:11,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:11,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1174271342, now seen corresponding path program 1691 times [2020-01-16 19:10:11,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:11,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489817886] [2020-01-16 19:10:11,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:11,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-01-16 19:10:11,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489817886] [2020-01-16 19:10:11,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:11,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:11,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889755580] [2020-01-16 19:10:11,375 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:11,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:11,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:11,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:11,376 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:10:11,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:11,514 INFO L93 Difference]: Finished difference Result 592 states and 1728 transitions. [2020-01-16 19:10:11,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:11,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:11,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:11,516 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:10:11,516 INFO L226 Difference]: Without dead ends: 581 [2020-01-16 19:10:11,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-01-16 19:10:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 378. [2020-01-16 19:10:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:10:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1281 transitions. [2020-01-16 19:10:11,524 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1281 transitions. Word has length 22 [2020-01-16 19:10:11,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:11,524 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1281 transitions. [2020-01-16 19:10:11,524 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1281 transitions. [2020-01-16 19:10:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:11,524 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:11,524 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:11,525 INFO L426 AbstractCegarLoop]: === Iteration 1698 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:11,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:11,525 INFO L82 PathProgramCache]: Analyzing trace with hash 2048012022, now seen corresponding path program 1692 times [2020-01-16 19:10:11,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:11,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674737697] [2020-01-16 19:10:11,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:11,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-01-16 19:10:11,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674737697] [2020-01-16 19:10:11,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:11,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:11,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300368533] [2020-01-16 19:10:11,797 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:11,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:11,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:11,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:11,798 INFO L87 Difference]: Start difference. First operand 378 states and 1281 transitions. Second operand 9 states. [2020-01-16 19:10:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:11,899 INFO L93 Difference]: Finished difference Result 593 states and 1727 transitions. [2020-01-16 19:10:11,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:11,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:11,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:11,901 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:10:11,901 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:10:11,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:11,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:10:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 371. [2020-01-16 19:10:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:10:11,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1268 transitions. [2020-01-16 19:10:11,909 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1268 transitions. Word has length 22 [2020-01-16 19:10:11,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:11,909 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1268 transitions. [2020-01-16 19:10:11,909 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:11,910 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1268 transitions. [2020-01-16 19:10:11,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:11,910 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:11,910 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:11,910 INFO L426 AbstractCegarLoop]: === Iteration 1699 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:11,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:11,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1766544522, now seen corresponding path program 1693 times [2020-01-16 19:10:11,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:11,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636793517] [2020-01-16 19:10:11,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:12,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636793517] [2020-01-16 19:10:12,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:12,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:12,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702290373] [2020-01-16 19:10:12,174 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:12,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:12,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:12,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:12,175 INFO L87 Difference]: Start difference. First operand 371 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:10:12,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:12,261 INFO L93 Difference]: Finished difference Result 590 states and 1718 transitions. [2020-01-16 19:10:12,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:12,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:12,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:12,263 INFO L225 Difference]: With dead ends: 590 [2020-01-16 19:10:12,263 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:10:12,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:12,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:10:12,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 375. [2020-01-16 19:10:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:10:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-01-16 19:10:12,272 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-01-16 19:10:12,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:12,272 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-01-16 19:10:12,272 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-01-16 19:10:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:12,273 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:12,273 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:12,273 INFO L426 AbstractCegarLoop]: === Iteration 1700 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:12,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:12,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1205476030, now seen corresponding path program 1694 times [2020-01-16 19:10:12,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:12,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412812510] [2020-01-16 19:10:12,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:12,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412812510] [2020-01-16 19:10:12,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:12,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:12,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541280881] [2020-01-16 19:10:12,540 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:12,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:12,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:12,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:12,540 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:10:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:12,616 INFO L93 Difference]: Finished difference Result 583 states and 1703 transitions. [2020-01-16 19:10:12,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:12,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:12,618 INFO L225 Difference]: With dead ends: 583 [2020-01-16 19:10:12,618 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:10:12,618 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:10:12,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 373. [2020-01-16 19:10:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-01-16 19:10:12,627 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-01-16 19:10:12,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:12,627 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-01-16 19:10:12,627 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:12,627 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-01-16 19:10:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:12,628 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:12,628 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:12,628 INFO L426 AbstractCegarLoop]: === Iteration 1701 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:12,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:12,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1940677452, now seen corresponding path program 1695 times [2020-01-16 19:10:12,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:12,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020469309] [2020-01-16 19:10:12,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:12,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:12,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020469309] [2020-01-16 19:10:12,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:12,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:12,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862990608] [2020-01-16 19:10:12,901 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:12,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:12,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:12,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:12,902 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-01-16 19:10:12,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:12,979 INFO L93 Difference]: Finished difference Result 596 states and 1731 transitions. [2020-01-16 19:10:12,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:12,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:12,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:12,980 INFO L225 Difference]: With dead ends: 596 [2020-01-16 19:10:12,980 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:10:12,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:10:12,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 378. [2020-01-16 19:10:12,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:10:12,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1280 transitions. [2020-01-16 19:10:12,989 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1280 transitions. Word has length 22 [2020-01-16 19:10:12,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:12,989 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1280 transitions. [2020-01-16 19:10:12,989 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:12,990 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1280 transitions. [2020-01-16 19:10:12,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:12,990 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:12,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, 1, 1, 1] [2020-01-16 19:10:12,990 INFO L426 AbstractCegarLoop]: === Iteration 1702 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:12,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:12,990 INFO L82 PathProgramCache]: Analyzing trace with hash -332373186, now seen corresponding path program 1696 times [2020-01-16 19:10:12,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:12,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426494906] [2020-01-16 19:10:12,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:13,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-01-16 19:10:13,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426494906] [2020-01-16 19:10:13,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:13,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:13,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386884834] [2020-01-16 19:10:13,260 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:13,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:13,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:13,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:13,260 INFO L87 Difference]: Start difference. First operand 378 states and 1280 transitions. Second operand 9 states. [2020-01-16 19:10:13,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:13,359 INFO L93 Difference]: Finished difference Result 592 states and 1719 transitions. [2020-01-16 19:10:13,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:13,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:13,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:13,361 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:10:13,361 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:10:13,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:13,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:10:13,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 373. [2020-01-16 19:10:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-01-16 19:10:13,370 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-01-16 19:10:13,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:13,370 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-01-16 19:10:13,370 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-01-16 19:10:13,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:13,371 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:13,371 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:13,371 INFO L426 AbstractCegarLoop]: === Iteration 1703 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:13,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:13,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1995399678, now seen corresponding path program 1697 times [2020-01-16 19:10:13,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:13,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222465098] [2020-01-16 19:10:13,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:13,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-01-16 19:10:13,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222465098] [2020-01-16 19:10:13,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:13,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:13,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826276316] [2020-01-16 19:10:13,644 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:13,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:13,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:13,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:13,645 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:10:13,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:13,723 INFO L93 Difference]: Finished difference Result 578 states and 1692 transitions. [2020-01-16 19:10:13,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:13,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:13,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:13,724 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:10:13,725 INFO L226 Difference]: Without dead ends: 569 [2020-01-16 19:10:13,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:13,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-01-16 19:10:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 374. [2020-01-16 19:10:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:10:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1271 transitions. [2020-01-16 19:10:13,734 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1271 transitions. Word has length 22 [2020-01-16 19:10:13,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:13,734 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1271 transitions. [2020-01-16 19:10:13,734 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:13,734 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1271 transitions. [2020-01-16 19:10:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:13,735 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:13,735 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:13,735 INFO L426 AbstractCegarLoop]: === Iteration 1704 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:13,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:13,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1764337816, now seen corresponding path program 1698 times [2020-01-16 19:10:13,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:13,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941331076] [2020-01-16 19:10:13,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:13,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-01-16 19:10:13,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941331076] [2020-01-16 19:10:13,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:13,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:13,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002492051] [2020-01-16 19:10:13,999 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:13,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:13,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:13,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:13,999 INFO L87 Difference]: Start difference. First operand 374 states and 1271 transitions. Second operand 9 states. [2020-01-16 19:10:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:14,101 INFO L93 Difference]: Finished difference Result 581 states and 1697 transitions. [2020-01-16 19:10:14,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:14,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:14,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:14,102 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:10:14,103 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:10:14,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:14,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:10:14,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 371. [2020-01-16 19:10:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:10:14,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1266 transitions. [2020-01-16 19:10:14,111 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1266 transitions. Word has length 22 [2020-01-16 19:10:14,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:14,111 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1266 transitions. [2020-01-16 19:10:14,112 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:14,112 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1266 transitions. [2020-01-16 19:10:14,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:14,112 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:14,112 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:14,112 INFO L426 AbstractCegarLoop]: === Iteration 1705 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:14,112 INFO L82 PathProgramCache]: Analyzing trace with hash 891233428, now seen corresponding path program 1699 times [2020-01-16 19:10:14,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:14,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341449180] [2020-01-16 19:10:14,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:14,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:14,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341449180] [2020-01-16 19:10:14,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:14,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:14,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901372102] [2020-01-16 19:10:14,388 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:14,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:14,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:14,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:14,388 INFO L87 Difference]: Start difference. First operand 371 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:10:14,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:14,488 INFO L93 Difference]: Finished difference Result 570 states and 1677 transitions. [2020-01-16 19:10:14,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:14,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:14,490 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:10:14,490 INFO L226 Difference]: Without dead ends: 559 [2020-01-16 19:10:14,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-01-16 19:10:14,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 373. [2020-01-16 19:10:14,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:14,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-01-16 19:10:14,499 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-01-16 19:10:14,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:14,499 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-01-16 19:10:14,499 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:14,499 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-01-16 19:10:14,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:14,500 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:14,500 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:14,500 INFO L426 AbstractCegarLoop]: === Iteration 1706 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:14,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:14,500 INFO L82 PathProgramCache]: Analyzing trace with hash -554283582, now seen corresponding path program 1700 times [2020-01-16 19:10:14,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:14,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747723657] [2020-01-16 19:10:14,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:14,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-01-16 19:10:14,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747723657] [2020-01-16 19:10:14,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:14,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:14,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591380996] [2020-01-16 19:10:14,779 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:14,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:14,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:14,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:14,780 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:10:14,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:14,864 INFO L93 Difference]: Finished difference Result 568 states and 1672 transitions. [2020-01-16 19:10:14,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:14,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:14,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:14,866 INFO L225 Difference]: With dead ends: 568 [2020-01-16 19:10:14,866 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:10:14,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:14,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:10:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 372. [2020-01-16 19:10:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:10:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1268 transitions. [2020-01-16 19:10:14,875 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1268 transitions. Word has length 22 [2020-01-16 19:10:14,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:14,875 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1268 transitions. [2020-01-16 19:10:14,875 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:14,875 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1268 transitions. [2020-01-16 19:10:14,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:14,875 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:14,875 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:14,876 INFO L426 AbstractCegarLoop]: === Iteration 1707 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:14,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:14,876 INFO L82 PathProgramCache]: Analyzing trace with hash 303488106, now seen corresponding path program 1701 times [2020-01-16 19:10:14,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:14,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192113216] [2020-01-16 19:10:14,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:15,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-01-16 19:10:15,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192113216] [2020-01-16 19:10:15,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:15,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:15,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771277180] [2020-01-16 19:10:15,149 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:15,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:15,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:15,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:15,149 INFO L87 Difference]: Start difference. First operand 372 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:10:15,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:15,247 INFO L93 Difference]: Finished difference Result 575 states and 1688 transitions. [2020-01-16 19:10:15,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:15,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:15,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:15,249 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:10:15,249 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 19:10:15,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:15,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 19:10:15,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 375. [2020-01-16 19:10:15,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:10:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1273 transitions. [2020-01-16 19:10:15,258 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1273 transitions. Word has length 22 [2020-01-16 19:10:15,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:15,258 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1273 transitions. [2020-01-16 19:10:15,258 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1273 transitions. [2020-01-16 19:10:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:15,259 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:15,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, 1, 1, 1] [2020-01-16 19:10:15,259 INFO L426 AbstractCegarLoop]: === Iteration 1708 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:15,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:15,259 INFO L82 PathProgramCache]: Analyzing trace with hash 605506050, now seen corresponding path program 1702 times [2020-01-16 19:10:15,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:15,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325941892] [2020-01-16 19:10:15,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10: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-01-16 19:10:15,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325941892] [2020-01-16 19:10:15,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:15,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:15,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575823345] [2020-01-16 19:10:15,533 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:15,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:15,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:15,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:15,534 INFO L87 Difference]: Start difference. First operand 375 states and 1273 transitions. Second operand 9 states. [2020-01-16 19:10:15,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:15,654 INFO L93 Difference]: Finished difference Result 576 states and 1687 transitions. [2020-01-16 19:10:15,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:15,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:15,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:15,656 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:10:15,656 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:10:15,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:15,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:10:15,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 372. [2020-01-16 19:10:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:10:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1267 transitions. [2020-01-16 19:10:15,665 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1267 transitions. Word has length 22 [2020-01-16 19:10:15,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:15,666 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1267 transitions. [2020-01-16 19:10:15,666 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1267 transitions. [2020-01-16 19:10:15,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:15,666 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:15,666 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:15,666 INFO L426 AbstractCegarLoop]: === Iteration 1709 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:15,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:15,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1552500538, now seen corresponding path program 1703 times [2020-01-16 19:10:15,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:15,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386426406] [2020-01-16 19:10:15,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:15,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:15,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386426406] [2020-01-16 19:10:15,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:15,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:15,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668102858] [2020-01-16 19:10:15,937 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:15,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:15,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:15,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:15,938 INFO L87 Difference]: Start difference. First operand 372 states and 1267 transitions. Second operand 9 states. [2020-01-16 19:10:16,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:16,013 INFO L93 Difference]: Finished difference Result 569 states and 1673 transitions. [2020-01-16 19:10:16,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:16,013 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:16,015 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:10:16,015 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:10:16,015 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:16,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:10:16,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 373. [2020-01-16 19:10:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-01-16 19:10:16,024 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-01-16 19:10:16,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:16,024 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-01-16 19:10:16,024 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-01-16 19:10:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:16,025 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:16,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, 1, 1, 1] [2020-01-16 19:10:16,025 INFO L426 AbstractCegarLoop]: === Iteration 1710 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:16,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:16,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2087730340, now seen corresponding path program 1704 times [2020-01-16 19:10:16,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:16,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513457570] [2020-01-16 19:10:16,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:16,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-01-16 19:10:16,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513457570] [2020-01-16 19:10:16,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:16,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:16,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532404375] [2020-01-16 19:10:16,296 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:16,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:16,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:16,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:16,296 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:10:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:16,403 INFO L93 Difference]: Finished difference Result 572 states and 1678 transitions. [2020-01-16 19:10:16,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:16,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:16,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:16,405 INFO L225 Difference]: With dead ends: 572 [2020-01-16 19:10:16,405 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:10:16,405 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:16,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:10:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 369. [2020-01-16 19:10:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-01-16 19:10:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1262 transitions. [2020-01-16 19:10:16,414 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1262 transitions. Word has length 22 [2020-01-16 19:10:16,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:16,414 INFO L478 AbstractCegarLoop]: Abstraction has 369 states and 1262 transitions. [2020-01-16 19:10:16,414 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1262 transitions. [2020-01-16 19:10:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:16,415 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:16,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, 1, 1, 1] [2020-01-16 19:10:16,415 INFO L426 AbstractCegarLoop]: === Iteration 1711 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:16,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:16,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1413660260, now seen corresponding path program 1705 times [2020-01-16 19:10:16,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:16,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990349407] [2020-01-16 19:10:16,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:16,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-01-16 19:10:16,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990349407] [2020-01-16 19:10:16,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:16,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:16,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3016830] [2020-01-16 19:10:16,669 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:16,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:16,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:16,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:16,669 INFO L87 Difference]: Start difference. First operand 369 states and 1262 transitions. Second operand 9 states. [2020-01-16 19:10:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:16,745 INFO L93 Difference]: Finished difference Result 590 states and 1716 transitions. [2020-01-16 19:10:16,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:16,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:16,747 INFO L225 Difference]: With dead ends: 590 [2020-01-16 19:10:16,747 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:10:16,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:16,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:10:16,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 377. [2020-01-16 19:10:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:10:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1282 transitions. [2020-01-16 19:10:16,756 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1282 transitions. Word has length 22 [2020-01-16 19:10:16,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:16,756 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1282 transitions. [2020-01-16 19:10:16,756 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:16,756 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1282 transitions. [2020-01-16 19:10:16,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:16,757 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:16,757 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:16,757 INFO L426 AbstractCegarLoop]: === Iteration 1712 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:16,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:16,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1291041150, now seen corresponding path program 1706 times [2020-01-16 19:10:16,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:16,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151033168] [2020-01-16 19:10:16,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:17,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151033168] [2020-01-16 19:10:17,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:17,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:17,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005059611] [2020-01-16 19:10:17,007 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:17,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:17,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:17,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:17,007 INFO L87 Difference]: Start difference. First operand 377 states and 1282 transitions. Second operand 9 states. [2020-01-16 19:10:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:17,113 INFO L93 Difference]: Finished difference Result 585 states and 1703 transitions. [2020-01-16 19:10:17,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:17,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:17,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:17,114 INFO L225 Difference]: With dead ends: 585 [2020-01-16 19:10:17,114 INFO L226 Difference]: Without dead ends: 570 [2020-01-16 19:10:17,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:17,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-01-16 19:10:17,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 373. [2020-01-16 19:10:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:17,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1274 transitions. [2020-01-16 19:10:17,124 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1274 transitions. Word has length 22 [2020-01-16 19:10:17,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:17,124 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1274 transitions. [2020-01-16 19:10:17,124 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:17,124 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1274 transitions. [2020-01-16 19:10:17,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:17,124 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:17,124 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:17,125 INFO L426 AbstractCegarLoop]: === Iteration 1713 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:17,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:17,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1528756716, now seen corresponding path program 1707 times [2020-01-16 19:10:17,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:17,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488534856] [2020-01-16 19:10:17,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:17,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488534856] [2020-01-16 19:10:17,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:17,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:17,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71169693] [2020-01-16 19:10:17,372 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:17,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:17,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:17,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:17,372 INFO L87 Difference]: Start difference. First operand 373 states and 1274 transitions. Second operand 9 states. [2020-01-16 19:10:17,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:17,448 INFO L93 Difference]: Finished difference Result 586 states and 1704 transitions. [2020-01-16 19:10:17,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:17,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:17,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:17,449 INFO L225 Difference]: With dead ends: 586 [2020-01-16 19:10:17,449 INFO L226 Difference]: Without dead ends: 570 [2020-01-16 19:10:17,450 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-01-16 19:10:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 375. [2020-01-16 19:10:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:10:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-01-16 19:10:17,458 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-01-16 19:10:17,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:17,458 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-01-16 19:10:17,458 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-01-16 19:10:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:17,459 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:17,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, 1, 1, 1] [2020-01-16 19:10:17,459 INFO L426 AbstractCegarLoop]: === Iteration 1714 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:17,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:17,459 INFO L82 PathProgramCache]: Analyzing trace with hash -967688224, now seen corresponding path program 1708 times [2020-01-16 19:10:17,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:17,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809561930] [2020-01-16 19:10:17,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:17,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809561930] [2020-01-16 19:10:17,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:17,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:17,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166303364] [2020-01-16 19:10:17,707 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:17,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:17,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:17,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:17,707 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:10:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:17,789 INFO L93 Difference]: Finished difference Result 579 states and 1689 transitions. [2020-01-16 19:10:17,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:17,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:17,791 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:10:17,791 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:10:17,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:17,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:10:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 373. [2020-01-16 19:10:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:17,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-01-16 19:10:17,799 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-01-16 19:10:17,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:17,800 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-01-16 19:10:17,800 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:17,800 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-01-16 19:10:17,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:17,800 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:17,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, 1, 1, 1] [2020-01-16 19:10:17,800 INFO L426 AbstractCegarLoop]: === Iteration 1715 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:17,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:17,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1571920374, now seen corresponding path program 1709 times [2020-01-16 19:10:17,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:17,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037947540] [2020-01-16 19:10:17,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:18,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-01-16 19:10:18,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037947540] [2020-01-16 19:10:18,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:18,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:18,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603882058] [2020-01-16 19:10:18,049 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:18,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:18,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:18,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:18,049 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-01-16 19:10:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:18,151 INFO L93 Difference]: Finished difference Result 575 states and 1682 transitions. [2020-01-16 19:10:18,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:18,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:18,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:18,153 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:10:18,153 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 19:10:18,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:18,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 19:10:18,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 374. [2020-01-16 19:10:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:10:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1273 transitions. [2020-01-16 19:10:18,161 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1273 transitions. Word has length 22 [2020-01-16 19:10:18,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:18,161 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1273 transitions. [2020-01-16 19:10:18,162 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1273 transitions. [2020-01-16 19:10:18,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:18,162 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:18,162 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:18,162 INFO L426 AbstractCegarLoop]: === Iteration 1716 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:18,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:18,162 INFO L82 PathProgramCache]: Analyzing trace with hash 126403364, now seen corresponding path program 1710 times [2020-01-16 19:10:18,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:18,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029879408] [2020-01-16 19:10:18,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:18,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-01-16 19:10:18,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029879408] [2020-01-16 19:10:18,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:18,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:18,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855246931] [2020-01-16 19:10:18,422 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:18,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:18,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:18,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:18,422 INFO L87 Difference]: Start difference. First operand 374 states and 1273 transitions. Second operand 9 states. [2020-01-16 19:10:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:18,513 INFO L93 Difference]: Finished difference Result 573 states and 1677 transitions. [2020-01-16 19:10:18,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:18,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:18,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:18,514 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:10:18,515 INFO L226 Difference]: Without dead ends: 561 [2020-01-16 19:10:18,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-01-16 19:10:18,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 371. [2020-01-16 19:10:18,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:10:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1268 transitions. [2020-01-16 19:10:18,524 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1268 transitions. Word has length 22 [2020-01-16 19:10:18,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:18,524 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1268 transitions. [2020-01-16 19:10:18,524 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:18,524 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1268 transitions. [2020-01-16 19:10:18,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:18,524 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:18,524 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:18,524 INFO L426 AbstractCegarLoop]: === Iteration 1717 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:18,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:18,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1191364132, now seen corresponding path program 1711 times [2020-01-16 19:10:18,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:18,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964757837] [2020-01-16 19:10:18,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:18,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-01-16 19:10:18,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964757837] [2020-01-16 19:10:18,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:18,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:18,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129511427] [2020-01-16 19:10:18,786 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:18,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:18,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:18,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:18,786 INFO L87 Difference]: Start difference. First operand 371 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:10:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:18,865 INFO L93 Difference]: Finished difference Result 598 states and 1738 transitions. [2020-01-16 19:10:18,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:18,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:18,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:18,867 INFO L225 Difference]: With dead ends: 598 [2020-01-16 19:10:18,867 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 19:10:18,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 19:10:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 379. [2020-01-16 19:10:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:10:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1288 transitions. [2020-01-16 19:10:18,876 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1288 transitions. Word has length 22 [2020-01-16 19:10:18,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:18,876 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1288 transitions. [2020-01-16 19:10:18,876 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:18,876 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1288 transitions. [2020-01-16 19:10:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:18,877 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:18,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:18,877 INFO L426 AbstractCegarLoop]: === Iteration 1718 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:18,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:18,877 INFO L82 PathProgramCache]: Analyzing trace with hash 398901754, now seen corresponding path program 1712 times [2020-01-16 19:10:18,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:18,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215112212] [2020-01-16 19:10:18,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:19,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215112212] [2020-01-16 19:10:19,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:19,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:19,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728482325] [2020-01-16 19:10:19,128 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:19,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:19,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:19,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:19,128 INFO L87 Difference]: Start difference. First operand 379 states and 1288 transitions. Second operand 9 states. [2020-01-16 19:10:19,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:19,226 INFO L93 Difference]: Finished difference Result 593 states and 1725 transitions. [2020-01-16 19:10:19,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:19,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:19,228 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:10:19,228 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:10:19,228 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:19,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:10:19,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 375. [2020-01-16 19:10:19,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:10:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1278 transitions. [2020-01-16 19:10:19,237 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1278 transitions. Word has length 22 [2020-01-16 19:10:19,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:19,237 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1278 transitions. [2020-01-16 19:10:19,237 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:19,238 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1278 transitions. [2020-01-16 19:10:19,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:19,238 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:19,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, 1, 1, 1] [2020-01-16 19:10:19,238 INFO L426 AbstractCegarLoop]: === Iteration 1719 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:19,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:19,238 INFO L82 PathProgramCache]: Analyzing trace with hash 141198796, now seen corresponding path program 1713 times [2020-01-16 19:10:19,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:19,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761231486] [2020-01-16 19:10:19,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:19,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-01-16 19:10:19,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761231486] [2020-01-16 19:10:19,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:19,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:19,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110252119] [2020-01-16 19:10:19,498 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:19,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:19,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:19,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:19,498 INFO L87 Difference]: Start difference. First operand 375 states and 1278 transitions. Second operand 9 states. [2020-01-16 19:10:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:19,576 INFO L93 Difference]: Finished difference Result 594 states and 1730 transitions. [2020-01-16 19:10:19,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:19,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:19,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:19,578 INFO L225 Difference]: With dead ends: 594 [2020-01-16 19:10:19,578 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:10:19,578 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:19,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:10:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 381. [2020-01-16 19:10:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:10:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1288 transitions. [2020-01-16 19:10:19,587 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1288 transitions. Word has length 22 [2020-01-16 19:10:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:19,588 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1288 transitions. [2020-01-16 19:10:19,588 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:19,588 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1288 transitions. [2020-01-16 19:10:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:19,588 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:19,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, 1, 1, 1] [2020-01-16 19:10:19,588 INFO L426 AbstractCegarLoop]: === Iteration 1720 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:19,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:19,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1449901232, now seen corresponding path program 1714 times [2020-01-16 19:10:19,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:19,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881031467] [2020-01-16 19:10:19,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:19,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-01-16 19:10:19,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881031467] [2020-01-16 19:10:19,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:19,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:19,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614551008] [2020-01-16 19:10:19,843 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:19,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:19,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:19,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:19,843 INFO L87 Difference]: Start difference. First operand 381 states and 1288 transitions. Second operand 9 states. [2020-01-16 19:10:19,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:19,938 INFO L93 Difference]: Finished difference Result 582 states and 1711 transitions. [2020-01-16 19:10:19,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:19,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:19,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:19,940 INFO L225 Difference]: With dead ends: 582 [2020-01-16 19:10:19,940 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:10:19,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:19,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:10:19,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 375. [2020-01-16 19:10:19,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:10:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1274 transitions. [2020-01-16 19:10:19,949 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1274 transitions. Word has length 22 [2020-01-16 19:10:19,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:19,949 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1274 transitions. [2020-01-16 19:10:19,949 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:19,949 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1274 transitions. [2020-01-16 19:10:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:19,950 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:19,950 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:19,950 INFO L426 AbstractCegarLoop]: === Iteration 1721 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:19,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:19,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1074097618, now seen corresponding path program 1715 times [2020-01-16 19:10:19,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:19,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030924297] [2020-01-16 19:10:19,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:20,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-01-16 19:10:20,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030924297] [2020-01-16 19:10:20,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:20,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:20,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500496427] [2020-01-16 19:10:20,197 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:20,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:20,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:20,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:20,198 INFO L87 Difference]: Start difference. First operand 375 states and 1274 transitions. Second operand 9 states. [2020-01-16 19:10:20,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:20,293 INFO L93 Difference]: Finished difference Result 586 states and 1709 transitions. [2020-01-16 19:10:20,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:20,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:20,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:20,295 INFO L225 Difference]: With dead ends: 586 [2020-01-16 19:10:20,295 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:10:20,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:20,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:10:20,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 378. [2020-01-16 19:10:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:10:20,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1279 transitions. [2020-01-16 19:10:20,304 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1279 transitions. Word has length 22 [2020-01-16 19:10:20,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:20,305 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1279 transitions. [2020-01-16 19:10:20,305 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1279 transitions. [2020-01-16 19:10:20,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:20,305 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:20,305 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:20,305 INFO L426 AbstractCegarLoop]: === Iteration 1722 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:20,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:20,306 INFO L82 PathProgramCache]: Analyzing trace with hash 654949716, now seen corresponding path program 1716 times [2020-01-16 19:10:20,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:20,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111448290] [2020-01-16 19:10:20,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:20,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-01-16 19:10:20,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111448290] [2020-01-16 19:10:20,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:20,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:20,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756124569] [2020-01-16 19:10:20,555 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:20,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:20,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:20,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:20,555 INFO L87 Difference]: Start difference. First operand 378 states and 1279 transitions. Second operand 9 states. [2020-01-16 19:10:20,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:20,654 INFO L93 Difference]: Finished difference Result 579 states and 1702 transitions. [2020-01-16 19:10:20,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:20,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:20,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:20,656 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:10:20,656 INFO L226 Difference]: Without dead ends: 559 [2020-01-16 19:10:20,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:20,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-01-16 19:10:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 371. [2020-01-16 19:10:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:10:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1266 transitions. [2020-01-16 19:10:20,665 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1266 transitions. Word has length 22 [2020-01-16 19:10:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:20,665 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1266 transitions. [2020-01-16 19:10:20,665 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1266 transitions. [2020-01-16 19:10:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:20,666 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:20,666 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:20,666 INFO L426 AbstractCegarLoop]: === Iteration 1723 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:20,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:20,666 INFO L82 PathProgramCache]: Analyzing trace with hash -475151788, now seen corresponding path program 1717 times [2020-01-16 19:10:20,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:20,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040304486] [2020-01-16 19:10:20,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:20,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-01-16 19:10:20,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040304486] [2020-01-16 19:10:20,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:20,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:20,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004214516] [2020-01-16 19:10:20,911 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:20,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:20,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:20,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:20,911 INFO L87 Difference]: Start difference. First operand 371 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:10:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:20,987 INFO L93 Difference]: Finished difference Result 588 states and 1708 transitions. [2020-01-16 19:10:20,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:20,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:20,989 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:10:20,989 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:10:20,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:20,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:10:20,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 375. [2020-01-16 19:10:20,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:10:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1274 transitions. [2020-01-16 19:10:20,998 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1274 transitions. Word has length 22 [2020-01-16 19:10:20,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:20,998 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1274 transitions. [2020-01-16 19:10:20,999 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1274 transitions. [2020-01-16 19:10:20,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:20,999 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:20,999 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:20,999 INFO L426 AbstractCegarLoop]: === Iteration 1724 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:20,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:20,999 INFO L82 PathProgramCache]: Analyzing trace with hash 85916704, now seen corresponding path program 1718 times [2020-01-16 19:10:21,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:21,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973174570] [2020-01-16 19:10:21,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:21,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-01-16 19:10:21,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973174570] [2020-01-16 19:10:21,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:21,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:21,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060847494] [2020-01-16 19:10:21,247 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:21,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:21,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:21,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:21,247 INFO L87 Difference]: Start difference. First operand 375 states and 1274 transitions. Second operand 9 states. [2020-01-16 19:10:21,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:21,321 INFO L93 Difference]: Finished difference Result 581 states and 1693 transitions. [2020-01-16 19:10:21,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:21,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:21,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:21,322 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:10:21,322 INFO L226 Difference]: Without dead ends: 570 [2020-01-16 19:10:21,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-01-16 19:10:21,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 373. [2020-01-16 19:10:21,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-01-16 19:10:21,331 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-01-16 19:10:21,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:21,331 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-01-16 19:10:21,331 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:21,331 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-01-16 19:10:21,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:21,332 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:21,332 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:21,332 INFO L426 AbstractCegarLoop]: === Iteration 1725 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:21,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:21,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1631632332, now seen corresponding path program 1719 times [2020-01-16 19:10:21,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:21,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196722358] [2020-01-16 19:10:21,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:21,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-01-16 19:10:21,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196722358] [2020-01-16 19:10:21,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:21,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:21,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458002429] [2020-01-16 19:10:21,593 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:21,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:21,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:21,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:21,593 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:10:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:21,679 INFO L93 Difference]: Finished difference Result 588 states and 1712 transitions. [2020-01-16 19:10:21,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:21,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:21,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:21,681 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:10:21,681 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:10:21,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:10:21,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 379. [2020-01-16 19:10:21,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:10:21,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1280 transitions. [2020-01-16 19:10:21,690 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1280 transitions. Word has length 22 [2020-01-16 19:10:21,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:21,690 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1280 transitions. [2020-01-16 19:10:21,690 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:21,690 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1280 transitions. [2020-01-16 19:10:21,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:21,691 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:21,691 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:21,691 INFO L426 AbstractCegarLoop]: === Iteration 1726 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:21,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:21,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1824453024, now seen corresponding path program 1720 times [2020-01-16 19:10:21,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:21,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694567024] [2020-01-16 19:10:21,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:21,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-01-16 19:10:21,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694567024] [2020-01-16 19:10:21,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:21,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:21,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425320545] [2020-01-16 19:10:21,941 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:21,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:21,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:21,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:21,941 INFO L87 Difference]: Start difference. First operand 379 states and 1280 transitions. Second operand 9 states. [2020-01-16 19:10:22,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:22,041 INFO L93 Difference]: Finished difference Result 576 states and 1693 transitions. [2020-01-16 19:10:22,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:22,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:22,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:22,043 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:10:22,043 INFO L226 Difference]: Without dead ends: 557 [2020-01-16 19:10:22,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:22,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-01-16 19:10:22,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 373. [2020-01-16 19:10:22,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-01-16 19:10:22,051 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-01-16 19:10:22,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:22,051 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-01-16 19:10:22,051 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-01-16 19:10:22,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:22,052 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10: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, 1, 1, 1] [2020-01-16 19:10:22,052 INFO L426 AbstractCegarLoop]: === Iteration 1727 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:22,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:22,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1686354558, now seen corresponding path program 1721 times [2020-01-16 19:10:22,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:22,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656234099] [2020-01-16 19:10:22,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:22,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-01-16 19:10:22,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656234099] [2020-01-16 19:10:22,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:22,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:22,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488438254] [2020-01-16 19:10:22,308 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:22,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:22,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:22,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:22,308 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:10:22,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:22,384 INFO L93 Difference]: Finished difference Result 576 states and 1683 transitions. [2020-01-16 19:10:22,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:22,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:22,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:22,386 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:10:22,386 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 19:10:22,386 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:22,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 19:10:22,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 374. [2020-01-16 19:10:22,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:10:22,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1269 transitions. [2020-01-16 19:10:22,395 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1269 transitions. Word has length 22 [2020-01-16 19:10:22,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:22,395 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1269 transitions. [2020-01-16 19:10:22,396 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:22,396 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1269 transitions. [2020-01-16 19:10:22,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:22,396 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:22,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, 1, 1, 1] [2020-01-16 19:10:22,396 INFO L426 AbstractCegarLoop]: === Iteration 1728 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:22,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:22,396 INFO L82 PathProgramCache]: Analyzing trace with hash -462441978, now seen corresponding path program 1722 times [2020-01-16 19:10:22,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:22,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12819572] [2020-01-16 19:10:22,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:22,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-01-16 19:10:22,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12819572] [2020-01-16 19:10:22,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:22,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:22,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504578594] [2020-01-16 19:10:22,646 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:22,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:22,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:22,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:22,646 INFO L87 Difference]: Start difference. First operand 374 states and 1269 transitions. Second operand 9 states. [2020-01-16 19:10:22,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:22,747 INFO L93 Difference]: Finished difference Result 571 states and 1682 transitions. [2020-01-16 19:10:22,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:22,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:22,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:22,748 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:10:22,748 INFO L226 Difference]: Without dead ends: 555 [2020-01-16 19:10:22,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-01-16 19:10:22,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 371. [2020-01-16 19:10:22,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:10:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1264 transitions. [2020-01-16 19:10:22,757 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1264 transitions. Word has length 22 [2020-01-16 19:10:22,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:22,757 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1264 transitions. [2020-01-16 19:10:22,757 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:22,757 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1264 transitions. [2020-01-16 19:10:22,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:22,758 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:22,758 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:22,758 INFO L426 AbstractCegarLoop]: === Iteration 1729 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:22,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:22,758 INFO L82 PathProgramCache]: Analyzing trace with hash -2112341134, now seen corresponding path program 1723 times [2020-01-16 19:10:22,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:22,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341470917] [2020-01-16 19:10:22,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:23,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341470917] [2020-01-16 19:10:23,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:23,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:23,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9849428] [2020-01-16 19:10:23,010 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:23,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:23,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:23,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:23,011 INFO L87 Difference]: Start difference. First operand 371 states and 1264 transitions. Second operand 9 states. [2020-01-16 19:10:23,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:23,104 INFO L93 Difference]: Finished difference Result 568 states and 1666 transitions. [2020-01-16 19:10:23,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:23,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:23,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:23,106 INFO L225 Difference]: With dead ends: 568 [2020-01-16 19:10:23,106 INFO L226 Difference]: Without dead ends: 557 [2020-01-16 19:10:23,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:23,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-01-16 19:10:23,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 373. [2020-01-16 19:10:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:23,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-01-16 19:10:23,115 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-01-16 19:10:23,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:23,115 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-01-16 19:10:23,115 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-01-16 19:10:23,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:23,116 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:23,116 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:23,116 INFO L426 AbstractCegarLoop]: === Iteration 1730 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:23,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:23,116 INFO L82 PathProgramCache]: Analyzing trace with hash 737109152, now seen corresponding path program 1724 times [2020-01-16 19:10:23,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:23,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833331887] [2020-01-16 19:10:23,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:23,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833331887] [2020-01-16 19:10:23,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:23,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:23,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035895757] [2020-01-16 19:10:23,376 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:23,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:23,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:23,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:23,376 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:10:23,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:23,454 INFO L93 Difference]: Finished difference Result 566 states and 1661 transitions. [2020-01-16 19:10:23,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:23,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:23,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:23,456 INFO L225 Difference]: With dead ends: 566 [2020-01-16 19:10:23,456 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:10:23,456 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:23,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:10:23,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 372. [2020-01-16 19:10:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:10:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1266 transitions. [2020-01-16 19:10:23,464 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1266 transitions. Word has length 22 [2020-01-16 19:10:23,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:23,465 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1266 transitions. [2020-01-16 19:10:23,465 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:23,465 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1266 transitions. [2020-01-16 19:10:23,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:23,465 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:23,465 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:23,465 INFO L426 AbstractCegarLoop]: === Iteration 1731 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:23,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:23,465 INFO L82 PathProgramCache]: Analyzing trace with hash -5557014, now seen corresponding path program 1725 times [2020-01-16 19:10:23,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:23,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191283878] [2020-01-16 19:10:23,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:23,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-01-16 19:10:23,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191283878] [2020-01-16 19:10:23,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:23,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:23,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209136541] [2020-01-16 19:10:23,714 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:23,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:23,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:23,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:23,714 INFO L87 Difference]: Start difference. First operand 372 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:10:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:23,825 INFO L93 Difference]: Finished difference Result 571 states and 1674 transitions. [2020-01-16 19:10:23,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:23,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:23,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:23,827 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:10:23,827 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:10:23,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:23,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:10:23,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 375. [2020-01-16 19:10:23,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:10:23,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1271 transitions. [2020-01-16 19:10:23,836 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1271 transitions. Word has length 22 [2020-01-16 19:10:23,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:23,836 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1271 transitions. [2020-01-16 19:10:23,836 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:23,837 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1271 transitions. [2020-01-16 19:10:23,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:23,837 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:23,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, 1, 1, 1] [2020-01-16 19:10:23,837 INFO L426 AbstractCegarLoop]: === Iteration 1732 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:23,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:23,837 INFO L82 PathProgramCache]: Analyzing trace with hash -787556256, now seen corresponding path program 1726 times [2020-01-16 19:10:23,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:23,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318692490] [2020-01-16 19:10:23,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:24,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-01-16 19:10:24,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318692490] [2020-01-16 19:10:24,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:24,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:24,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616257002] [2020-01-16 19:10:24,081 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:24,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:24,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:24,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:24,081 INFO L87 Difference]: Start difference. First operand 375 states and 1271 transitions. Second operand 9 states. [2020-01-16 19:10:24,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:24,192 INFO L93 Difference]: Finished difference Result 564 states and 1667 transitions. [2020-01-16 19:10:24,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:24,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:24,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:24,194 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:10:24,194 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:10:24,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:24,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:10:24,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 372. [2020-01-16 19:10:24,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:10:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1265 transitions. [2020-01-16 19:10:24,202 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1265 transitions. Word has length 22 [2020-01-16 19:10:24,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:24,202 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1265 transitions. [2020-01-16 19:10:24,202 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:24,202 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1265 transitions. [2020-01-16 19:10:24,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:24,203 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:24,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, 1, 1, 1] [2020-01-16 19:10:24,203 INFO L426 AbstractCegarLoop]: === Iteration 1733 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:24,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:24,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1243455418, now seen corresponding path program 1727 times [2020-01-16 19:10:24,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:24,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660989167] [2020-01-16 19:10:24,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:24,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:24,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660989167] [2020-01-16 19:10:24,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:24,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:24,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147610658] [2020-01-16 19:10:24,461 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:24,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:24,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:24,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:24,462 INFO L87 Difference]: Start difference. First operand 372 states and 1265 transitions. Second operand 9 states. [2020-01-16 19:10:24,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:24,532 INFO L93 Difference]: Finished difference Result 567 states and 1663 transitions. [2020-01-16 19:10:24,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:24,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:24,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:24,534 INFO L225 Difference]: With dead ends: 567 [2020-01-16 19:10:24,534 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:10:24,534 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:24,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:10:24,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 373. [2020-01-16 19:10:24,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:24,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-01-16 19:10:24,543 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-01-16 19:10:24,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:24,543 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-01-16 19:10:24,543 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-01-16 19:10:24,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:24,544 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:24,544 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:24,544 INFO L426 AbstractCegarLoop]: === Iteration 1734 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:24,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:24,544 INFO L82 PathProgramCache]: Analyzing trace with hash -905341118, now seen corresponding path program 1728 times [2020-01-16 19:10:24,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:24,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781167950] [2020-01-16 19:10:24,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:24,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:24,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781167950] [2020-01-16 19:10:24,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:24,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:24,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623065962] [2020-01-16 19:10:24,805 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:24,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:24,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:24,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:24,805 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:10:24,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:24,905 INFO L93 Difference]: Finished difference Result 562 states and 1662 transitions. [2020-01-16 19:10:24,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:24,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:24,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:24,907 INFO L225 Difference]: With dead ends: 562 [2020-01-16 19:10:24,907 INFO L226 Difference]: Without dead ends: 545 [2020-01-16 19:10:24,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-01-16 19:10:24,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 369. [2020-01-16 19:10:24,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-01-16 19:10:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1260 transitions. [2020-01-16 19:10:24,916 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1260 transitions. Word has length 22 [2020-01-16 19:10:24,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:24,917 INFO L478 AbstractCegarLoop]: Abstraction has 369 states and 1260 transitions. [2020-01-16 19:10:24,917 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:24,917 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1260 transitions. [2020-01-16 19:10:24,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:24,917 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:24,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, 1, 1, 1] [2020-01-16 19:10:24,917 INFO L426 AbstractCegarLoop]: === Iteration 1735 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:24,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:24,918 INFO L82 PathProgramCache]: Analyzing trace with hash 291899684, now seen corresponding path program 1729 times [2020-01-16 19:10:24,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:24,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53285582] [2020-01-16 19:10:24,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:25,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:25,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53285582] [2020-01-16 19:10:25,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:25,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:25,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033124843] [2020-01-16 19:10:25,193 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:25,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:25,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:25,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:25,193 INFO L87 Difference]: Start difference. First operand 369 states and 1260 transitions. Second operand 9 states. [2020-01-16 19:10:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:25,276 INFO L93 Difference]: Finished difference Result 614 states and 1793 transitions. [2020-01-16 19:10:25,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:25,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:25,277 INFO L225 Difference]: With dead ends: 614 [2020-01-16 19:10:25,277 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:10:25,278 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:25,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:10:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 381. [2020-01-16 19:10:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:10:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1298 transitions. [2020-01-16 19:10:25,286 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1298 transitions. Word has length 22 [2020-01-16 19:10:25,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:25,286 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1298 transitions. [2020-01-16 19:10:25,286 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:25,286 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1298 transitions. [2020-01-16 19:10:25,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:25,287 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:25,287 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:25,287 INFO L426 AbstractCegarLoop]: === Iteration 1736 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1882165570, now seen corresponding path program 1730 times [2020-01-16 19:10:25,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:25,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107709528] [2020-01-16 19:10:25,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:25,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107709528] [2020-01-16 19:10:25,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:25,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:25,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67503118] [2020-01-16 19:10:25,558 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:25,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:25,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:25,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:25,558 INFO L87 Difference]: Start difference. First operand 381 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:10:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:25,663 INFO L93 Difference]: Finished difference Result 609 states and 1780 transitions. [2020-01-16 19:10:25,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:25,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:25,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:25,665 INFO L225 Difference]: With dead ends: 609 [2020-01-16 19:10:25,665 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:10:25,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:25,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:10:25,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 377. [2020-01-16 19:10:25,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:10:25,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1288 transitions. [2020-01-16 19:10:25,674 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1288 transitions. Word has length 22 [2020-01-16 19:10:25,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:25,674 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1288 transitions. [2020-01-16 19:10:25,674 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:25,674 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1288 transitions. [2020-01-16 19:10:25,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:25,675 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:25,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, 1, 1, 1] [2020-01-16 19:10:25,675 INFO L426 AbstractCegarLoop]: === Iteration 1737 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:25,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:25,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1056777068, now seen corresponding path program 1731 times [2020-01-16 19:10:25,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:25,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444800708] [2020-01-16 19:10:25,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:25,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-01-16 19:10:25,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444800708] [2020-01-16 19:10:25,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:25,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:25,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513117394] [2020-01-16 19:10:25,959 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:25,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:25,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:25,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:25,960 INFO L87 Difference]: Start difference. First operand 377 states and 1288 transitions. Second operand 9 states. [2020-01-16 19:10:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:26,037 INFO L93 Difference]: Finished difference Result 616 states and 1794 transitions. [2020-01-16 19:10:26,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:26,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:26,038 INFO L225 Difference]: With dead ends: 616 [2020-01-16 19:10:26,038 INFO L226 Difference]: Without dead ends: 600 [2020-01-16 19:10:26,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:26,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-01-16 19:10:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 382. [2020-01-16 19:10:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:10:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1296 transitions. [2020-01-16 19:10:26,047 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1296 transitions. Word has length 22 [2020-01-16 19:10:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:26,047 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1296 transitions. [2020-01-16 19:10:26,047 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1296 transitions. [2020-01-16 19:10:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:26,048 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:26,048 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:26,048 INFO L426 AbstractCegarLoop]: === Iteration 1738 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:26,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:26,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1536862326, now seen corresponding path program 1732 times [2020-01-16 19:10:26,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:26,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339632680] [2020-01-16 19:10:26,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:26,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339632680] [2020-01-16 19:10:26,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:26,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:26,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855388152] [2020-01-16 19:10:26,328 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:26,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:26,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:26,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:26,328 INFO L87 Difference]: Start difference. First operand 382 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:10:26,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:26,434 INFO L93 Difference]: Finished difference Result 612 states and 1782 transitions. [2020-01-16 19:10:26,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:26,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:26,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:26,436 INFO L225 Difference]: With dead ends: 612 [2020-01-16 19:10:26,436 INFO L226 Difference]: Without dead ends: 595 [2020-01-16 19:10:26,436 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-01-16 19:10:26,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 377. [2020-01-16 19:10:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:10:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1284 transitions. [2020-01-16 19:10:26,445 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1284 transitions. Word has length 22 [2020-01-16 19:10:26,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:26,445 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1284 transitions. [2020-01-16 19:10:26,445 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:26,445 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1284 transitions. [2020-01-16 19:10:26,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:26,445 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:26,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, 1, 1, 1] [2020-01-16 19:10:26,445 INFO L426 AbstractCegarLoop]: === Iteration 1739 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:26,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:26,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2022893814, now seen corresponding path program 1733 times [2020-01-16 19:10:26,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:26,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713243161] [2020-01-16 19:10:26,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:26,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-01-16 19:10:26,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713243161] [2020-01-16 19:10:26,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:26,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:26,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359298563] [2020-01-16 19:10:26,717 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:26,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:26,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:26,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:26,718 INFO L87 Difference]: Start difference. First operand 377 states and 1284 transitions. Second operand 9 states. [2020-01-16 19:10:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:26,817 INFO L93 Difference]: Finished difference Result 604 states and 1767 transitions. [2020-01-16 19:10:26,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:26,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:26,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:26,819 INFO L225 Difference]: With dead ends: 604 [2020-01-16 19:10:26,819 INFO L226 Difference]: Without dead ends: 593 [2020-01-16 19:10:26,819 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:26,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-01-16 19:10:26,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 380. [2020-01-16 19:10:26,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:10:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1289 transitions. [2020-01-16 19:10:26,829 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1289 transitions. Word has length 22 [2020-01-16 19:10:26,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:26,829 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1289 transitions. [2020-01-16 19:10:26,829 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:26,829 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1289 transitions. [2020-01-16 19:10:26,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:26,829 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:26,830 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:26,830 INFO L426 AbstractCegarLoop]: === Iteration 1740 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:26,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:26,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1398332802, now seen corresponding path program 1734 times [2020-01-16 19:10:26,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:26,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737108360] [2020-01-16 19:10:26,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:27,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-01-16 19:10:27,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737108360] [2020-01-16 19:10:27,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:27,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:27,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291048665] [2020-01-16 19:10:27,105 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:27,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:27,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:27,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:27,105 INFO L87 Difference]: Start difference. First operand 380 states and 1289 transitions. Second operand 9 states. [2020-01-16 19:10:27,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:27,211 INFO L93 Difference]: Finished difference Result 605 states and 1766 transitions. [2020-01-16 19:10:27,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:27,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:27,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:27,213 INFO L225 Difference]: With dead ends: 605 [2020-01-16 19:10:27,213 INFO L226 Difference]: Without dead ends: 586 [2020-01-16 19:10:27,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:27,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-01-16 19:10:27,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 373. [2020-01-16 19:10:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:27,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1274 transitions. [2020-01-16 19:10:27,221 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1274 transitions. Word has length 22 [2020-01-16 19:10:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:27,222 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1274 transitions. [2020-01-16 19:10:27,222 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1274 transitions. [2020-01-16 19:10:27,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:27,222 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:27,222 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:27,222 INFO L426 AbstractCegarLoop]: === Iteration 1741 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:27,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:27,223 INFO L82 PathProgramCache]: Analyzing trace with hash -130586042, now seen corresponding path program 1735 times [2020-01-16 19:10:27,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:27,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362250696] [2020-01-16 19:10:27,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:27,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-01-16 19:10:27,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362250696] [2020-01-16 19:10:27,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:27,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:27,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545713945] [2020-01-16 19:10:27,490 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:27,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:27,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:27,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:27,490 INFO L87 Difference]: Start difference. First operand 373 states and 1274 transitions. Second operand 9 states. [2020-01-16 19:10:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:27,575 INFO L93 Difference]: Finished difference Result 608 states and 1770 transitions. [2020-01-16 19:10:27,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:27,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:27,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:27,577 INFO L225 Difference]: With dead ends: 608 [2020-01-16 19:10:27,577 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 19:10:27,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:27,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 19:10:27,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 381. [2020-01-16 19:10:27,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:10:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1294 transitions. [2020-01-16 19:10:27,587 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1294 transitions. Word has length 22 [2020-01-16 19:10:27,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:27,587 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1294 transitions. [2020-01-16 19:10:27,587 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:27,587 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1294 transitions. [2020-01-16 19:10:27,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:27,587 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:27,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, 1, 1, 1] [2020-01-16 19:10:27,588 INFO L426 AbstractCegarLoop]: === Iteration 1742 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:27,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:27,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1459679844, now seen corresponding path program 1736 times [2020-01-16 19:10:27,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:27,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012830742] [2020-01-16 19:10:27,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:27,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012830742] [2020-01-16 19:10:27,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:27,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:27,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979257239] [2020-01-16 19:10:27,853 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:27,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:27,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:27,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:27,853 INFO L87 Difference]: Start difference. First operand 381 states and 1294 transitions. Second operand 9 states. [2020-01-16 19:10:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:27,964 INFO L93 Difference]: Finished difference Result 603 states and 1757 transitions. [2020-01-16 19:10:27,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:27,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:27,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:27,966 INFO L225 Difference]: With dead ends: 603 [2020-01-16 19:10:27,966 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 19:10:27,966 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:27,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 19:10:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 377. [2020-01-16 19:10:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:10:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1284 transitions. [2020-01-16 19:10:27,975 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1284 transitions. Word has length 22 [2020-01-16 19:10:27,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:27,975 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1284 transitions. [2020-01-16 19:10:27,975 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:27,975 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1284 transitions. [2020-01-16 19:10:27,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:27,976 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:27,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, 1, 1, 1] [2020-01-16 19:10:27,976 INFO L426 AbstractCegarLoop]: === Iteration 1743 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:27,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:27,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1201976886, now seen corresponding path program 1737 times [2020-01-16 19:10:27,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:27,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78682330] [2020-01-16 19:10:27,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:28,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-01-16 19:10:28,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78682330] [2020-01-16 19:10:28,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:28,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:28,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645954993] [2020-01-16 19:10:28,251 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:28,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:28,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:28,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:28,251 INFO L87 Difference]: Start difference. First operand 377 states and 1284 transitions. Second operand 9 states. [2020-01-16 19:10:28,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:28,333 INFO L93 Difference]: Finished difference Result 604 states and 1762 transitions. [2020-01-16 19:10:28,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:28,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:28,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:28,335 INFO L225 Difference]: With dead ends: 604 [2020-01-16 19:10:28,335 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 19:10:28,335 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:28,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 19:10:28,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 383. [2020-01-16 19:10:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:10:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1294 transitions. [2020-01-16 19:10:28,344 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1294 transitions. Word has length 22 [2020-01-16 19:10:28,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:28,344 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1294 transitions. [2020-01-16 19:10:28,345 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1294 transitions. [2020-01-16 19:10:28,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:28,345 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:28,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, 1, 1, 1] [2020-01-16 19:10:28,345 INFO L426 AbstractCegarLoop]: === Iteration 1744 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:28,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:28,345 INFO L82 PathProgramCache]: Analyzing trace with hash -389123142, now seen corresponding path program 1738 times [2020-01-16 19:10:28,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:28,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381606400] [2020-01-16 19:10:28,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:28,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-01-16 19:10:28,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381606400] [2020-01-16 19:10:28,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:28,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:28,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98641901] [2020-01-16 19:10:28,610 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:28,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:28,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:28,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:28,610 INFO L87 Difference]: Start difference. First operand 383 states and 1294 transitions. Second operand 9 states. [2020-01-16 19:10:28,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:28,713 INFO L93 Difference]: Finished difference Result 592 states and 1743 transitions. [2020-01-16 19:10:28,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:28,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:28,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:28,714 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:10:28,715 INFO L226 Difference]: Without dead ends: 573 [2020-01-16 19:10:28,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:28,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-01-16 19:10:28,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 377. [2020-01-16 19:10:28,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:10:28,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1280 transitions. [2020-01-16 19:10:28,723 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1280 transitions. Word has length 22 [2020-01-16 19:10:28,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:28,723 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1280 transitions. [2020-01-16 19:10:28,723 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:28,723 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1280 transitions. [2020-01-16 19:10:28,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:28,724 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:28,724 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:28,724 INFO L426 AbstractCegarLoop]: === Iteration 1745 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:28,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:28,724 INFO L82 PathProgramCache]: Analyzing trace with hash -13319528, now seen corresponding path program 1739 times [2020-01-16 19:10:28,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:28,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346718594] [2020-01-16 19:10:28,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:28,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-01-16 19:10:28,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346718594] [2020-01-16 19:10:28,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:28,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:28,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688956529] [2020-01-16 19:10:28,985 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:28,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:28,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:28,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:28,985 INFO L87 Difference]: Start difference. First operand 377 states and 1280 transitions. Second operand 9 states. [2020-01-16 19:10:29,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:29,082 INFO L93 Difference]: Finished difference Result 596 states and 1741 transitions. [2020-01-16 19:10:29,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:29,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:29,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:29,084 INFO L225 Difference]: With dead ends: 596 [2020-01-16 19:10:29,084 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 19:10:29,084 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:29,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 19:10:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 380. [2020-01-16 19:10:29,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:10:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1285 transitions. [2020-01-16 19:10:29,093 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1285 transitions. Word has length 22 [2020-01-16 19:10:29,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:29,094 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1285 transitions. [2020-01-16 19:10:29,094 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:29,094 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1285 transitions. [2020-01-16 19:10:29,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:29,094 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:29,094 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:29,094 INFO L426 AbstractCegarLoop]: === Iteration 1746 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:29,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:29,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1715727806, now seen corresponding path program 1740 times [2020-01-16 19:10:29,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:29,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294531216] [2020-01-16 19:10:29,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:29,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-01-16 19:10:29,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294531216] [2020-01-16 19:10:29,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:29,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:29,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764724679] [2020-01-16 19:10:29,353 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:29,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:29,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:29,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:29,353 INFO L87 Difference]: Start difference. First operand 380 states and 1285 transitions. Second operand 9 states. [2020-01-16 19:10:29,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:29,452 INFO L93 Difference]: Finished difference Result 589 states and 1734 transitions. [2020-01-16 19:10:29,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:29,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:29,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:29,454 INFO L225 Difference]: With dead ends: 589 [2020-01-16 19:10:29,454 INFO L226 Difference]: Without dead ends: 569 [2020-01-16 19:10:29,454 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:29,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-01-16 19:10:29,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 373. [2020-01-16 19:10:29,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-01-16 19:10:29,463 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-01-16 19:10:29,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:29,463 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-01-16 19:10:29,464 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:29,464 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-01-16 19:10:29,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:29,464 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:29,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, 1, 1, 1] [2020-01-16 19:10:29,464 INFO L426 AbstractCegarLoop]: === Iteration 1747 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:29,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:29,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1597968036, now seen corresponding path program 1741 times [2020-01-16 19:10:29,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:29,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675548633] [2020-01-16 19:10:29,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:29,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-01-16 19:10:29,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675548633] [2020-01-16 19:10:29,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:29,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:29,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578397919] [2020-01-16 19:10:29,739 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:29,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:29,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:29,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:29,740 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:10:29,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:29,819 INFO L93 Difference]: Finished difference Result 605 states and 1766 transitions. [2020-01-16 19:10:29,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:29,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:29,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:29,820 INFO L225 Difference]: With dead ends: 605 [2020-01-16 19:10:29,820 INFO L226 Difference]: Without dead ends: 589 [2020-01-16 19:10:29,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-01-16 19:10:29,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 383. [2020-01-16 19:10:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:10:29,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1296 transitions. [2020-01-16 19:10:29,829 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1296 transitions. Word has length 22 [2020-01-16 19:10:29,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:29,829 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1296 transitions. [2020-01-16 19:10:29,829 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1296 transitions. [2020-01-16 19:10:29,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:29,830 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:29,830 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:29,830 INFO L426 AbstractCegarLoop]: === Iteration 1748 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:29,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:29,830 INFO L82 PathProgramCache]: Analyzing trace with hash -103359866, now seen corresponding path program 1742 times [2020-01-16 19:10:29,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:29,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851227719] [2020-01-16 19:10:29,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:30,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-01-16 19:10:30,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851227719] [2020-01-16 19:10:30,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:30,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:30,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950611630] [2020-01-16 19:10:30,106 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:30,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:30,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:30,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:30,107 INFO L87 Difference]: Start difference. First operand 383 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:10:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:30,222 INFO L93 Difference]: Finished difference Result 601 states and 1754 transitions. [2020-01-16 19:10:30,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:30,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:30,224 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:10:30,224 INFO L226 Difference]: Without dead ends: 584 [2020-01-16 19:10:30,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:30,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-01-16 19:10:30,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 378. [2020-01-16 19:10:30,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:10:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1283 transitions. [2020-01-16 19:10:30,234 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1283 transitions. Word has length 22 [2020-01-16 19:10:30,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:30,234 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1283 transitions. [2020-01-16 19:10:30,234 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:30,234 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1283 transitions. [2020-01-16 19:10:30,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:30,234 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:30,234 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:30,235 INFO L426 AbstractCegarLoop]: === Iteration 1749 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:30,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:30,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1952296762, now seen corresponding path program 1743 times [2020-01-16 19:10:30,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:30,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007035160] [2020-01-16 19:10:30,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:30,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:30,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007035160] [2020-01-16 19:10:30,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:30,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:30,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308426782] [2020-01-16 19:10:30,509 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:30,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:30,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:30,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:30,509 INFO L87 Difference]: Start difference. First operand 378 states and 1283 transitions. Second operand 9 states. [2020-01-16 19:10:30,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:30,602 INFO L93 Difference]: Finished difference Result 593 states and 1736 transitions. [2020-01-16 19:10:30,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:30,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:30,604 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:10:30,604 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:10:30,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:30,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:10:30,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 384. [2020-01-16 19:10:30,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:10:30,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1293 transitions. [2020-01-16 19:10:30,613 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1293 transitions. Word has length 22 [2020-01-16 19:10:30,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:30,613 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1293 transitions. [2020-01-16 19:10:30,614 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:30,614 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1293 transitions. [2020-01-16 19:10:30,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:30,614 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:30,614 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:30,614 INFO L426 AbstractCegarLoop]: === Iteration 1750 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:30,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:30,614 INFO L82 PathProgramCache]: Analyzing trace with hash 751570506, now seen corresponding path program 1744 times [2020-01-16 19:10:30,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:30,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569161198] [2020-01-16 19:10:30,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:30,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-01-16 19:10:30,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569161198] [2020-01-16 19:10:30,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:30,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:30,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667017546] [2020-01-16 19:10:30,885 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:30,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:30,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:30,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:30,885 INFO L87 Difference]: Start difference. First operand 384 states and 1293 transitions. Second operand 9 states. [2020-01-16 19:10:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:31,003 INFO L93 Difference]: Finished difference Result 581 states and 1717 transitions. [2020-01-16 19:10:31,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:31,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:31,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:31,005 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:10:31,005 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:10:31,005 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:31,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:10:31,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 378. [2020-01-16 19:10:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:10:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1278 transitions. [2020-01-16 19:10:31,013 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1278 transitions. Word has length 22 [2020-01-16 19:10:31,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:31,014 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1278 transitions. [2020-01-16 19:10:31,014 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1278 transitions. [2020-01-16 19:10:31,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:31,014 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:31,014 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:31,014 INFO L426 AbstractCegarLoop]: === Iteration 1751 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:31,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:31,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1253450174, now seen corresponding path program 1745 times [2020-01-16 19:10:31,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:31,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966884001] [2020-01-16 19:10:31,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:31,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-01-16 19:10:31,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966884001] [2020-01-16 19:10:31,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:31,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:31,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899457180] [2020-01-16 19:10:31,299 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:31,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:31,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:31,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:31,299 INFO L87 Difference]: Start difference. First operand 378 states and 1278 transitions. Second operand 9 states. [2020-01-16 19:10:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:31,411 INFO L93 Difference]: Finished difference Result 578 states and 1711 transitions. [2020-01-16 19:10:31,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:31,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:31,413 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:10:31,413 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:10:31,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:31,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:10:31,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 382. [2020-01-16 19:10:31,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:10:31,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1285 transitions. [2020-01-16 19:10:31,421 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1285 transitions. Word has length 22 [2020-01-16 19:10:31,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:31,421 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1285 transitions. [2020-01-16 19:10:31,421 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1285 transitions. [2020-01-16 19:10:31,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:31,422 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:31,422 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:31,422 INFO L426 AbstractCegarLoop]: === Iteration 1752 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:31,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:31,422 INFO L82 PathProgramCache]: Analyzing trace with hash -394575644, now seen corresponding path program 1746 times [2020-01-16 19:10:31,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:31,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432890809] [2020-01-16 19:10:31,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:31,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432890809] [2020-01-16 19:10:31,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:31,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:31,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131431270] [2020-01-16 19:10:31,693 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:31,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:31,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:31,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:31,693 INFO L87 Difference]: Start difference. First operand 382 states and 1285 transitions. Second operand 9 states. [2020-01-16 19:10:31,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:31,798 INFO L93 Difference]: Finished difference Result 565 states and 1692 transitions. [2020-01-16 19:10:31,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:31,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:31,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:31,800 INFO L225 Difference]: With dead ends: 565 [2020-01-16 19:10:31,800 INFO L226 Difference]: Without dead ends: 543 [2020-01-16 19:10:31,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:31,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-01-16 19:10:31,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 373. [2020-01-16 19:10:31,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-01-16 19:10:31,809 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-01-16 19:10:31,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:31,810 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-01-16 19:10:31,810 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-01-16 19:10:31,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:31,810 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:31,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, 1, 1, 1] [2020-01-16 19:10:31,810 INFO L426 AbstractCegarLoop]: === Iteration 1753 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:31,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:31,811 INFO L82 PathProgramCache]: Analyzing trace with hash -690413758, now seen corresponding path program 1747 times [2020-01-16 19:10:31,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:31,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885193841] [2020-01-16 19:10:31,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:32,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-01-16 19:10:32,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885193841] [2020-01-16 19:10:32,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:32,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:32,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185864670] [2020-01-16 19:10:32,079 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:32,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:32,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:32,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:32,080 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:10:32,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:32,182 INFO L93 Difference]: Finished difference Result 588 states and 1724 transitions. [2020-01-16 19:10:32,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:32,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:32,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:32,184 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:10:32,184 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:10:32,184 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:10:32,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 379. [2020-01-16 19:10:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:10:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1282 transitions. [2020-01-16 19:10:32,193 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1282 transitions. Word has length 22 [2020-01-16 19:10:32,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:32,194 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1282 transitions. [2020-01-16 19:10:32,194 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:32,194 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1282 transitions. [2020-01-16 19:10:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:32,194 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:32,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, 1, 1, 1] [2020-01-16 19:10:32,194 INFO L426 AbstractCegarLoop]: === Iteration 1754 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:32,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:32,195 INFO L82 PathProgramCache]: Analyzing trace with hash 183326922, now seen corresponding path program 1748 times [2020-01-16 19:10:32,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:32,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92828406] [2020-01-16 19:10:32,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:32,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:32,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92828406] [2020-01-16 19:10:32,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:32,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:32,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292115884] [2020-01-16 19:10:32,470 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:32,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:32,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:32,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:32,470 INFO L87 Difference]: Start difference. First operand 379 states and 1282 transitions. Second operand 9 states. [2020-01-16 19:10:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:32,586 INFO L93 Difference]: Finished difference Result 589 states and 1723 transitions. [2020-01-16 19:10:32,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:32,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:32,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:32,588 INFO L225 Difference]: With dead ends: 589 [2020-01-16 19:10:32,588 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:10:32,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:10:32,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 376. [2020-01-16 19:10:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:10:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1274 transitions. [2020-01-16 19:10:32,597 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1274 transitions. Word has length 22 [2020-01-16 19:10:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:32,597 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1274 transitions. [2020-01-16 19:10:32,597 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1274 transitions. [2020-01-16 19:10:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:32,598 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:32,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, 1, 1, 1] [2020-01-16 19:10:32,598 INFO L426 AbstractCegarLoop]: === Iteration 1755 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:32,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:32,598 INFO L82 PathProgramCache]: Analyzing trace with hash 54288740, now seen corresponding path program 1749 times [2020-01-16 19:10:32,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:32,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984035228] [2020-01-16 19:10:32,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:32,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:32,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984035228] [2020-01-16 19:10:32,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:32,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:32,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21401470] [2020-01-16 19:10:32,864 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:32,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:32,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:32,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:32,864 INFO L87 Difference]: Start difference. First operand 376 states and 1274 transitions. Second operand 9 states. [2020-01-16 19:10:32,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:32,977 INFO L93 Difference]: Finished difference Result 583 states and 1710 transitions. [2020-01-16 19:10:32,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:32,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:32,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:32,979 INFO L225 Difference]: With dead ends: 583 [2020-01-16 19:10:32,979 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:10:32,979 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:32,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:10:32,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 379. [2020-01-16 19:10:32,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:10:32,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1279 transitions. [2020-01-16 19:10:32,988 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1279 transitions. Word has length 22 [2020-01-16 19:10:32,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:32,988 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1279 transitions. [2020-01-16 19:10:32,989 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:32,989 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1279 transitions. [2020-01-16 19:10:32,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:32,989 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:32,989 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:32,989 INFO L426 AbstractCegarLoop]: === Iteration 1756 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:32,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:32,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1783336074, now seen corresponding path program 1750 times [2020-01-16 19:10:32,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:32,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650959508] [2020-01-16 19:10:32,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:33,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:33,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650959508] [2020-01-16 19:10:33,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:33,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:33,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887300340] [2020-01-16 19:10:33,259 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:33,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:33,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:33,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:33,259 INFO L87 Difference]: Start difference. First operand 379 states and 1279 transitions. Second operand 9 states. [2020-01-16 19:10:33,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:33,372 INFO L93 Difference]: Finished difference Result 576 states and 1703 transitions. [2020-01-16 19:10:33,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:33,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:33,374 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:10:33,374 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:10:33,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:33,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:10:33,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 376. [2020-01-16 19:10:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:10:33,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1271 transitions. [2020-01-16 19:10:33,383 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1271 transitions. Word has length 22 [2020-01-16 19:10:33,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:33,384 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1271 transitions. [2020-01-16 19:10:33,384 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:33,384 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1271 transitions. [2020-01-16 19:10:33,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:33,384 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:33,384 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:33,384 INFO L426 AbstractCegarLoop]: === Iteration 1757 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:33,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:33,385 INFO L82 PathProgramCache]: Analyzing trace with hash -2050780572, now seen corresponding path program 1751 times [2020-01-16 19:10:33,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:33,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955384298] [2020-01-16 19:10:33,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:33,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-01-16 19:10:33,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955384298] [2020-01-16 19:10:33,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:33,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:33,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254337112] [2020-01-16 19:10:33,659 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:33,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:33,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:33,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:33,660 INFO L87 Difference]: Start difference. First operand 376 states and 1271 transitions. Second operand 9 states. [2020-01-16 19:10:33,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:33,781 INFO L93 Difference]: Finished difference Result 576 states and 1704 transitions. [2020-01-16 19:10:33,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:33,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:33,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:33,783 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:10:33,783 INFO L226 Difference]: Without dead ends: 564 [2020-01-16 19:10:33,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:33,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-01-16 19:10:33,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 380. [2020-01-16 19:10:33,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:10:33,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1278 transitions. [2020-01-16 19:10:33,793 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1278 transitions. Word has length 22 [2020-01-16 19:10:33,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:33,793 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1278 transitions. [2020-01-16 19:10:33,793 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:33,793 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1278 transitions. [2020-01-16 19:10:33,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:33,793 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:33,793 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:33,794 INFO L426 AbstractCegarLoop]: === Iteration 1758 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:33,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:33,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1195473918, now seen corresponding path program 1752 times [2020-01-16 19:10:33,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:33,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32696459] [2020-01-16 19:10:33,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:34,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:34,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32696459] [2020-01-16 19:10:34,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:34,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:34,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903654329] [2020-01-16 19:10:34,064 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:34,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:34,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:34,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:34,065 INFO L87 Difference]: Start difference. First operand 380 states and 1278 transitions. Second operand 9 states. [2020-01-16 19:10:34,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:34,179 INFO L93 Difference]: Finished difference Result 563 states and 1685 transitions. [2020-01-16 19:10:34,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:34,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:34,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:34,181 INFO L225 Difference]: With dead ends: 563 [2020-01-16 19:10:34,181 INFO L226 Difference]: Without dead ends: 539 [2020-01-16 19:10:34,181 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:34,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-01-16 19:10:34,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 369. [2020-01-16 19:10:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-01-16 19:10:34,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1258 transitions. [2020-01-16 19:10:34,190 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1258 transitions. Word has length 22 [2020-01-16 19:10:34,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:34,190 INFO L478 AbstractCegarLoop]: Abstraction has 369 states and 1258 transitions. [2020-01-16 19:10:34,191 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:34,191 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1258 transitions. [2020-01-16 19:10:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:34,191 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:34,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, 1, 1, 1] [2020-01-16 19:10:34,191 INFO L426 AbstractCegarLoop]: === Iteration 1759 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:34,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:34,191 INFO L82 PathProgramCache]: Analyzing trace with hash 830437174, now seen corresponding path program 1753 times [2020-01-16 19:10:34,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:34,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050006140] [2020-01-16 19:10:34,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:34,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-01-16 19:10:34,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050006140] [2020-01-16 19:10:34,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:34,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:34,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172068331] [2020-01-16 19:10:34,460 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:34,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:34,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:34,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:34,461 INFO L87 Difference]: Start difference. First operand 369 states and 1258 transitions. Second operand 9 states. [2020-01-16 19:10:34,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:34,550 INFO L93 Difference]: Finished difference Result 590 states and 1715 transitions. [2020-01-16 19:10:34,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:34,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:34,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:34,551 INFO L225 Difference]: With dead ends: 590 [2020-01-16 19:10:34,552 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:10:34,552 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:34,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:10:34,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 375. [2020-01-16 19:10:34,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:10:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1274 transitions. [2020-01-16 19:10:34,560 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1274 transitions. Word has length 22 [2020-01-16 19:10:34,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:34,560 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1274 transitions. [2020-01-16 19:10:34,560 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:34,561 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1274 transitions. [2020-01-16 19:10:34,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:34,561 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:34,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, 1, 1, 1] [2020-01-16 19:10:34,561 INFO L426 AbstractCegarLoop]: === Iteration 1760 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:34,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:34,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1391505666, now seen corresponding path program 1754 times [2020-01-16 19:10:34,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:34,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594360222] [2020-01-16 19:10:34,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:34,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-01-16 19:10:34,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594360222] [2020-01-16 19:10:34,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:34,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:34,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148029252] [2020-01-16 19:10:34,822 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:34,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:34,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:34,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:34,822 INFO L87 Difference]: Start difference. First operand 375 states and 1274 transitions. Second operand 9 states. [2020-01-16 19:10:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:34,900 INFO L93 Difference]: Finished difference Result 583 states and 1700 transitions. [2020-01-16 19:10:34,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:34,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:34,901 INFO L225 Difference]: With dead ends: 583 [2020-01-16 19:10:34,901 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:10:34,902 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:34,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:10:34,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 373. [2020-01-16 19:10:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-01-16 19:10:34,910 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-01-16 19:10:34,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:34,910 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-01-16 19:10:34,911 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-01-16 19:10:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:34,911 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:34,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:34,911 INFO L426 AbstractCegarLoop]: === Iteration 1761 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:34,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:34,912 INFO L82 PathProgramCache]: Analyzing trace with hash 242691852, now seen corresponding path program 1755 times [2020-01-16 19:10:34,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:34,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067718361] [2020-01-16 19:10:34,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:35,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-01-16 19:10:35,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067718361] [2020-01-16 19:10:35,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:35,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:35,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541070563] [2020-01-16 19:10:35,180 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:35,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:35,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:35,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:35,181 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:10:35,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:35,266 INFO L93 Difference]: Finished difference Result 596 states and 1728 transitions. [2020-01-16 19:10:35,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:35,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:35,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:35,267 INFO L225 Difference]: With dead ends: 596 [2020-01-16 19:10:35,268 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:10:35,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:35,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:10:35,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 378. [2020-01-16 19:10:35,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:10:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1278 transitions. [2020-01-16 19:10:35,276 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1278 transitions. Word has length 22 [2020-01-16 19:10:35,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:35,276 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1278 transitions. [2020-01-16 19:10:35,276 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:35,276 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1278 transitions. [2020-01-16 19:10:35,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:35,277 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:35,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, 1, 1, 1] [2020-01-16 19:10:35,277 INFO L426 AbstractCegarLoop]: === Iteration 1762 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:35,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:35,277 INFO L82 PathProgramCache]: Analyzing trace with hash -2030358786, now seen corresponding path program 1756 times [2020-01-16 19:10:35,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:35,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317610782] [2020-01-16 19:10:35,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:35,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317610782] [2020-01-16 19:10:35,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:35,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:35,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140609825] [2020-01-16 19:10:35,540 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:35,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:35,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:35,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:35,541 INFO L87 Difference]: Start difference. First operand 378 states and 1278 transitions. Second operand 9 states. [2020-01-16 19:10:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:35,641 INFO L93 Difference]: Finished difference Result 592 states and 1716 transitions. [2020-01-16 19:10:35,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:35,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:35,643 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:10:35,643 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:10:35,643 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:10:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 373. [2020-01-16 19:10:35,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-01-16 19:10:35,653 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-01-16 19:10:35,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:35,653 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-01-16 19:10:35,653 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:35,653 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-01-16 19:10:35,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:35,654 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:35,654 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:35,654 INFO L426 AbstractCegarLoop]: === Iteration 1763 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:35,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:35,654 INFO L82 PathProgramCache]: Analyzing trace with hash 297414078, now seen corresponding path program 1757 times [2020-01-16 19:10:35,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:35,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316166306] [2020-01-16 19:10:35,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:35,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-01-16 19:10:35,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316166306] [2020-01-16 19:10:35,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:35,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:35,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139115899] [2020-01-16 19:10:35,929 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:35,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:35,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:35,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:35,929 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:10:36,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:36,010 INFO L93 Difference]: Finished difference Result 578 states and 1689 transitions. [2020-01-16 19:10:36,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:36,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:36,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:36,012 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:10:36,012 INFO L226 Difference]: Without dead ends: 569 [2020-01-16 19:10:36,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:36,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-01-16 19:10:36,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 374. [2020-01-16 19:10:36,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:10:36,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1269 transitions. [2020-01-16 19:10:36,022 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1269 transitions. Word has length 22 [2020-01-16 19:10:36,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:36,022 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1269 transitions. [2020-01-16 19:10:36,022 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:36,022 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1269 transitions. [2020-01-16 19:10:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:36,022 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:36,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, 1, 1, 1] [2020-01-16 19:10:36,023 INFO L426 AbstractCegarLoop]: === Iteration 1764 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:36,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:36,023 INFO L82 PathProgramCache]: Analyzing trace with hash 832643880, now seen corresponding path program 1758 times [2020-01-16 19:10:36,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:36,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163053214] [2020-01-16 19:10:36,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:36,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-01-16 19:10:36,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163053214] [2020-01-16 19:10:36,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:36,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:36,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626414411] [2020-01-16 19:10:36,290 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:36,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:36,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:36,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:36,291 INFO L87 Difference]: Start difference. First operand 374 states and 1269 transitions. Second operand 9 states. [2020-01-16 19:10:36,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:36,392 INFO L93 Difference]: Finished difference Result 581 states and 1694 transitions. [2020-01-16 19:10:36,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:36,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:36,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:36,393 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:10:36,394 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:10:36,394 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:36,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:10:36,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 371. [2020-01-16 19:10:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:10:36,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1264 transitions. [2020-01-16 19:10:36,403 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1264 transitions. Word has length 22 [2020-01-16 19:10:36,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:36,403 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1264 transitions. [2020-01-16 19:10:36,403 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:36,403 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1264 transitions. [2020-01-16 19:10:36,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:36,404 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:36,404 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:36,404 INFO L426 AbstractCegarLoop]: === Iteration 1765 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:36,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:36,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1538496044, now seen corresponding path program 1759 times [2020-01-16 19:10:36,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:36,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233092067] [2020-01-16 19:10:36,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:36,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:36,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233092067] [2020-01-16 19:10:36,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:36,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:36,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317694370] [2020-01-16 19:10:36,652 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:36,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:36,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:36,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:36,653 INFO L87 Difference]: Start difference. First operand 371 states and 1264 transitions. Second operand 9 states. [2020-01-16 19:10:36,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:36,740 INFO L93 Difference]: Finished difference Result 588 states and 1708 transitions. [2020-01-16 19:10:36,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:36,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:36,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:36,741 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:10:36,742 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:10:36,742 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:36,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:10:36,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 375. [2020-01-16 19:10:36,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:10:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1272 transitions. [2020-01-16 19:10:36,750 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1272 transitions. Word has length 22 [2020-01-16 19:10:36,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:36,750 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1272 transitions. [2020-01-16 19:10:36,750 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:36,750 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1272 transitions. [2020-01-16 19:10:36,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:36,751 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:36,751 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:36,751 INFO L426 AbstractCegarLoop]: === Iteration 1766 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:36,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:36,751 INFO L82 PathProgramCache]: Analyzing trace with hash -977427552, now seen corresponding path program 1760 times [2020-01-16 19:10:36,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:36,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805534107] [2020-01-16 19:10:36,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:37,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-01-16 19:10:37,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805534107] [2020-01-16 19:10:37,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:37,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:37,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745239893] [2020-01-16 19:10:37,002 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:37,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:37,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:37,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:37,002 INFO L87 Difference]: Start difference. First operand 375 states and 1272 transitions. Second operand 9 states. [2020-01-16 19:10:37,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:37,088 INFO L93 Difference]: Finished difference Result 581 states and 1693 transitions. [2020-01-16 19:10:37,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:37,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:37,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:37,089 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:10:37,090 INFO L226 Difference]: Without dead ends: 570 [2020-01-16 19:10:37,090 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:37,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-01-16 19:10:37,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 373. [2020-01-16 19:10:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-01-16 19:10:37,098 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-01-16 19:10:37,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:37,099 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-01-16 19:10:37,099 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:37,099 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-01-16 19:10:37,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:37,099 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:37,099 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:37,099 INFO L426 AbstractCegarLoop]: === Iteration 1767 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:37,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:37,100 INFO L82 PathProgramCache]: Analyzing trace with hash 568288076, now seen corresponding path program 1761 times [2020-01-16 19:10:37,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:37,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5343855] [2020-01-16 19:10:37,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:37,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-01-16 19:10:37,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5343855] [2020-01-16 19:10:37,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:37,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:37,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793285458] [2020-01-16 19:10:37,364 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:37,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:37,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:37,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:37,364 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:10:37,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:37,463 INFO L93 Difference]: Finished difference Result 588 states and 1712 transitions. [2020-01-16 19:10:37,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:37,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:37,465 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:10:37,465 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:10:37,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:37,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:10:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 379. [2020-01-16 19:10:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:10:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1278 transitions. [2020-01-16 19:10:37,474 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1278 transitions. Word has length 22 [2020-01-16 19:10:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:37,474 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1278 transitions. [2020-01-16 19:10:37,474 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:37,474 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1278 transitions. [2020-01-16 19:10:37,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:37,475 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:37,475 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:37,475 INFO L426 AbstractCegarLoop]: === Iteration 1768 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:37,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:37,475 INFO L82 PathProgramCache]: Analyzing trace with hash 761108768, now seen corresponding path program 1762 times [2020-01-16 19:10:37,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:37,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988535894] [2020-01-16 19:10:37,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:37,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-01-16 19:10:37,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988535894] [2020-01-16 19:10:37,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:37,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:37,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763354566] [2020-01-16 19:10:37,745 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:37,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:37,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:37,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:37,745 INFO L87 Difference]: Start difference. First operand 379 states and 1278 transitions. Second operand 9 states. [2020-01-16 19:10:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:37,846 INFO L93 Difference]: Finished difference Result 576 states and 1693 transitions. [2020-01-16 19:10:37,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:37,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:37,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:37,847 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:10:37,848 INFO L226 Difference]: Without dead ends: 557 [2020-01-16 19:10:37,848 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:37,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-01-16 19:10:37,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 373. [2020-01-16 19:10:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-01-16 19:10:37,856 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-01-16 19:10:37,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:37,856 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-01-16 19:10:37,856 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:37,856 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-01-16 19:10:37,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:37,857 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:37,857 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:37,857 INFO L426 AbstractCegarLoop]: === Iteration 1769 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:37,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:37,857 INFO L82 PathProgramCache]: Analyzing trace with hash 623010302, now seen corresponding path program 1763 times [2020-01-16 19:10:37,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:37,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119411842] [2020-01-16 19:10:37,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:38,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119411842] [2020-01-16 19:10:38,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:38,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:38,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108484753] [2020-01-16 19:10:38,117 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:38,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:38,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:38,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:38,117 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:10:38,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:38,199 INFO L93 Difference]: Finished difference Result 576 states and 1683 transitions. [2020-01-16 19:10:38,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:38,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:38,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:38,200 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:10:38,201 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 19:10:38,201 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:38,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 19:10:38,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 374. [2020-01-16 19:10:38,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:10:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1267 transitions. [2020-01-16 19:10:38,209 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1267 transitions. Word has length 22 [2020-01-16 19:10:38,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:38,209 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1267 transitions. [2020-01-16 19:10:38,210 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:38,210 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1267 transitions. [2020-01-16 19:10:38,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:38,210 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:38,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, 1, 1, 1] [2020-01-16 19:10:38,210 INFO L426 AbstractCegarLoop]: === Iteration 1770 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:38,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:38,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1525786234, now seen corresponding path program 1764 times [2020-01-16 19:10:38,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:38,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438556094] [2020-01-16 19:10:38,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:38,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-01-16 19:10:38,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438556094] [2020-01-16 19:10:38,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:38,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:38,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933068576] [2020-01-16 19:10:38,457 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:38,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:38,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:38,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:38,457 INFO L87 Difference]: Start difference. First operand 374 states and 1267 transitions. Second operand 9 states. [2020-01-16 19:10:38,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:38,568 INFO L93 Difference]: Finished difference Result 571 states and 1682 transitions. [2020-01-16 19:10:38,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:38,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:38,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:38,570 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:10:38,570 INFO L226 Difference]: Without dead ends: 555 [2020-01-16 19:10:38,570 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:38,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-01-16 19:10:38,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 371. [2020-01-16 19:10:38,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:10:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1262 transitions. [2020-01-16 19:10:38,579 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1262 transitions. Word has length 22 [2020-01-16 19:10:38,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:38,579 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1262 transitions. [2020-01-16 19:10:38,580 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:38,580 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1262 transitions. [2020-01-16 19:10:38,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:38,580 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:38,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, 1, 1, 1] [2020-01-16 19:10:38,580 INFO L426 AbstractCegarLoop]: === Iteration 1771 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:38,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:38,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1128490132, now seen corresponding path program 1765 times [2020-01-16 19:10:38,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:38,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070445413] [2020-01-16 19:10:38,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:38,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-01-16 19:10:38,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070445413] [2020-01-16 19:10:38,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:38,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:38,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864242876] [2020-01-16 19:10:38,852 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:38,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:38,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:38,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:38,853 INFO L87 Difference]: Start difference. First operand 371 states and 1262 transitions. Second operand 9 states. [2020-01-16 19:10:38,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:38,940 INFO L93 Difference]: Finished difference Result 595 states and 1734 transitions. [2020-01-16 19:10:38,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:38,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:38,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:38,942 INFO L225 Difference]: With dead ends: 595 [2020-01-16 19:10:38,942 INFO L226 Difference]: Without dead ends: 579 [2020-01-16 19:10:38,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:38,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-01-16 19:10:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 381. [2020-01-16 19:10:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:10:38,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1288 transitions. [2020-01-16 19:10:38,952 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1288 transitions. Word has length 22 [2020-01-16 19:10:38,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:38,952 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1288 transitions. [2020-01-16 19:10:38,952 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:38,952 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1288 transitions. [2020-01-16 19:10:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:38,952 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:38,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, 1, 1, 1] [2020-01-16 19:10:38,953 INFO L426 AbstractCegarLoop]: === Iteration 1772 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:38,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:38,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1144560506, now seen corresponding path program 1766 times [2020-01-16 19:10:38,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:38,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492998348] [2020-01-16 19:10:38,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:39,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-01-16 19:10:39,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492998348] [2020-01-16 19:10:39,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:39,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:39,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581810934] [2020-01-16 19:10:39,223 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:39,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:39,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:39,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:39,223 INFO L87 Difference]: Start difference. First operand 381 states and 1288 transitions. Second operand 9 states. [2020-01-16 19:10:39,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:39,322 INFO L93 Difference]: Finished difference Result 591 states and 1722 transitions. [2020-01-16 19:10:39,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:39,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:39,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:39,324 INFO L225 Difference]: With dead ends: 591 [2020-01-16 19:10:39,324 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:10:39,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:39,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:10:39,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 376. [2020-01-16 19:10:39,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:10:39,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1275 transitions. [2020-01-16 19:10:39,333 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1275 transitions. Word has length 22 [2020-01-16 19:10:39,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:39,333 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1275 transitions. [2020-01-16 19:10:39,333 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1275 transitions. [2020-01-16 19:10:39,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:39,334 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:39,334 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:39,334 INFO L426 AbstractCegarLoop]: === Iteration 1773 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:39,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:39,334 INFO L82 PathProgramCache]: Analyzing trace with hash -471947722, now seen corresponding path program 1767 times [2020-01-16 19:10:39,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:39,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937133501] [2020-01-16 19:10:39,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:39,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-01-16 19:10:39,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937133501] [2020-01-16 19:10:39,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:39,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:39,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868619956] [2020-01-16 19:10:39,608 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:39,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:39,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:39,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:39,608 INFO L87 Difference]: Start difference. First operand 376 states and 1275 transitions. Second operand 9 states. [2020-01-16 19:10:39,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:39,701 INFO L93 Difference]: Finished difference Result 583 states and 1704 transitions. [2020-01-16 19:10:39,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:39,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:39,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:39,703 INFO L225 Difference]: With dead ends: 583 [2020-01-16 19:10:39,703 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 19:10:39,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:39,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 19:10:39,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 382. [2020-01-16 19:10:39,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:10:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1285 transitions. [2020-01-16 19:10:39,711 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1285 transitions. Word has length 22 [2020-01-16 19:10:39,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:39,711 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1285 transitions. [2020-01-16 19:10:39,711 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1285 transitions. [2020-01-16 19:10:39,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:39,712 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:39,712 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:39,712 INFO L426 AbstractCegarLoop]: === Iteration 1774 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:39,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:39,712 INFO L82 PathProgramCache]: Analyzing trace with hash -279127030, now seen corresponding path program 1768 times [2020-01-16 19:10:39,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:39,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422179263] [2020-01-16 19:10:39,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:39,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-01-16 19:10:39,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422179263] [2020-01-16 19:10:39,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:39,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:39,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620664974] [2020-01-16 19:10:39,981 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:39,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:39,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:39,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:39,981 INFO L87 Difference]: Start difference. First operand 382 states and 1285 transitions. Second operand 9 states. [2020-01-16 19:10:40,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:40,096 INFO L93 Difference]: Finished difference Result 571 states and 1685 transitions. [2020-01-16 19:10:40,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:40,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:40,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:40,097 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:10:40,098 INFO L226 Difference]: Without dead ends: 552 [2020-01-16 19:10:40,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-01-16 19:10:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 376. [2020-01-16 19:10:40,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:10:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1270 transitions. [2020-01-16 19:10:40,107 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1270 transitions. Word has length 22 [2020-01-16 19:10:40,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:40,107 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1270 transitions. [2020-01-16 19:10:40,107 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:40,107 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1270 transitions. [2020-01-16 19:10:40,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:40,107 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:40,107 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:40,107 INFO L426 AbstractCegarLoop]: === Iteration 1775 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:40,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:40,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1467283954, now seen corresponding path program 1769 times [2020-01-16 19:10:40,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:40,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743395302] [2020-01-16 19:10:40,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:40,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-01-16 19:10:40,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743395302] [2020-01-16 19:10:40,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:40,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:40,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334265431] [2020-01-16 19:10:40,375 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:40,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:40,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:40,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:40,375 INFO L87 Difference]: Start difference. First operand 376 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:10:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:40,472 INFO L93 Difference]: Finished difference Result 568 states and 1679 transitions. [2020-01-16 19:10:40,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:40,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:40,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:40,474 INFO L225 Difference]: With dead ends: 568 [2020-01-16 19:10:40,474 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:10:40,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:40,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:10:40,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 380. [2020-01-16 19:10:40,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:10:40,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1277 transitions. [2020-01-16 19:10:40,483 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1277 transitions. Word has length 22 [2020-01-16 19:10:40,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:40,483 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1277 transitions. [2020-01-16 19:10:40,483 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:40,483 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1277 transitions. [2020-01-16 19:10:40,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:40,484 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:40,484 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:40,484 INFO L426 AbstractCegarLoop]: === Iteration 1776 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:40,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:40,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1968808812, now seen corresponding path program 1770 times [2020-01-16 19:10:40,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:40,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986363090] [2020-01-16 19:10:40,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:40,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:40,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986363090] [2020-01-16 19:10:40,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:40,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:40,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548489126] [2020-01-16 19:10:40,757 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:40,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:40,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:40,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:40,757 INFO L87 Difference]: Start difference. First operand 380 states and 1277 transitions. Second operand 9 states. [2020-01-16 19:10:40,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:40,868 INFO L93 Difference]: Finished difference Result 555 states and 1660 transitions. [2020-01-16 19:10:40,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:40,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:40,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:40,870 INFO L225 Difference]: With dead ends: 555 [2020-01-16 19:10:40,870 INFO L226 Difference]: Without dead ends: 533 [2020-01-16 19:10:40,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:40,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-01-16 19:10:40,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 371. [2020-01-16 19:10:40,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:10:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1260 transitions. [2020-01-16 19:10:40,879 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1260 transitions. Word has length 22 [2020-01-16 19:10:40,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:40,879 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1260 transitions. [2020-01-16 19:10:40,879 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:40,879 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1260 transitions. [2020-01-16 19:10:40,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:40,880 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:40,880 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:40,880 INFO L426 AbstractCegarLoop]: === Iteration 1777 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:40,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:40,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1628620000, now seen corresponding path program 1771 times [2020-01-16 19:10:40,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:40,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113416426] [2020-01-16 19:10:40,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:41,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:41,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113416426] [2020-01-16 19:10:41,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:41,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:41,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879749272] [2020-01-16 19:10:41,154 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:41,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:41,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:41,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:41,155 INFO L87 Difference]: Start difference. First operand 371 states and 1260 transitions. Second operand 9 states. [2020-01-16 19:10:41,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:41,241 INFO L93 Difference]: Finished difference Result 568 states and 1666 transitions. [2020-01-16 19:10:41,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:41,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:41,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:41,243 INFO L225 Difference]: With dead ends: 568 [2020-01-16 19:10:41,243 INFO L226 Difference]: Without dead ends: 559 [2020-01-16 19:10:41,243 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:41,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-01-16 19:10:41,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 373. [2020-01-16 19:10:41,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1264 transitions. [2020-01-16 19:10:41,252 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1264 transitions. Word has length 22 [2020-01-16 19:10:41,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:41,252 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1264 transitions. [2020-01-16 19:10:41,252 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:41,252 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1264 transitions. [2020-01-16 19:10:41,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:41,253 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:41,253 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:41,253 INFO L426 AbstractCegarLoop]: === Iteration 1778 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:41,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:41,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1093390198, now seen corresponding path program 1772 times [2020-01-16 19:10:41,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:41,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162649748] [2020-01-16 19:10:41,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:41,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162649748] [2020-01-16 19:10:41,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:41,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:41,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231402943] [2020-01-16 19:10:41,514 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:41,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:41,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:41,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:41,514 INFO L87 Difference]: Start difference. First operand 373 states and 1264 transitions. Second operand 9 states. [2020-01-16 19:10:41,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:41,628 INFO L93 Difference]: Finished difference Result 571 states and 1671 transitions. [2020-01-16 19:10:41,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:41,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:41,630 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:10:41,630 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:10:41,630 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:10:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 372. [2020-01-16 19:10:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:10:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1262 transitions. [2020-01-16 19:10:41,639 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1262 transitions. Word has length 22 [2020-01-16 19:10:41,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:41,639 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1262 transitions. [2020-01-16 19:10:41,639 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1262 transitions. [2020-01-16 19:10:41,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:41,639 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:41,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, 1, 1, 1] [2020-01-16 19:10:41,640 INFO L426 AbstractCegarLoop]: === Iteration 1779 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:41,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:41,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1065909442, now seen corresponding path program 1773 times [2020-01-16 19:10:41,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:41,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900069006] [2020-01-16 19:10:41,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:41,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900069006] [2020-01-16 19:10:41,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:41,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:41,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123481383] [2020-01-16 19:10:41,901 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:41,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:41,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:41,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:41,901 INFO L87 Difference]: Start difference. First operand 372 states and 1262 transitions. Second operand 9 states. [2020-01-16 19:10:41,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:41,978 INFO L93 Difference]: Finished difference Result 567 states and 1664 transitions. [2020-01-16 19:10:41,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:41,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:41,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:41,980 INFO L225 Difference]: With dead ends: 567 [2020-01-16 19:10:41,980 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:10:41,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:41,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:10:41,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 373. [2020-01-16 19:10:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1263 transitions. [2020-01-16 19:10:41,990 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1263 transitions. Word has length 22 [2020-01-16 19:10:41,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:41,990 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1263 transitions. [2020-01-16 19:10:41,990 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:41,990 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1263 transitions. [2020-01-16 19:10:41,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:41,991 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:41,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, 1, 1, 1] [2020-01-16 19:10:41,991 INFO L426 AbstractCegarLoop]: === Iteration 1780 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:41,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:41,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1082887094, now seen corresponding path program 1774 times [2020-01-16 19:10:41,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:41,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095679322] [2020-01-16 19:10:41,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:42,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-01-16 19:10:42,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095679322] [2020-01-16 19:10:42,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:42,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:42,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787694380] [2020-01-16 19:10:42,244 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:42,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:42,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:42,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:42,244 INFO L87 Difference]: Start difference. First operand 373 states and 1263 transitions. Second operand 9 states. [2020-01-16 19:10:42,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:42,358 INFO L93 Difference]: Finished difference Result 562 states and 1663 transitions. [2020-01-16 19:10:42,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:42,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:42,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:42,359 INFO L225 Difference]: With dead ends: 562 [2020-01-16 19:10:42,360 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:10:42,360 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:42,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:10:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 372. [2020-01-16 19:10:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:10:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1261 transitions. [2020-01-16 19:10:42,368 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1261 transitions. Word has length 22 [2020-01-16 19:10:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:42,369 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1261 transitions. [2020-01-16 19:10:42,369 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1261 transitions. [2020-01-16 19:10:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:42,369 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10: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, 1, 1, 1] [2020-01-16 19:10:42,369 INFO L426 AbstractCegarLoop]: === Iteration 1781 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:42,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:42,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1013393922, now seen corresponding path program 1775 times [2020-01-16 19:10:42,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:42,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873052894] [2020-01-16 19:10:42,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:42,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873052894] [2020-01-16 19:10:42,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:42,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:42,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601449508] [2020-01-16 19:10:42,635 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:42,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:42,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:42,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:42,635 INFO L87 Difference]: Start difference. First operand 372 states and 1261 transitions. Second operand 9 states. [2020-01-16 19:10:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:42,733 INFO L93 Difference]: Finished difference Result 564 states and 1670 transitions. [2020-01-16 19:10:42,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:42,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:42,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:42,735 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:10:42,735 INFO L226 Difference]: Without dead ends: 552 [2020-01-16 19:10:42,735 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:42,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-01-16 19:10:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 376. [2020-01-16 19:10:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:10:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1268 transitions. [2020-01-16 19:10:42,744 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1268 transitions. Word has length 22 [2020-01-16 19:10:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:42,744 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1268 transitions. [2020-01-16 19:10:42,744 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1268 transitions. [2020-01-16 19:10:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:42,745 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:42,745 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:42,745 INFO L426 AbstractCegarLoop]: === Iteration 1782 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:42,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:42,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1670632416, now seen corresponding path program 1776 times [2020-01-16 19:10:42,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:42,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629160344] [2020-01-16 19:10:42,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:43,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629160344] [2020-01-16 19:10:43,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:43,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:43,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888089921] [2020-01-16 19:10:43,008 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:43,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:43,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:43,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:43,009 INFO L87 Difference]: Start difference. First operand 376 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:10:43,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:43,106 INFO L93 Difference]: Finished difference Result 551 states and 1651 transitions. [2020-01-16 19:10:43,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:43,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:43,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:43,108 INFO L225 Difference]: With dead ends: 551 [2020-01-16 19:10:43,108 INFO L226 Difference]: Without dead ends: 531 [2020-01-16 19:10:43,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:43,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-01-16 19:10:43,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 369. [2020-01-16 19:10:43,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-01-16 19:10:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1256 transitions. [2020-01-16 19:10:43,117 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1256 transitions. Word has length 22 [2020-01-16 19:10:43,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:43,117 INFO L478 AbstractCegarLoop]: Abstraction has 369 states and 1256 transitions. [2020-01-16 19:10:43,117 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:43,117 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1256 transitions. [2020-01-16 19:10:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:43,118 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:43,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, 1, 1, 1] [2020-01-16 19:10:43,118 INFO L426 AbstractCegarLoop]: === Iteration 1783 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:43,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:43,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1651723624, now seen corresponding path program 1777 times [2020-01-16 19:10:43,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:43,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609210188] [2020-01-16 19:10:43,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:43,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-01-16 19:10:43,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609210188] [2020-01-16 19:10:43,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:43,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:43,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013464389] [2020-01-16 19:10:43,391 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:43,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:43,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:43,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:43,392 INFO L87 Difference]: Start difference. First operand 369 states and 1256 transitions. Second operand 9 states. [2020-01-16 19:10:43,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:43,509 INFO L93 Difference]: Finished difference Result 556 states and 1638 transitions. [2020-01-16 19:10:43,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:43,509 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:43,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:43,510 INFO L225 Difference]: With dead ends: 556 [2020-01-16 19:10:43,510 INFO L226 Difference]: Without dead ends: 545 [2020-01-16 19:10:43,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:43,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-01-16 19:10:43,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 372. [2020-01-16 19:10:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:10:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1264 transitions. [2020-01-16 19:10:43,520 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1264 transitions. Word has length 22 [2020-01-16 19:10:43,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:43,520 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1264 transitions. [2020-01-16 19:10:43,520 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:43,520 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1264 transitions. [2020-01-16 19:10:43,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:43,521 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:43,521 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:43,521 INFO L426 AbstractCegarLoop]: === Iteration 1784 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:43,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:43,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1197726662, now seen corresponding path program 1778 times [2020-01-16 19:10:43,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:43,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133818131] [2020-01-16 19:10:43,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:43,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-01-16 19:10:43,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133818131] [2020-01-16 19:10:43,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:43,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:43,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621474985] [2020-01-16 19:10:43,799 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:43,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:43,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:43,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:43,800 INFO L87 Difference]: Start difference. First operand 372 states and 1264 transitions. Second operand 9 states. [2020-01-16 19:10:43,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:43,907 INFO L93 Difference]: Finished difference Result 554 states and 1633 transitions. [2020-01-16 19:10:43,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:43,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:43,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:43,908 INFO L225 Difference]: With dead ends: 554 [2020-01-16 19:10:43,908 INFO L226 Difference]: Without dead ends: 544 [2020-01-16 19:10:43,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-01-16 19:10:43,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 371. [2020-01-16 19:10:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:10:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1262 transitions. [2020-01-16 19:10:43,918 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1262 transitions. Word has length 22 [2020-01-16 19:10:43,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:43,918 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1262 transitions. [2020-01-16 19:10:43,918 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:43,918 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1262 transitions. [2020-01-16 19:10:43,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:43,918 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:43,918 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:43,919 INFO L426 AbstractCegarLoop]: === Iteration 1785 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:43,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:43,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2055498350, now seen corresponding path program 1779 times [2020-01-16 19:10:43,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:43,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356410684] [2020-01-16 19:10:43,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:44,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356410684] [2020-01-16 19:10:44,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:44,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:44,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836825992] [2020-01-16 19:10:44,200 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:44,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:44,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:44,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:44,200 INFO L87 Difference]: Start difference. First operand 371 states and 1262 transitions. Second operand 9 states. [2020-01-16 19:10:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:44,304 INFO L93 Difference]: Finished difference Result 561 states and 1649 transitions. [2020-01-16 19:10:44,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:44,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:44,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:44,306 INFO L225 Difference]: With dead ends: 561 [2020-01-16 19:10:44,306 INFO L226 Difference]: Without dead ends: 550 [2020-01-16 19:10:44,306 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:44,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-01-16 19:10:44,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 374. [2020-01-16 19:10:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:10:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1267 transitions. [2020-01-16 19:10:44,315 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1267 transitions. Word has length 22 [2020-01-16 19:10:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:44,316 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1267 transitions. [2020-01-16 19:10:44,316 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1267 transitions. [2020-01-16 19:10:44,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:44,316 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10: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, 1, 1, 1] [2020-01-16 19:10:44,316 INFO L426 AbstractCegarLoop]: === Iteration 1786 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:44,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:44,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1937451002, now seen corresponding path program 1780 times [2020-01-16 19:10:44,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:44,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659001179] [2020-01-16 19:10:44,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:44,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659001179] [2020-01-16 19:10:44,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:44,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:44,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580667230] [2020-01-16 19:10:44,592 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:44,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:44,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:44,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:44,593 INFO L87 Difference]: Start difference. First operand 374 states and 1267 transitions. Second operand 9 states. [2020-01-16 19:10:44,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:44,712 INFO L93 Difference]: Finished difference Result 562 states and 1648 transitions. [2020-01-16 19:10:44,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:44,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:44,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:44,713 INFO L225 Difference]: With dead ends: 562 [2020-01-16 19:10:44,713 INFO L226 Difference]: Without dead ends: 547 [2020-01-16 19:10:44,714 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:44,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-01-16 19:10:44,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 371. [2020-01-16 19:10:44,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:10:44,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1261 transitions. [2020-01-16 19:10:44,722 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1261 transitions. Word has length 22 [2020-01-16 19:10:44,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:44,723 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1261 transitions. [2020-01-16 19:10:44,723 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:44,723 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1261 transitions. [2020-01-16 19:10:44,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:44,723 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:44,723 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:44,723 INFO L426 AbstractCegarLoop]: === Iteration 1787 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:44,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:44,724 INFO L82 PathProgramCache]: Analyzing trace with hash -990456514, now seen corresponding path program 1781 times [2020-01-16 19:10:44,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:44,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211831407] [2020-01-16 19:10:44,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:45,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211831407] [2020-01-16 19:10:45,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:45,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:45,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927501483] [2020-01-16 19:10:45,024 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:45,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:45,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:45,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:45,025 INFO L87 Difference]: Start difference. First operand 371 states and 1261 transitions. Second operand 9 states. [2020-01-16 19:10:45,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:45,120 INFO L93 Difference]: Finished difference Result 555 states and 1634 transitions. [2020-01-16 19:10:45,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:45,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:45,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:45,122 INFO L225 Difference]: With dead ends: 555 [2020-01-16 19:10:45,122 INFO L226 Difference]: Without dead ends: 546 [2020-01-16 19:10:45,122 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:45,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-01-16 19:10:45,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 372. [2020-01-16 19:10:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:10:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1262 transitions. [2020-01-16 19:10:45,132 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1262 transitions. Word has length 22 [2020-01-16 19:10:45,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:45,132 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1262 transitions. [2020-01-16 19:10:45,132 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:45,132 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1262 transitions. [2020-01-16 19:10:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:45,133 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:45,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, 1, 1, 1] [2020-01-16 19:10:45,133 INFO L426 AbstractCegarLoop]: === Iteration 1788 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:45,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:45,133 INFO L82 PathProgramCache]: Analyzing trace with hash -455226712, now seen corresponding path program 1782 times [2020-01-16 19:10:45,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:45,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296723926] [2020-01-16 19:10:45,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:45,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-01-16 19:10:45,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296723926] [2020-01-16 19:10:45,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:45,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:45,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897683708] [2020-01-16 19:10:45,404 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:45,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:45,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:45,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:45,405 INFO L87 Difference]: Start difference. First operand 372 states and 1262 transitions. Second operand 9 states. [2020-01-16 19:10:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:45,533 INFO L93 Difference]: Finished difference Result 558 states and 1639 transitions. [2020-01-16 19:10:45,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:45,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:45,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:45,534 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:10:45,535 INFO L226 Difference]: Without dead ends: 544 [2020-01-16 19:10:45,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:45,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-01-16 19:10:45,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 370. [2020-01-16 19:10:45,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-01-16 19:10:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1259 transitions. [2020-01-16 19:10:45,544 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1259 transitions. Word has length 22 [2020-01-16 19:10:45,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:45,544 INFO L478 AbstractCegarLoop]: Abstraction has 370 states and 1259 transitions. [2020-01-16 19:10:45,544 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1259 transitions. [2020-01-16 19:10:45,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:45,544 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:45,544 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:45,545 INFO L426 AbstractCegarLoop]: === Iteration 1789 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:45,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:45,545 INFO L82 PathProgramCache]: Analyzing trace with hash 274310454, now seen corresponding path program 1783 times [2020-01-16 19:10:45,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:45,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741287032] [2020-01-16 19:10:45,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:45,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-01-16 19:10:45,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741287032] [2020-01-16 19:10:45,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:45,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:45,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239073761] [2020-01-16 19:10:45,812 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:45,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:45,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:45,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:45,813 INFO L87 Difference]: Start difference. First operand 370 states and 1259 transitions. Second operand 9 states. [2020-01-16 19:10:45,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:45,926 INFO L93 Difference]: Finished difference Result 555 states and 1634 transitions. [2020-01-16 19:10:45,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:45,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:45,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:45,928 INFO L225 Difference]: With dead ends: 555 [2020-01-16 19:10:45,928 INFO L226 Difference]: Without dead ends: 544 [2020-01-16 19:10:45,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:45,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-01-16 19:10:45,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 372. [2020-01-16 19:10:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:10:45,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1263 transitions. [2020-01-16 19:10:45,937 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1263 transitions. Word has length 22 [2020-01-16 19:10:45,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:45,937 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1263 transitions. [2020-01-16 19:10:45,937 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:45,937 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1263 transitions. [2020-01-16 19:10:45,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:45,938 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:45,938 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:45,938 INFO L426 AbstractCegarLoop]: === Iteration 1790 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:45,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:45,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1171206556, now seen corresponding path program 1784 times [2020-01-16 19:10:45,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:45,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49812730] [2020-01-16 19:10:45,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:46,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:46,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49812730] [2020-01-16 19:10:46,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:46,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:46,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715030627] [2020-01-16 19:10:46,214 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:46,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:46,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:46,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:46,215 INFO L87 Difference]: Start difference. First operand 372 states and 1263 transitions. Second operand 9 states. [2020-01-16 19:10:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:46,306 INFO L93 Difference]: Finished difference Result 553 states and 1629 transitions. [2020-01-16 19:10:46,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:46,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:46,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:46,308 INFO L225 Difference]: With dead ends: 553 [2020-01-16 19:10:46,308 INFO L226 Difference]: Without dead ends: 543 [2020-01-16 19:10:46,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:46,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-01-16 19:10:46,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 371. [2020-01-16 19:10:46,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:10:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1261 transitions. [2020-01-16 19:10:46,316 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1261 transitions. Word has length 22 [2020-01-16 19:10:46,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:46,317 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1261 transitions. [2020-01-16 19:10:46,317 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:46,317 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1261 transitions. [2020-01-16 19:10:46,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:46,317 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:46,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, 1, 1, 1] [2020-01-16 19:10:46,317 INFO L426 AbstractCegarLoop]: === Iteration 1791 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:46,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:46,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1913872722, now seen corresponding path program 1785 times [2020-01-16 19:10:46,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:46,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114552444] [2020-01-16 19:10:46,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:46,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-01-16 19:10:46,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114552444] [2020-01-16 19:10:46,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:46,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:46,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63645780] [2020-01-16 19:10:46,580 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:46,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:46,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:46,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:46,581 INFO L87 Difference]: Start difference. First operand 371 states and 1261 transitions. Second operand 9 states. [2020-01-16 19:10:46,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:46,695 INFO L93 Difference]: Finished difference Result 558 states and 1642 transitions. [2020-01-16 19:10:46,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:46,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:46,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:46,697 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:10:46,697 INFO L226 Difference]: Without dead ends: 547 [2020-01-16 19:10:46,697 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:46,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-01-16 19:10:46,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 374. [2020-01-16 19:10:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:10:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1266 transitions. [2020-01-16 19:10:46,707 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1266 transitions. Word has length 22 [2020-01-16 19:10:46,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:46,707 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1266 transitions. [2020-01-16 19:10:46,707 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:46,707 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1266 transitions. [2020-01-16 19:10:46,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:46,707 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:46,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, 1, 1, 1] [2020-01-16 19:10:46,708 INFO L426 AbstractCegarLoop]: === Iteration 1792 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:46,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:46,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1599095332, now seen corresponding path program 1786 times [2020-01-16 19:10:46,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:46,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768416103] [2020-01-16 19:10:46,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:46,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768416103] [2020-01-16 19:10:46,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:46,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:46,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248334838] [2020-01-16 19:10:46,971 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:46,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:46,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:46,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:46,972 INFO L87 Difference]: Start difference. First operand 374 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:10:47,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:47,085 INFO L93 Difference]: Finished difference Result 551 states and 1635 transitions. [2020-01-16 19:10:47,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:47,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:47,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:47,087 INFO L225 Difference]: With dead ends: 551 [2020-01-16 19:10:47,087 INFO L226 Difference]: Without dead ends: 535 [2020-01-16 19:10:47,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:47,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-01-16 19:10:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 371. [2020-01-16 19:10:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:10:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1260 transitions. [2020-01-16 19:10:47,096 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1260 transitions. Word has length 22 [2020-01-16 19:10:47,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:47,096 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1260 transitions. [2020-01-16 19:10:47,096 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1260 transitions. [2020-01-16 19:10:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:47,097 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:47,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, 1, 1, 1] [2020-01-16 19:10:47,098 INFO L426 AbstractCegarLoop]: === Iteration 1793 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:47,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:47,098 INFO L82 PathProgramCache]: Analyzing trace with hash -664860290, now seen corresponding path program 1787 times [2020-01-16 19:10:47,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:47,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056097660] [2020-01-16 19:10:47,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:47,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-01-16 19:10:47,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056097660] [2020-01-16 19:10:47,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:47,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:47,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33716839] [2020-01-16 19:10:47,375 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:47,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:47,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:47,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:47,375 INFO L87 Difference]: Start difference. First operand 371 states and 1260 transitions. Second operand 9 states. [2020-01-16 19:10:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:47,459 INFO L93 Difference]: Finished difference Result 554 states and 1631 transitions. [2020-01-16 19:10:47,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:47,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:47,461 INFO L225 Difference]: With dead ends: 554 [2020-01-16 19:10:47,461 INFO L226 Difference]: Without dead ends: 545 [2020-01-16 19:10:47,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:47,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-01-16 19:10:47,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 372. [2020-01-16 19:10:47,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:10:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1261 transitions. [2020-01-16 19:10:47,470 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1261 transitions. Word has length 22 [2020-01-16 19:10:47,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:47,470 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1261 transitions. [2020-01-16 19:10:47,470 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1261 transitions. [2020-01-16 19:10:47,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:47,471 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:47,471 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:47,471 INFO L426 AbstractCegarLoop]: === Iteration 1794 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:47,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:47,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1481310470, now seen corresponding path program 1788 times [2020-01-16 19:10:47,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:47,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818091601] [2020-01-16 19:10:47,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:47,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818091601] [2020-01-16 19:10:47,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:47,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:47,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165465272] [2020-01-16 19:10:47,741 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:47,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:47,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:47,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:47,742 INFO L87 Difference]: Start difference. First operand 372 states and 1261 transitions. Second operand 9 states. [2020-01-16 19:10:47,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:47,859 INFO L93 Difference]: Finished difference Result 549 states and 1630 transitions. [2020-01-16 19:10:47,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:47,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:47,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:47,860 INFO L225 Difference]: With dead ends: 549 [2020-01-16 19:10:47,860 INFO L226 Difference]: Without dead ends: 534 [2020-01-16 19:10:47,861 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:47,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-01-16 19:10:47,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 370. [2020-01-16 19:10:47,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-01-16 19:10:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1258 transitions. [2020-01-16 19:10:47,868 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1258 transitions. Word has length 22 [2020-01-16 19:10:47,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:47,869 INFO L478 AbstractCegarLoop]: Abstraction has 370 states and 1258 transitions. [2020-01-16 19:10:47,869 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1258 transitions. [2020-01-16 19:10:47,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:47,869 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:47,869 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:47,869 INFO L426 AbstractCegarLoop]: === Iteration 1795 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:47,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:47,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1353670666, now seen corresponding path program 1789 times [2020-01-16 19:10:47,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:47,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253536671] [2020-01-16 19:10:47,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:48,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253536671] [2020-01-16 19:10:48,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:48,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:48,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747005052] [2020-01-16 19:10:48,140 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:48,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:48,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:48,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:48,140 INFO L87 Difference]: Start difference. First operand 370 states and 1258 transitions. Second operand 9 states. [2020-01-16 19:10:48,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:48,258 INFO L93 Difference]: Finished difference Result 565 states and 1663 transitions. [2020-01-16 19:10:48,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:48,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:48,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:48,260 INFO L225 Difference]: With dead ends: 565 [2020-01-16 19:10:48,260 INFO L226 Difference]: Without dead ends: 554 [2020-01-16 19:10:48,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:48,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-01-16 19:10:48,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 376. [2020-01-16 19:10:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:10:48,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1274 transitions. [2020-01-16 19:10:48,268 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1274 transitions. Word has length 22 [2020-01-16 19:10:48,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:48,268 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1274 transitions. [2020-01-16 19:10:48,268 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1274 transitions. [2020-01-16 19:10:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:48,269 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:48,269 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:48,269 INFO L426 AbstractCegarLoop]: === Iteration 1796 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:48,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:48,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1051652722, now seen corresponding path program 1790 times [2020-01-16 19:10:48,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:48,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586850523] [2020-01-16 19:10:48,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:48,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586850523] [2020-01-16 19:10:48,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:48,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:48,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178710571] [2020-01-16 19:10:48,541 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:48,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:48,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:48,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:48,541 INFO L87 Difference]: Start difference. First operand 376 states and 1274 transitions. Second operand 9 states. [2020-01-16 19:10:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:48,659 INFO L93 Difference]: Finished difference Result 566 states and 1662 transitions. [2020-01-16 19:10:48,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:48,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:48,661 INFO L225 Difference]: With dead ends: 566 [2020-01-16 19:10:48,661 INFO L226 Difference]: Without dead ends: 551 [2020-01-16 19:10:48,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:48,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-01-16 19:10:48,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 373. [2020-01-16 19:10:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-01-16 19:10:48,670 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-01-16 19:10:48,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:48,670 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-01-16 19:10:48,670 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-01-16 19:10:48,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:48,671 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:48,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, 1, 1, 1] [2020-01-16 19:10:48,671 INFO L426 AbstractCegarLoop]: === Iteration 1797 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:48,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:48,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1340858776, now seen corresponding path program 1791 times [2020-01-16 19:10:48,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:48,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611995635] [2020-01-16 19:10:48,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:48,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611995635] [2020-01-16 19:10:48,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:48,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:48,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656719139] [2020-01-16 19:10:48,938 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:48,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:48,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:48,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:48,939 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:10:49,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:49,046 INFO L93 Difference]: Finished difference Result 560 states and 1649 transitions. [2020-01-16 19:10:49,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:49,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:49,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:49,048 INFO L225 Difference]: With dead ends: 560 [2020-01-16 19:10:49,048 INFO L226 Difference]: Without dead ends: 549 [2020-01-16 19:10:49,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:49,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-01-16 19:10:49,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 376. [2020-01-16 19:10:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:10:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1271 transitions. [2020-01-16 19:10:49,057 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1271 transitions. Word has length 22 [2020-01-16 19:10:49,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:49,057 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1271 transitions. [2020-01-16 19:10:49,057 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:49,057 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1271 transitions. [2020-01-16 19:10:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:49,058 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:49,058 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:49,058 INFO L426 AbstractCegarLoop]: === Iteration 1798 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:49,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:49,058 INFO L82 PathProgramCache]: Analyzing trace with hash 558859534, now seen corresponding path program 1792 times [2020-01-16 19:10:49,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:49,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194092016] [2020-01-16 19:10:49,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:49,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-01-16 19:10:49,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194092016] [2020-01-16 19:10:49,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:49,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:49,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675931894] [2020-01-16 19:10:49,327 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:49,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:49,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:49,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:49,327 INFO L87 Difference]: Start difference. First operand 376 states and 1271 transitions. Second operand 9 states. [2020-01-16 19:10:49,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:49,430 INFO L93 Difference]: Finished difference Result 553 states and 1642 transitions. [2020-01-16 19:10:49,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:49,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:49,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:49,432 INFO L225 Difference]: With dead ends: 553 [2020-01-16 19:10:49,432 INFO L226 Difference]: Without dead ends: 537 [2020-01-16 19:10:49,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:49,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-01-16 19:10:49,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 373. [2020-01-16 19:10:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1263 transitions. [2020-01-16 19:10:49,441 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1263 transitions. Word has length 22 [2020-01-16 19:10:49,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:49,441 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1263 transitions. [2020-01-16 19:10:49,441 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:49,441 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1263 transitions. [2020-01-16 19:10:49,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:49,441 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:49,441 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:49,441 INFO L426 AbstractCegarLoop]: === Iteration 1799 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:49,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:49,442 INFO L82 PathProgramCache]: Analyzing trace with hash 476174552, now seen corresponding path program 1793 times [2020-01-16 19:10:49,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:49,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532950670] [2020-01-16 19:10:49,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:49,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-01-16 19:10:49,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532950670] [2020-01-16 19:10:49,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:49,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:49,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002020292] [2020-01-16 19:10:49,714 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:49,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:49,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:49,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:49,714 INFO L87 Difference]: Start difference. First operand 373 states and 1263 transitions. Second operand 9 states. [2020-01-16 19:10:49,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:49,816 INFO L93 Difference]: Finished difference Result 553 states and 1643 transitions. [2020-01-16 19:10:49,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:49,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:49,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:49,817 INFO L225 Difference]: With dead ends: 553 [2020-01-16 19:10:49,817 INFO L226 Difference]: Without dead ends: 541 [2020-01-16 19:10:49,818 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-01-16 19:10:49,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 377. [2020-01-16 19:10:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:10:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1270 transitions. [2020-01-16 19:10:49,826 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1270 transitions. Word has length 22 [2020-01-16 19:10:49,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:49,826 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1270 transitions. [2020-01-16 19:10:49,826 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1270 transitions. [2020-01-16 19:10:49,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:49,827 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:49,827 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:49,827 INFO L426 AbstractCegarLoop]: === Iteration 1800 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:49,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:49,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1331481206, now seen corresponding path program 1794 times [2020-01-16 19:10:49,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:49,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98207870] [2020-01-16 19:10:49,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:50,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-01-16 19:10:50,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98207870] [2020-01-16 19:10:50,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:50,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:50,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092375744] [2020-01-16 19:10:50,101 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:50,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:50,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:50,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:50,101 INFO L87 Difference]: Start difference. First operand 377 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:10:50,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:50,218 INFO L93 Difference]: Finished difference Result 540 states and 1624 transitions. [2020-01-16 19:10:50,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:50,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:50,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:50,220 INFO L225 Difference]: With dead ends: 540 [2020-01-16 19:10:50,220 INFO L226 Difference]: Without dead ends: 520 [2020-01-16 19:10:50,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:50,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2020-01-16 19:10:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 370. [2020-01-16 19:10:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-01-16 19:10:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1257 transitions. [2020-01-16 19:10:50,230 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1257 transitions. Word has length 22 [2020-01-16 19:10:50,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:50,230 INFO L478 AbstractCegarLoop]: Abstraction has 370 states and 1257 transitions. [2020-01-16 19:10:50,230 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1257 transitions. [2020-01-16 19:10:50,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:50,231 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:50,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, 1, 1, 1] [2020-01-16 19:10:50,231 INFO L426 AbstractCegarLoop]: === Iteration 1801 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:50,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:50,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1821375844, now seen corresponding path program 1795 times [2020-01-16 19:10:50,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:50,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542757039] [2020-01-16 19:10:50,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:50,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:50,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542757039] [2020-01-16 19:10:50,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:50,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:50,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326980856] [2020-01-16 19:10:50,501 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:50,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:50,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:50,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:50,501 INFO L87 Difference]: Start difference. First operand 370 states and 1257 transitions. Second operand 9 states. [2020-01-16 19:10:50,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:50,577 INFO L93 Difference]: Finished difference Result 555 states and 1634 transitions. [2020-01-16 19:10:50,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:50,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:50,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:50,578 INFO L225 Difference]: With dead ends: 555 [2020-01-16 19:10:50,579 INFO L226 Difference]: Without dead ends: 546 [2020-01-16 19:10:50,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-01-16 19:10:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 372. [2020-01-16 19:10:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:10:50,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1261 transitions. [2020-01-16 19:10:50,586 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1261 transitions. Word has length 22 [2020-01-16 19:10:50,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:50,587 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1261 transitions. [2020-01-16 19:10:50,587 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1261 transitions. [2020-01-16 19:10:50,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:50,587 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:50,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, 1, 1, 1] [2020-01-16 19:10:50,587 INFO L426 AbstractCegarLoop]: === Iteration 1802 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:50,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:50,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1938361650, now seen corresponding path program 1796 times [2020-01-16 19:10:50,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:50,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652022817] [2020-01-16 19:10:50,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:50,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-01-16 19:10:50,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652022817] [2020-01-16 19:10:50,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:50,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:50,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785444228] [2020-01-16 19:10:50,855 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:50,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:50,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:50,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:50,855 INFO L87 Difference]: Start difference. First operand 372 states and 1261 transitions. Second operand 9 states. [2020-01-16 19:10:50,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:50,974 INFO L93 Difference]: Finished difference Result 558 states and 1639 transitions. [2020-01-16 19:10:50,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:50,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:50,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:50,976 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:10:50,976 INFO L226 Difference]: Without dead ends: 545 [2020-01-16 19:10:50,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-01-16 19:10:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 371. [2020-01-16 19:10:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:10:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1259 transitions. [2020-01-16 19:10:50,985 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1259 transitions. Word has length 22 [2020-01-16 19:10:50,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:50,985 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1259 transitions. [2020-01-16 19:10:50,985 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1259 transitions. [2020-01-16 19:10:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:50,986 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:50,986 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:50,986 INFO L426 AbstractCegarLoop]: === Iteration 1803 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:50,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:50,986 INFO L82 PathProgramCache]: Analyzing trace with hash 220937990, now seen corresponding path program 1797 times [2020-01-16 19:10:50,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:50,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482501846] [2020-01-16 19:10:50,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:51,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482501846] [2020-01-16 19:10:51,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:51,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:51,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822519619] [2020-01-16 19:10:51,252 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:51,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:51,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:51,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:51,252 INFO L87 Difference]: Start difference. First operand 371 states and 1259 transitions. Second operand 9 states. [2020-01-16 19:10:51,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:51,345 INFO L93 Difference]: Finished difference Result 554 states and 1632 transitions. [2020-01-16 19:10:51,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:51,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:51,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:51,347 INFO L225 Difference]: With dead ends: 554 [2020-01-16 19:10:51,347 INFO L226 Difference]: Without dead ends: 545 [2020-01-16 19:10:51,347 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:51,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-01-16 19:10:51,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 372. [2020-01-16 19:10:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:10:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1260 transitions. [2020-01-16 19:10:51,356 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1260 transitions. Word has length 22 [2020-01-16 19:10:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:51,356 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1260 transitions. [2020-01-16 19:10:51,356 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1260 transitions. [2020-01-16 19:10:51,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:51,356 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:51,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, 1, 1, 1] [2020-01-16 19:10:51,357 INFO L426 AbstractCegarLoop]: === Iteration 1804 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:51,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:51,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1927858546, now seen corresponding path program 1798 times [2020-01-16 19:10:51,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:51,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669194745] [2020-01-16 19:10:51,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:51,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-01-16 19:10:51,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669194745] [2020-01-16 19:10:51,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:51,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:51,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803332619] [2020-01-16 19:10:51,618 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:51,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:51,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:51,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:51,618 INFO L87 Difference]: Start difference. First operand 372 states and 1260 transitions. Second operand 9 states. [2020-01-16 19:10:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:51,729 INFO L93 Difference]: Finished difference Result 549 states and 1631 transitions. [2020-01-16 19:10:51,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:51,729 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:51,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:51,731 INFO L225 Difference]: With dead ends: 549 [2020-01-16 19:10:51,731 INFO L226 Difference]: Without dead ends: 535 [2020-01-16 19:10:51,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:51,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-01-16 19:10:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 371. [2020-01-16 19:10:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:10:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1258 transitions. [2020-01-16 19:10:51,740 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1258 transitions. Word has length 22 [2020-01-16 19:10:51,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:51,740 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1258 transitions. [2020-01-16 19:10:51,740 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1258 transitions. [2020-01-16 19:10:51,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:51,741 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:51,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, 1, 1, 1] [2020-01-16 19:10:51,741 INFO L426 AbstractCegarLoop]: === Iteration 1805 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:51,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:51,741 INFO L82 PathProgramCache]: Analyzing trace with hash 168422470, now seen corresponding path program 1799 times [2020-01-16 19:10:51,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:51,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229380666] [2020-01-16 19:10:51,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:52,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229380666] [2020-01-16 19:10:52,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:52,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:52,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369751079] [2020-01-16 19:10:52,012 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:52,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:52,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:52,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:52,013 INFO L87 Difference]: Start difference. First operand 371 states and 1258 transitions. Second operand 9 states. [2020-01-16 19:10:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:52,109 INFO L93 Difference]: Finished difference Result 551 states and 1638 transitions. [2020-01-16 19:10:52,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:52,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:52,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:52,111 INFO L225 Difference]: With dead ends: 551 [2020-01-16 19:10:52,111 INFO L226 Difference]: Without dead ends: 539 [2020-01-16 19:10:52,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-01-16 19:10:52,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 375. [2020-01-16 19:10:52,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:10:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1265 transitions. [2020-01-16 19:10:52,120 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1265 transitions. Word has length 22 [2020-01-16 19:10:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:52,120 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1265 transitions. [2020-01-16 19:10:52,121 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:52,121 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1265 transitions. [2020-01-16 19:10:52,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:52,121 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:52,121 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:52,121 INFO L426 AbstractCegarLoop]: === Iteration 1806 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:52,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:52,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1779363428, now seen corresponding path program 1800 times [2020-01-16 19:10:52,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:52,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357954601] [2020-01-16 19:10:52,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:52,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-01-16 19:10:52,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357954601] [2020-01-16 19:10:52,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:52,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:52,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728528945] [2020-01-16 19:10:52,386 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:52,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:52,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:52,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:52,386 INFO L87 Difference]: Start difference. First operand 375 states and 1265 transitions. Second operand 9 states. [2020-01-16 19:10:52,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:52,481 INFO L93 Difference]: Finished difference Result 538 states and 1619 transitions. [2020-01-16 19:10:52,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:52,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:52,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:52,483 INFO L225 Difference]: With dead ends: 538 [2020-01-16 19:10:52,483 INFO L226 Difference]: Without dead ends: 517 [2020-01-16 19:10:52,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:52,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-01-16 19:10:52,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 367. [2020-01-16 19:10:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2020-01-16 19:10:52,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1252 transitions. [2020-01-16 19:10:52,491 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1252 transitions. Word has length 22 [2020-01-16 19:10:52,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:52,491 INFO L478 AbstractCegarLoop]: Abstraction has 367 states and 1252 transitions. [2020-01-16 19:10:52,491 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:52,491 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1252 transitions. [2020-01-16 19:10:52,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:52,492 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:52,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, 1, 1, 1] [2020-01-16 19:10:52,492 INFO L426 AbstractCegarLoop]: === Iteration 1807 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:52,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:52,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1290682328, now seen corresponding path program 1801 times [2020-01-16 19:10:52,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:52,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786351417] [2020-01-16 19:10:52,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:52,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:52,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786351417] [2020-01-16 19:10:52,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:52,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:52,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256617714] [2020-01-16 19:10:52,766 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:52,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:52,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:52,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:52,766 INFO L87 Difference]: Start difference. First operand 367 states and 1252 transitions. Second operand 9 states. [2020-01-16 19:10:52,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:52,852 INFO L93 Difference]: Finished difference Result 618 states and 1820 transitions. [2020-01-16 19:10:52,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:52,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:52,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:52,854 INFO L225 Difference]: With dead ends: 618 [2020-01-16 19:10:52,854 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:10:52,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:52,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:10:52,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 380. [2020-01-16 19:10:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:10:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1297 transitions. [2020-01-16 19:10:52,863 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1297 transitions. Word has length 22 [2020-01-16 19:10:52,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:52,863 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1297 transitions. [2020-01-16 19:10:52,863 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1297 transitions. [2020-01-16 19:10:52,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:52,864 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:52,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, 1, 1, 1] [2020-01-16 19:10:52,864 INFO L426 AbstractCegarLoop]: === Iteration 1808 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:52,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:52,864 INFO L82 PathProgramCache]: Analyzing trace with hash 299583558, now seen corresponding path program 1802 times [2020-01-16 19:10:52,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:52,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928001530] [2020-01-16 19:10:52,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:53,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:53,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928001530] [2020-01-16 19:10:53,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:53,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:53,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318571208] [2020-01-16 19:10:53,137 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:53,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:53,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:53,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:53,137 INFO L87 Difference]: Start difference. First operand 380 states and 1297 transitions. Second operand 9 states. [2020-01-16 19:10:53,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:53,239 INFO L93 Difference]: Finished difference Result 613 states and 1807 transitions. [2020-01-16 19:10:53,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:53,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:53,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:53,241 INFO L225 Difference]: With dead ends: 613 [2020-01-16 19:10:53,241 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:10:53,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:53,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:10:53,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 376. [2020-01-16 19:10:53,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:10:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1288 transitions. [2020-01-16 19:10:53,249 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1288 transitions. Word has length 22 [2020-01-16 19:10:53,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:53,249 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1288 transitions. [2020-01-16 19:10:53,249 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:53,249 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1288 transitions. [2020-01-16 19:10:53,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:53,250 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:53,250 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:53,250 INFO L426 AbstractCegarLoop]: === Iteration 1809 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:53,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:53,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1189770156, now seen corresponding path program 1803 times [2020-01-16 19:10:53,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:53,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522930323] [2020-01-16 19:10:53,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:53,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-01-16 19:10:53,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522930323] [2020-01-16 19:10:53,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:53,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:53,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990969502] [2020-01-16 19:10:53,521 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:53,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:53,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:53,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:53,521 INFO L87 Difference]: Start difference. First operand 376 states and 1288 transitions. Second operand 9 states. [2020-01-16 19:10:53,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:53,595 INFO L93 Difference]: Finished difference Result 616 states and 1812 transitions. [2020-01-16 19:10:53,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:53,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:53,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:53,597 INFO L225 Difference]: With dead ends: 616 [2020-01-16 19:10:53,597 INFO L226 Difference]: Without dead ends: 600 [2020-01-16 19:10:53,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:53,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-01-16 19:10:53,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 379. [2020-01-16 19:10:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:10:53,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1292 transitions. [2020-01-16 19:10:53,606 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1292 transitions. Word has length 22 [2020-01-16 19:10:53,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:53,606 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1292 transitions. [2020-01-16 19:10:53,606 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1292 transitions. [2020-01-16 19:10:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:53,607 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:53,607 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:53,607 INFO L426 AbstractCegarLoop]: === Iteration 1810 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:53,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:53,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1063133782, now seen corresponding path program 1804 times [2020-01-16 19:10:53,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:53,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304822161] [2020-01-16 19:10:53,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:53,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-01-16 19:10:53,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304822161] [2020-01-16 19:10:53,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:53,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:53,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290511512] [2020-01-16 19:10:53,870 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:53,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:53,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:53,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:53,870 INFO L87 Difference]: Start difference. First operand 379 states and 1292 transitions. Second operand 9 states. [2020-01-16 19:10:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:53,987 INFO L93 Difference]: Finished difference Result 610 states and 1798 transitions. [2020-01-16 19:10:53,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:53,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:53,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:53,988 INFO L225 Difference]: With dead ends: 610 [2020-01-16 19:10:53,989 INFO L226 Difference]: Without dead ends: 597 [2020-01-16 19:10:53,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:53,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-01-16 19:10:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 376. [2020-01-16 19:10:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:10:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1285 transitions. [2020-01-16 19:10:53,998 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1285 transitions. Word has length 22 [2020-01-16 19:10:53,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:53,998 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1285 transitions. [2020-01-16 19:10:53,998 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:53,998 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1285 transitions. [2020-01-16 19:10:53,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:53,999 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:53,999 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:53,999 INFO L426 AbstractCegarLoop]: === Iteration 1811 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:53,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:53,999 INFO L82 PathProgramCache]: Analyzing trace with hash 816815346, now seen corresponding path program 1805 times [2020-01-16 19:10:53,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:53,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904943695] [2020-01-16 19:10:54,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:54,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:54,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904943695] [2020-01-16 19:10:54,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:54,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:54,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059881609] [2020-01-16 19:10:54,275 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:54,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:54,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:54,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:54,275 INFO L87 Difference]: Start difference. First operand 376 states and 1285 transitions. Second operand 9 states. [2020-01-16 19:10:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:54,388 INFO L93 Difference]: Finished difference Result 605 states and 1789 transitions. [2020-01-16 19:10:54,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:54,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:54,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:54,390 INFO L225 Difference]: With dead ends: 605 [2020-01-16 19:10:54,390 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:10:54,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:10:54,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 378. [2020-01-16 19:10:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:10:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1288 transitions. [2020-01-16 19:10:54,398 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1288 transitions. Word has length 22 [2020-01-16 19:10:54,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:54,399 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1288 transitions. [2020-01-16 19:10:54,399 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:54,399 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1288 transitions. [2020-01-16 19:10:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:54,399 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:54,399 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:54,399 INFO L426 AbstractCegarLoop]: === Iteration 1812 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:54,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:54,399 INFO L82 PathProgramCache]: Analyzing trace with hash -2136219162, now seen corresponding path program 1806 times [2020-01-16 19:10:54,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:54,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631478658] [2020-01-16 19:10:54,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:54,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-01-16 19:10:54,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631478658] [2020-01-16 19:10:54,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:54,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:54,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067017104] [2020-01-16 19:10:54,670 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:54,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:54,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:54,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:54,670 INFO L87 Difference]: Start difference. First operand 378 states and 1288 transitions. Second operand 9 states. [2020-01-16 19:10:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:54,772 INFO L93 Difference]: Finished difference Result 604 states and 1785 transitions. [2020-01-16 19:10:54,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:54,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:54,774 INFO L225 Difference]: With dead ends: 604 [2020-01-16 19:10:54,774 INFO L226 Difference]: Without dead ends: 589 [2020-01-16 19:10:54,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-01-16 19:10:54,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 373. [2020-01-16 19:10:54,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1278 transitions. [2020-01-16 19:10:54,783 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1278 transitions. Word has length 22 [2020-01-16 19:10:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:54,783 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1278 transitions. [2020-01-16 19:10:54,783 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1278 transitions. [2020-01-16 19:10:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:54,784 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:54,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:54,784 INFO L426 AbstractCegarLoop]: === Iteration 1813 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:54,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:54,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1244232028, now seen corresponding path program 1807 times [2020-01-16 19:10:54,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:54,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373785658] [2020-01-16 19:10:54,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:55,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-01-16 19:10:55,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373785658] [2020-01-16 19:10:55,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:55,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:55,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975982065] [2020-01-16 19:10:55,061 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:55,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:55,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:55,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:55,061 INFO L87 Difference]: Start difference. First operand 373 states and 1278 transitions. Second operand 9 states. [2020-01-16 19:10:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:55,141 INFO L93 Difference]: Finished difference Result 624 states and 1834 transitions. [2020-01-16 19:10:55,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:55,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:55,143 INFO L225 Difference]: With dead ends: 624 [2020-01-16 19:10:55,143 INFO L226 Difference]: Without dead ends: 608 [2020-01-16 19:10:55,143 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:55,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-01-16 19:10:55,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 381. [2020-01-16 19:10:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:10:55,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1298 transitions. [2020-01-16 19:10:55,152 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1298 transitions. Word has length 22 [2020-01-16 19:10:55,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:55,152 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1298 transitions. [2020-01-16 19:10:55,153 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:55,153 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1298 transitions. [2020-01-16 19:10:55,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:55,153 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:55,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, 1, 1, 1] [2020-01-16 19:10:55,153 INFO L426 AbstractCegarLoop]: === Iteration 1814 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:55,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:55,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1460469382, now seen corresponding path program 1808 times [2020-01-16 19:10:55,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:55,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742871976] [2020-01-16 19:10:55,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:55,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-01-16 19:10:55,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742871976] [2020-01-16 19:10:55,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:55,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:55,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107133875] [2020-01-16 19:10:55,424 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:55,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:55,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:55,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:55,425 INFO L87 Difference]: Start difference. First operand 381 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:10:55,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:55,529 INFO L93 Difference]: Finished difference Result 619 states and 1821 transitions. [2020-01-16 19:10:55,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:55,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:55,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:55,531 INFO L225 Difference]: With dead ends: 619 [2020-01-16 19:10:55,531 INFO L226 Difference]: Without dead ends: 604 [2020-01-16 19:10:55,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:55,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-01-16 19:10:55,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 377. [2020-01-16 19:10:55,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:10:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1288 transitions. [2020-01-16 19:10:55,540 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1288 transitions. Word has length 22 [2020-01-16 19:10:55,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:55,540 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1288 transitions. [2020-01-16 19:10:55,540 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:55,540 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1288 transitions. [2020-01-16 19:10:55,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:55,540 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:55,541 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:55,541 INFO L426 AbstractCegarLoop]: === Iteration 1815 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:55,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:55,541 INFO L82 PathProgramCache]: Analyzing trace with hash -104444724, now seen corresponding path program 1809 times [2020-01-16 19:10:55,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:55,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914295000] [2020-01-16 19:10:55,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:55,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:55,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914295000] [2020-01-16 19:10:55,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:55,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:55,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851623533] [2020-01-16 19:10:55,819 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:55,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:55,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:55,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:55,820 INFO L87 Difference]: Start difference. First operand 377 states and 1288 transitions. Second operand 9 states. [2020-01-16 19:10:55,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:55,897 INFO L93 Difference]: Finished difference Result 626 states and 1835 transitions. [2020-01-16 19:10:55,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:55,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:55,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:55,898 INFO L225 Difference]: With dead ends: 626 [2020-01-16 19:10:55,899 INFO L226 Difference]: Without dead ends: 610 [2020-01-16 19:10:55,899 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:55,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-01-16 19:10:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 382. [2020-01-16 19:10:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:10:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1296 transitions. [2020-01-16 19:10:55,908 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1296 transitions. Word has length 22 [2020-01-16 19:10:55,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:55,908 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1296 transitions. [2020-01-16 19:10:55,908 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1296 transitions. [2020-01-16 19:10:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:55,908 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:55,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, 1, 1, 1] [2020-01-16 19:10:55,908 INFO L426 AbstractCegarLoop]: === Iteration 1816 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:55,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:55,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1805772626, now seen corresponding path program 1810 times [2020-01-16 19:10:55,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:55,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883941998] [2020-01-16 19:10:55,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:56,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:56,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883941998] [2020-01-16 19:10:56,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:56,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:56,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714765359] [2020-01-16 19:10:56,179 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:56,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:56,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:56,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:56,180 INFO L87 Difference]: Start difference. First operand 382 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:10:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:56,297 INFO L93 Difference]: Finished difference Result 622 states and 1823 transitions. [2020-01-16 19:10:56,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:56,298 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:56,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:56,299 INFO L225 Difference]: With dead ends: 622 [2020-01-16 19:10:56,299 INFO L226 Difference]: Without dead ends: 605 [2020-01-16 19:10:56,299 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:56,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-01-16 19:10:56,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 377. [2020-01-16 19:10:56,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:10:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1284 transitions. [2020-01-16 19:10:56,309 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1284 transitions. Word has length 22 [2020-01-16 19:10:56,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:56,309 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1284 transitions. [2020-01-16 19:10:56,309 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:56,309 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1284 transitions. [2020-01-16 19:10:56,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:56,309 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:56,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, 1, 1, 1] [2020-01-16 19:10:56,310 INFO L426 AbstractCegarLoop]: === Iteration 1817 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:56,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:56,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1319741138, now seen corresponding path program 1811 times [2020-01-16 19:10:56,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:56,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218238354] [2020-01-16 19:10:56,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:56,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-01-16 19:10:56,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218238354] [2020-01-16 19:10:56,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:56,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:56,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884694081] [2020-01-16 19:10:56,587 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:56,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:56,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:56,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:56,587 INFO L87 Difference]: Start difference. First operand 377 states and 1284 transitions. Second operand 9 states. [2020-01-16 19:10:56,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:56,696 INFO L93 Difference]: Finished difference Result 614 states and 1808 transitions. [2020-01-16 19:10:56,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:56,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:56,698 INFO L225 Difference]: With dead ends: 614 [2020-01-16 19:10:56,698 INFO L226 Difference]: Without dead ends: 603 [2020-01-16 19:10:56,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:56,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-01-16 19:10:56,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 380. [2020-01-16 19:10:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:10:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1289 transitions. [2020-01-16 19:10:56,707 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1289 transitions. Word has length 22 [2020-01-16 19:10:56,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:56,707 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1289 transitions. [2020-01-16 19:10:56,707 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:56,707 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1289 transitions. [2020-01-16 19:10:56,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:56,707 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:56,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, 1, 1, 1] [2020-01-16 19:10:56,708 INFO L426 AbstractCegarLoop]: === Iteration 1818 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:56,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:56,708 INFO L82 PathProgramCache]: Analyzing trace with hash -446000458, now seen corresponding path program 1812 times [2020-01-16 19:10:56,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:56,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538271561] [2020-01-16 19:10:56,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:56,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538271561] [2020-01-16 19:10:56,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:56,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:56,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360171146] [2020-01-16 19:10:56,980 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:56,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:56,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:56,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:56,981 INFO L87 Difference]: Start difference. First operand 380 states and 1289 transitions. Second operand 9 states. [2020-01-16 19:10:57,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:57,098 INFO L93 Difference]: Finished difference Result 615 states and 1807 transitions. [2020-01-16 19:10:57,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:57,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:57,100 INFO L225 Difference]: With dead ends: 615 [2020-01-16 19:10:57,100 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 19:10:57,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:57,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 19:10:57,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 373. [2020-01-16 19:10:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1275 transitions. [2020-01-16 19:10:57,110 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1275 transitions. Word has length 22 [2020-01-16 19:10:57,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:57,110 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1275 transitions. [2020-01-16 19:10:57,110 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:57,110 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1275 transitions. [2020-01-16 19:10:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:57,110 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:57,110 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:57,111 INFO L426 AbstractCegarLoop]: === Iteration 1819 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:57,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:57,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1788251988, now seen corresponding path program 1813 times [2020-01-16 19:10:57,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:57,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495387273] [2020-01-16 19:10:57,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:57,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495387273] [2020-01-16 19:10:57,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:57,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:57,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364374829] [2020-01-16 19:10:57,379 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:57,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:57,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:57,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:57,379 INFO L87 Difference]: Start difference. First operand 373 states and 1275 transitions. Second operand 9 states. [2020-01-16 19:10:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:57,467 INFO L93 Difference]: Finished difference Result 618 states and 1814 transitions. [2020-01-16 19:10:57,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:57,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:57,469 INFO L225 Difference]: With dead ends: 618 [2020-01-16 19:10:57,469 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:10:57,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:57,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:10:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 379. [2020-01-16 19:10:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:10:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1289 transitions. [2020-01-16 19:10:57,478 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1289 transitions. Word has length 22 [2020-01-16 19:10:57,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:57,479 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1289 transitions. [2020-01-16 19:10:57,479 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1289 transitions. [2020-01-16 19:10:57,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:57,479 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:57,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, 1, 1, 1] [2020-01-16 19:10:57,479 INFO L426 AbstractCegarLoop]: === Iteration 1820 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:57,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:57,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1661615614, now seen corresponding path program 1814 times [2020-01-16 19:10:57,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:57,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815784961] [2020-01-16 19:10:57,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:57,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-01-16 19:10:57,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815784961] [2020-01-16 19:10:57,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:57,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:57,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140365954] [2020-01-16 19:10:57,756 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:57,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:57,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:57,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:57,756 INFO L87 Difference]: Start difference. First operand 379 states and 1289 transitions. Second operand 9 states. [2020-01-16 19:10:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:57,863 INFO L93 Difference]: Finished difference Result 612 states and 1800 transitions. [2020-01-16 19:10:57,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:57,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:57,865 INFO L225 Difference]: With dead ends: 612 [2020-01-16 19:10:57,865 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 19:10:57,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:57,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 19:10:57,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 376. [2020-01-16 19:10:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:10:57,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1282 transitions. [2020-01-16 19:10:57,874 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1282 transitions. Word has length 22 [2020-01-16 19:10:57,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:57,874 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1282 transitions. [2020-01-16 19:10:57,874 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1282 transitions. [2020-01-16 19:10:57,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:57,875 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:57,875 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:57,875 INFO L426 AbstractCegarLoop]: === Iteration 1821 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:57,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:57,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1431004152, now seen corresponding path program 1815 times [2020-01-16 19:10:57,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:57,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187967197] [2020-01-16 19:10:57,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:58,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187967197] [2020-01-16 19:10:58,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:58,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:58,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956701944] [2020-01-16 19:10:58,147 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:58,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:58,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:58,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:58,148 INFO L87 Difference]: Start difference. First operand 376 states and 1282 transitions. Second operand 9 states. [2020-01-16 19:10:58,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:58,228 INFO L93 Difference]: Finished difference Result 622 states and 1821 transitions. [2020-01-16 19:10:58,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:58,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:58,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:58,230 INFO L225 Difference]: With dead ends: 622 [2020-01-16 19:10:58,230 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 19:10:58,230 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:58,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 19:10:58,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 381. [2020-01-16 19:10:58,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:10:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1290 transitions. [2020-01-16 19:10:58,240 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1290 transitions. Word has length 22 [2020-01-16 19:10:58,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:58,240 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1290 transitions. [2020-01-16 19:10:58,240 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1290 transitions. [2020-01-16 19:10:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:58,241 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:58,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, 1, 1, 1] [2020-01-16 19:10:58,241 INFO L426 AbstractCegarLoop]: === Iteration 1822 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1322504706, now seen corresponding path program 1816 times [2020-01-16 19:10:58,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:58,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217462953] [2020-01-16 19:10:58,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:10:58,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217462953] [2020-01-16 19:10:58,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:58,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:58,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054151727] [2020-01-16 19:10:58,508 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:58,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:58,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:58,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:58,509 INFO L87 Difference]: Start difference. First operand 381 states and 1290 transitions. Second operand 9 states. [2020-01-16 19:10:58,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:58,614 INFO L93 Difference]: Finished difference Result 618 states and 1809 transitions. [2020-01-16 19:10:58,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:58,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:58,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:58,615 INFO L225 Difference]: With dead ends: 618 [2020-01-16 19:10:58,616 INFO L226 Difference]: Without dead ends: 601 [2020-01-16 19:10:58,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:58,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-01-16 19:10:58,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 376. [2020-01-16 19:10:58,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:10:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1279 transitions. [2020-01-16 19:10:58,625 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1279 transitions. Word has length 22 [2020-01-16 19:10:58,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:58,625 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1279 transitions. [2020-01-16 19:10:58,625 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1279 transitions. [2020-01-16 19:10:58,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:58,625 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:58,625 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:58,626 INFO L426 AbstractCegarLoop]: === Iteration 1823 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:58,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:58,626 INFO L82 PathProgramCache]: Analyzing trace with hash -588530234, now seen corresponding path program 1817 times [2020-01-16 19:10:58,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:58,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441122143] [2020-01-16 19:10:58,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:58,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-01-16 19:10:58,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441122143] [2020-01-16 19:10:58,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:58,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:58,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331833358] [2020-01-16 19:10:58,890 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:58,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:58,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:58,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:58,890 INFO L87 Difference]: Start difference. First operand 376 states and 1279 transitions. Second operand 9 states. [2020-01-16 19:10:59,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:59,004 INFO L93 Difference]: Finished difference Result 607 states and 1788 transitions. [2020-01-16 19:10:59,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:59,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:59,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:59,006 INFO L225 Difference]: With dead ends: 607 [2020-01-16 19:10:59,006 INFO L226 Difference]: Without dead ends: 597 [2020-01-16 19:10:59,006 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:59,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-01-16 19:10:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 378. [2020-01-16 19:10:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:10:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1282 transitions. [2020-01-16 19:10:59,015 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1282 transitions. Word has length 22 [2020-01-16 19:10:59,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:59,015 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1282 transitions. [2020-01-16 19:10:59,015 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:59,015 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1282 transitions. [2020-01-16 19:10:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:59,016 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:59,016 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:10:59,016 INFO L426 AbstractCegarLoop]: === Iteration 1824 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:59,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:59,016 INFO L82 PathProgramCache]: Analyzing trace with hash -761777926, now seen corresponding path program 1818 times [2020-01-16 19:10:59,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:59,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452170697] [2020-01-16 19:10:59,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:59,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-01-16 19:10:59,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452170697] [2020-01-16 19:10:59,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:59,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:59,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760211323] [2020-01-16 19:10:59,276 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:59,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:59,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:59,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:59,277 INFO L87 Difference]: Start difference. First operand 378 states and 1282 transitions. Second operand 9 states. [2020-01-16 19:10:59,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:59,398 INFO L93 Difference]: Finished difference Result 609 states and 1790 transitions. [2020-01-16 19:10:59,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:59,398 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:59,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:59,400 INFO L225 Difference]: With dead ends: 609 [2020-01-16 19:10:59,400 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 19:10:59,400 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 19:10:59,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 373. [2020-01-16 19:10:59,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:10:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-01-16 19:10:59,410 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-01-16 19:10:59,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:59,410 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-01-16 19:10:59,410 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-01-16 19:10:59,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:59,410 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:59,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, 1, 1, 1] [2020-01-16 19:10:59,410 INFO L426 AbstractCegarLoop]: === Iteration 1825 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:59,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:59,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1312425102, now seen corresponding path program 1819 times [2020-01-16 19:10:59,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:59,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280748571] [2020-01-16 19:10:59,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:10:59,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-01-16 19:10:59,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280748571] [2020-01-16 19:10:59,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:10:59,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:10:59,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137208388] [2020-01-16 19:10:59,680 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:10:59,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:10:59,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:10:59,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:10:59,680 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-01-16 19:10:59,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:10:59,783 INFO L93 Difference]: Finished difference Result 598 states and 1772 transitions. [2020-01-16 19:10:59,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:10:59,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:10:59,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:10:59,785 INFO L225 Difference]: With dead ends: 598 [2020-01-16 19:10:59,785 INFO L226 Difference]: Without dead ends: 587 [2020-01-16 19:10:59,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:10:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-01-16 19:10:59,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 377. [2020-01-16 19:10:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:10:59,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1282 transitions. [2020-01-16 19:10:59,794 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1282 transitions. Word has length 22 [2020-01-16 19:10:59,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:10:59,794 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1282 transitions. [2020-01-16 19:10:59,794 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:10:59,794 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1282 transitions. [2020-01-16 19:10:59,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:10:59,794 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:10:59,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, 1, 1, 1] [2020-01-16 19:10:59,795 INFO L426 AbstractCegarLoop]: === Iteration 1826 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:10:59,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:10:59,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1640609406, now seen corresponding path program 1820 times [2020-01-16 19:10:59,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:10:59,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493509795] [2020-01-16 19:10:59,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:10:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:00,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493509795] [2020-01-16 19:11:00,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:00,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:00,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143835240] [2020-01-16 19:11:00,068 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:00,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:00,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:00,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:00,069 INFO L87 Difference]: Start difference. First operand 377 states and 1282 transitions. Second operand 9 states. [2020-01-16 19:11:00,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:00,167 INFO L93 Difference]: Finished difference Result 597 states and 1768 transitions. [2020-01-16 19:11:00,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:00,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:00,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:00,168 INFO L225 Difference]: With dead ends: 597 [2020-01-16 19:11:00,169 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 19:11:00,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:00,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 19:11:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 375. [2020-01-16 19:11:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:11:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1277 transitions. [2020-01-16 19:11:00,178 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1277 transitions. Word has length 22 [2020-01-16 19:11:00,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:00,178 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1277 transitions. [2020-01-16 19:11:00,178 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:00,178 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1277 transitions. [2020-01-16 19:11:00,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:00,178 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:00,178 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:00,179 INFO L426 AbstractCegarLoop]: === Iteration 1827 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:00,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:00,179 INFO L82 PathProgramCache]: Analyzing trace with hash 236713946, now seen corresponding path program 1821 times [2020-01-16 19:11:00,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:00,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365755738] [2020-01-16 19:11:00,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:00,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-01-16 19:11:00,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365755738] [2020-01-16 19:11:00,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:00,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:00,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641404910] [2020-01-16 19:11:00,452 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:00,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:00,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:00,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:00,452 INFO L87 Difference]: Start difference. First operand 375 states and 1277 transitions. Second operand 9 states. [2020-01-16 19:11:00,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:00,548 INFO L93 Difference]: Finished difference Result 601 states and 1777 transitions. [2020-01-16 19:11:00,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:00,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:00,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:00,550 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:11:00,550 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 19:11:00,550 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:00,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 19:11:00,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 378. [2020-01-16 19:11:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:11:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1282 transitions. [2020-01-16 19:11:00,560 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1282 transitions. Word has length 22 [2020-01-16 19:11:00,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:00,560 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1282 transitions. [2020-01-16 19:11:00,560 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:00,560 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1282 transitions. [2020-01-16 19:11:00,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:00,560 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:00,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, 1, 1, 1] [2020-01-16 19:11:00,561 INFO L426 AbstractCegarLoop]: === Iteration 1828 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:00,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:00,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1591684214, now seen corresponding path program 1822 times [2020-01-16 19:11:00,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:00,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904643486] [2020-01-16 19:11:00,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:00,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-01-16 19:11:00,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904643486] [2020-01-16 19:11:00,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:00,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:00,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148912137] [2020-01-16 19:11:00,835 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:00,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:00,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:00,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:00,835 INFO L87 Difference]: Start difference. First operand 378 states and 1282 transitions. Second operand 9 states. [2020-01-16 19:11:00,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:00,946 INFO L93 Difference]: Finished difference Result 602 states and 1776 transitions. [2020-01-16 19:11:00,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:00,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:00,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:00,948 INFO L225 Difference]: With dead ends: 602 [2020-01-16 19:11:00,948 INFO L226 Difference]: Without dead ends: 587 [2020-01-16 19:11:00,948 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:00,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-01-16 19:11:00,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 375. [2020-01-16 19:11:00,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:11:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1275 transitions. [2020-01-16 19:11:00,957 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1275 transitions. Word has length 22 [2020-01-16 19:11:00,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:00,957 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1275 transitions. [2020-01-16 19:11:00,957 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:00,957 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1275 transitions. [2020-01-16 19:11:00,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:00,957 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:00,958 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:00,958 INFO L426 AbstractCegarLoop]: === Iteration 1829 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:00,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:00,958 INFO L82 PathProgramCache]: Analyzing trace with hash 505561354, now seen corresponding path program 1823 times [2020-01-16 19:11:00,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:00,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050129573] [2020-01-16 19:11:00,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:01,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-01-16 19:11:01,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050129573] [2020-01-16 19:11:01,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:01,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:01,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093936307] [2020-01-16 19:11:01,235 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:01,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:01,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:01,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:01,235 INFO L87 Difference]: Start difference. First operand 375 states and 1275 transitions. Second operand 9 states. [2020-01-16 19:11:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:01,350 INFO L93 Difference]: Finished difference Result 598 states and 1768 transitions. [2020-01-16 19:11:01,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:01,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:01,352 INFO L225 Difference]: With dead ends: 598 [2020-01-16 19:11:01,352 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 19:11:01,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:01,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 19:11:01,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 377. [2020-01-16 19:11:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:11:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1278 transitions. [2020-01-16 19:11:01,362 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1278 transitions. Word has length 22 [2020-01-16 19:11:01,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:01,362 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1278 transitions. [2020-01-16 19:11:01,362 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1278 transitions. [2020-01-16 19:11:01,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:01,363 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:01,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, 1, 1, 1] [2020-01-16 19:11:01,363 INFO L426 AbstractCegarLoop]: === Iteration 1830 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:01,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:01,363 INFO L82 PathProgramCache]: Analyzing trace with hash 332313662, now seen corresponding path program 1824 times [2020-01-16 19:11:01,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:01,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228287390] [2020-01-16 19:11:01,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:01,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228287390] [2020-01-16 19:11:01,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:01,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:01,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279732700] [2020-01-16 19:11:01,636 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:01,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:01,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:01,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:01,637 INFO L87 Difference]: Start difference. First operand 377 states and 1278 transitions. Second operand 9 states. [2020-01-16 19:11:01,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:01,747 INFO L93 Difference]: Finished difference Result 600 states and 1770 transitions. [2020-01-16 19:11:01,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:01,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:01,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:01,749 INFO L225 Difference]: With dead ends: 600 [2020-01-16 19:11:01,749 INFO L226 Difference]: Without dead ends: 581 [2020-01-16 19:11:01,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:01,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-01-16 19:11:01,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 370. [2020-01-16 19:11:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-01-16 19:11:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1265 transitions. [2020-01-16 19:11:01,758 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1265 transitions. Word has length 22 [2020-01-16 19:11:01,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:01,758 INFO L478 AbstractCegarLoop]: Abstraction has 370 states and 1265 transitions. [2020-01-16 19:11:01,758 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:01,758 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1265 transitions. [2020-01-16 19:11:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:01,759 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:01,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, 1, 1, 1] [2020-01-16 19:11:01,759 INFO L426 AbstractCegarLoop]: === Iteration 1831 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:01,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:01,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1502837946, now seen corresponding path program 1825 times [2020-01-16 19:11:01,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:01,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514406049] [2020-01-16 19:11:01,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:02,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514406049] [2020-01-16 19:11:02,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:02,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:02,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784063735] [2020-01-16 19:11:02,014 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:02,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:02,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:02,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:02,015 INFO L87 Difference]: Start difference. First operand 370 states and 1265 transitions. Second operand 9 states. [2020-01-16 19:11:02,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:02,104 INFO L93 Difference]: Finished difference Result 614 states and 1799 transitions. [2020-01-16 19:11:02,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:02,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:02,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:02,106 INFO L225 Difference]: With dead ends: 614 [2020-01-16 19:11:02,106 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:11:02,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:02,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:11:02,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 380. [2020-01-16 19:11:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:11:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1294 transitions. [2020-01-16 19:11:02,115 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1294 transitions. Word has length 22 [2020-01-16 19:11:02,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:02,115 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1294 transitions. [2020-01-16 19:11:02,115 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:02,115 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1294 transitions. [2020-01-16 19:11:02,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:02,116 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:02,116 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:02,116 INFO L426 AbstractCegarLoop]: === Iteration 1832 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:02,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:02,116 INFO L82 PathProgramCache]: Analyzing trace with hash 87427940, now seen corresponding path program 1826 times [2020-01-16 19:11:02,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:02,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072012207] [2020-01-16 19:11:02,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:02,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-01-16 19:11:02,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072012207] [2020-01-16 19:11:02,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:02,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:02,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121899151] [2020-01-16 19:11:02,364 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:02,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:02,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:02,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:02,364 INFO L87 Difference]: Start difference. First operand 380 states and 1294 transitions. Second operand 9 states. [2020-01-16 19:11:02,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:02,472 INFO L93 Difference]: Finished difference Result 609 states and 1786 transitions. [2020-01-16 19:11:02,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:02,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:02,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:02,473 INFO L225 Difference]: With dead ends: 609 [2020-01-16 19:11:02,474 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:11:02,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:02,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:11:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 376. [2020-01-16 19:11:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:11:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1285 transitions. [2020-01-16 19:11:02,483 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1285 transitions. Word has length 22 [2020-01-16 19:11:02,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:02,483 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1285 transitions. [2020-01-16 19:11:02,483 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1285 transitions. [2020-01-16 19:11:02,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:02,484 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:02,484 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:02,484 INFO L426 AbstractCegarLoop]: === Iteration 1833 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:02,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:02,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1401925774, now seen corresponding path program 1827 times [2020-01-16 19:11:02,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:02,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602965018] [2020-01-16 19:11:02,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:02,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-01-16 19:11:02,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602965018] [2020-01-16 19:11:02,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:02,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:02,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732150150] [2020-01-16 19:11:02,736 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:02,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:02,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:02,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:02,737 INFO L87 Difference]: Start difference. First operand 376 states and 1285 transitions. Second operand 9 states. [2020-01-16 19:11:02,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:02,819 INFO L93 Difference]: Finished difference Result 612 states and 1791 transitions. [2020-01-16 19:11:02,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:02,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:02,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:02,821 INFO L225 Difference]: With dead ends: 612 [2020-01-16 19:11:02,821 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 19:11:02,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:02,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 19:11:02,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 379. [2020-01-16 19:11:02,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:11:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1289 transitions. [2020-01-16 19:11:02,830 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1289 transitions. Word has length 22 [2020-01-16 19:11:02,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:02,830 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1289 transitions. [2020-01-16 19:11:02,830 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1289 transitions. [2020-01-16 19:11:02,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:02,830 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:02,830 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:02,830 INFO L426 AbstractCegarLoop]: === Iteration 1834 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:02,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:02,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1275289400, now seen corresponding path program 1828 times [2020-01-16 19:11:02,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:02,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786549144] [2020-01-16 19:11:02,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:03,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-01-16 19:11:03,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786549144] [2020-01-16 19:11:03,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:03,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:03,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013591210] [2020-01-16 19:11:03,080 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:03,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:03,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:03,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:03,080 INFO L87 Difference]: Start difference. First operand 379 states and 1289 transitions. Second operand 9 states. [2020-01-16 19:11:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:03,182 INFO L93 Difference]: Finished difference Result 606 states and 1777 transitions. [2020-01-16 19:11:03,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:03,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:03,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:03,184 INFO L225 Difference]: With dead ends: 606 [2020-01-16 19:11:03,184 INFO L226 Difference]: Without dead ends: 593 [2020-01-16 19:11:03,184 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:03,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-01-16 19:11:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 376. [2020-01-16 19:11:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:11:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1282 transitions. [2020-01-16 19:11:03,193 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1282 transitions. Word has length 22 [2020-01-16 19:11:03,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:03,193 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1282 transitions. [2020-01-16 19:11:03,193 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1282 transitions. [2020-01-16 19:11:03,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:03,193 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:03,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, 1, 1, 1] [2020-01-16 19:11:03,194 INFO L426 AbstractCegarLoop]: === Iteration 1835 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:03,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:03,194 INFO L82 PathProgramCache]: Analyzing trace with hash 604659728, now seen corresponding path program 1829 times [2020-01-16 19:11:03,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:03,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129021925] [2020-01-16 19:11:03,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:03,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129021925] [2020-01-16 19:11:03,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:03,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:03,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881268390] [2020-01-16 19:11:03,449 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:03,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:03,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:03,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:03,449 INFO L87 Difference]: Start difference. First operand 376 states and 1282 transitions. Second operand 9 states. [2020-01-16 19:11:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:03,555 INFO L93 Difference]: Finished difference Result 601 states and 1768 transitions. [2020-01-16 19:11:03,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:03,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:03,557 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:11:03,557 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 19:11:03,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 19:11:03,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 378. [2020-01-16 19:11:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:11:03,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1285 transitions. [2020-01-16 19:11:03,567 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1285 transitions. Word has length 22 [2020-01-16 19:11:03,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:03,567 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1285 transitions. [2020-01-16 19:11:03,567 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1285 transitions. [2020-01-16 19:11:03,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:03,568 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:03,568 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:03,568 INFO L426 AbstractCegarLoop]: === Iteration 1836 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:03,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:03,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1946592516, now seen corresponding path program 1830 times [2020-01-16 19:11:03,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:03,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343514801] [2020-01-16 19:11:03,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:03,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:03,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343514801] [2020-01-16 19:11:03,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:03,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:03,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680201441] [2020-01-16 19:11:03,827 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:03,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:03,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:03,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:03,827 INFO L87 Difference]: Start difference. First operand 378 states and 1285 transitions. Second operand 9 states. [2020-01-16 19:11:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:03,925 INFO L93 Difference]: Finished difference Result 600 states and 1764 transitions. [2020-01-16 19:11:03,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:03,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:03,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:03,926 INFO L225 Difference]: With dead ends: 600 [2020-01-16 19:11:03,926 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 19:11:03,927 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:03,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 19:11:03,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 373. [2020-01-16 19:11:03,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:11:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1275 transitions. [2020-01-16 19:11:03,936 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1275 transitions. Word has length 22 [2020-01-16 19:11:03,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:03,936 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1275 transitions. [2020-01-16 19:11:03,936 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1275 transitions. [2020-01-16 19:11:03,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:03,936 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:03,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, 1, 1, 1] [2020-01-16 19:11:03,937 INFO L426 AbstractCegarLoop]: === Iteration 1837 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:03,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:03,937 INFO L82 PathProgramCache]: Analyzing trace with hash 609590684, now seen corresponding path program 1831 times [2020-01-16 19:11:03,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:03,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081784385] [2020-01-16 19:11:03,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:04,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-01-16 19:11:04,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081784385] [2020-01-16 19:11:04,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:04,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:04,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106158971] [2020-01-16 19:11:04,191 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:04,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:04,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:04,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:04,192 INFO L87 Difference]: Start difference. First operand 373 states and 1275 transitions. Second operand 9 states. [2020-01-16 19:11:04,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:04,283 INFO L93 Difference]: Finished difference Result 618 states and 1808 transitions. [2020-01-16 19:11:04,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:04,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:04,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:04,285 INFO L225 Difference]: With dead ends: 618 [2020-01-16 19:11:04,285 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:11:04,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:04,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:11:04,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 381. [2020-01-16 19:11:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:11:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1295 transitions. [2020-01-16 19:11:04,294 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1295 transitions. Word has length 22 [2020-01-16 19:11:04,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:04,294 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1295 transitions. [2020-01-16 19:11:04,295 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:04,295 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1295 transitions. [2020-01-16 19:11:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:04,295 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:04,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, 1, 1, 1] [2020-01-16 19:11:04,295 INFO L426 AbstractCegarLoop]: === Iteration 1838 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:04,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:04,295 INFO L82 PathProgramCache]: Analyzing trace with hash -2095110726, now seen corresponding path program 1832 times [2020-01-16 19:11:04,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:04,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046862875] [2020-01-16 19:11:04,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:04,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:04,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046862875] [2020-01-16 19:11:04,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:04,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:04,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400523681] [2020-01-16 19:11:04,546 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:04,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:04,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:04,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:04,546 INFO L87 Difference]: Start difference. First operand 381 states and 1295 transitions. Second operand 9 states. [2020-01-16 19:11:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:04,665 INFO L93 Difference]: Finished difference Result 613 states and 1795 transitions. [2020-01-16 19:11:04,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:04,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:04,667 INFO L225 Difference]: With dead ends: 613 [2020-01-16 19:11:04,667 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:11:04,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:04,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:11:04,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 377. [2020-01-16 19:11:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:11:04,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1285 transitions. [2020-01-16 19:11:04,676 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1285 transitions. Word has length 22 [2020-01-16 19:11:04,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:04,676 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1285 transitions. [2020-01-16 19:11:04,676 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:04,676 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1285 transitions. [2020-01-16 19:11:04,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:04,677 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:04,677 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:04,677 INFO L426 AbstractCegarLoop]: === Iteration 1839 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:04,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:04,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1942153612, now seen corresponding path program 1833 times [2020-01-16 19:11:04,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:04,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901733010] [2020-01-16 19:11:04,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:04,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901733010] [2020-01-16 19:11:04,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:04,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:04,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141016965] [2020-01-16 19:11:04,937 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:04,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:04,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:04,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:04,937 INFO L87 Difference]: Start difference. First operand 377 states and 1285 transitions. Second operand 9 states. [2020-01-16 19:11:05,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:05,024 INFO L93 Difference]: Finished difference Result 614 states and 1800 transitions. [2020-01-16 19:11:05,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:05,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:05,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:05,025 INFO L225 Difference]: With dead ends: 614 [2020-01-16 19:11:05,025 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:11:05,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:05,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:11:05,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 383. [2020-01-16 19:11:05,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:11:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1295 transitions. [2020-01-16 19:11:05,034 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1295 transitions. Word has length 22 [2020-01-16 19:11:05,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:05,035 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1295 transitions. [2020-01-16 19:11:05,035 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:05,035 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1295 transitions. [2020-01-16 19:11:05,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:05,035 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:05,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, 1, 1, 1] [2020-01-16 19:11:05,035 INFO L426 AbstractCegarLoop]: === Iteration 1840 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:05,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:05,036 INFO L82 PathProgramCache]: Analyzing trace with hash 351053584, now seen corresponding path program 1834 times [2020-01-16 19:11:05,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:05,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682558561] [2020-01-16 19:11:05,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:05,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-01-16 19:11:05,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682558561] [2020-01-16 19:11:05,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:05,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:05,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158499315] [2020-01-16 19:11:05,290 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:05,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:05,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:05,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:05,291 INFO L87 Difference]: Start difference. First operand 383 states and 1295 transitions. Second operand 9 states. [2020-01-16 19:11:05,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:05,409 INFO L93 Difference]: Finished difference Result 602 states and 1781 transitions. [2020-01-16 19:11:05,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:05,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:05,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:05,410 INFO L225 Difference]: With dead ends: 602 [2020-01-16 19:11:05,411 INFO L226 Difference]: Without dead ends: 583 [2020-01-16 19:11:05,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:05,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-01-16 19:11:05,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 377. [2020-01-16 19:11:05,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:11:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1281 transitions. [2020-01-16 19:11:05,419 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1281 transitions. Word has length 22 [2020-01-16 19:11:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:05,420 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1281 transitions. [2020-01-16 19:11:05,420 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1281 transitions. [2020-01-16 19:11:05,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:05,420 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:05,420 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:05,420 INFO L426 AbstractCegarLoop]: === Iteration 1841 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:05,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:05,421 INFO L82 PathProgramCache]: Analyzing trace with hash 726857198, now seen corresponding path program 1835 times [2020-01-16 19:11:05,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:05,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134211854] [2020-01-16 19:11:05,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:05,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:05,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134211854] [2020-01-16 19:11:05,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:05,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:05,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931838635] [2020-01-16 19:11:05,667 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:05,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:05,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:05,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:05,668 INFO L87 Difference]: Start difference. First operand 377 states and 1281 transitions. Second operand 9 states. [2020-01-16 19:11:05,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:05,773 INFO L93 Difference]: Finished difference Result 606 states and 1779 transitions. [2020-01-16 19:11:05,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:05,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:05,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:05,775 INFO L225 Difference]: With dead ends: 606 [2020-01-16 19:11:05,775 INFO L226 Difference]: Without dead ends: 595 [2020-01-16 19:11:05,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-01-16 19:11:05,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 380. [2020-01-16 19:11:05,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:11:05,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1286 transitions. [2020-01-16 19:11:05,784 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1286 transitions. Word has length 22 [2020-01-16 19:11:05,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:05,785 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1286 transitions. [2020-01-16 19:11:05,785 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1286 transitions. [2020-01-16 19:11:05,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:05,785 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:05,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, 1, 1, 1] [2020-01-16 19:11:05,785 INFO L426 AbstractCegarLoop]: === Iteration 1842 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:05,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:05,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1839062764, now seen corresponding path program 1836 times [2020-01-16 19:11:05,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:05,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114955911] [2020-01-16 19:11:05,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:06,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114955911] [2020-01-16 19:11:06,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:06,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:06,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586651785] [2020-01-16 19:11:06,037 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:06,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:06,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:06,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:06,038 INFO L87 Difference]: Start difference. First operand 380 states and 1286 transitions. Second operand 9 states. [2020-01-16 19:11:06,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:06,153 INFO L93 Difference]: Finished difference Result 599 states and 1772 transitions. [2020-01-16 19:11:06,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:06,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:06,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:06,154 INFO L225 Difference]: With dead ends: 599 [2020-01-16 19:11:06,155 INFO L226 Difference]: Without dead ends: 579 [2020-01-16 19:11:06,155 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:06,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-01-16 19:11:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 373. [2020-01-16 19:11:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:11:06,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-01-16 19:11:06,163 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-01-16 19:11:06,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:06,163 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-01-16 19:11:06,163 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:06,163 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-01-16 19:11:06,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:06,164 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:06,164 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:06,164 INFO L426 AbstractCegarLoop]: === Iteration 1843 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:06,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:06,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2097297108, now seen corresponding path program 1837 times [2020-01-16 19:11:06,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:06,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713998793] [2020-01-16 19:11:06,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:06,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-01-16 19:11:06,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713998793] [2020-01-16 19:11:06,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:06,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:06,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534343903] [2020-01-16 19:11:06,413 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:06,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:06,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:06,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:06,414 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-01-16 19:11:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:06,486 INFO L93 Difference]: Finished difference Result 613 states and 1791 transitions. [2020-01-16 19:11:06,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:06,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:06,488 INFO L225 Difference]: With dead ends: 613 [2020-01-16 19:11:06,488 INFO L226 Difference]: Without dead ends: 597 [2020-01-16 19:11:06,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:06,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-01-16 19:11:06,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 379. [2020-01-16 19:11:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:11:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1286 transitions. [2020-01-16 19:11:06,498 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1286 transitions. Word has length 22 [2020-01-16 19:11:06,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:06,498 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1286 transitions. [2020-01-16 19:11:06,498 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:06,498 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1286 transitions. [2020-01-16 19:11:06,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:06,498 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:06,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:06,499 INFO L426 AbstractCegarLoop]: === Iteration 1844 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:06,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:06,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1970660734, now seen corresponding path program 1838 times [2020-01-16 19:11:06,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:06,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886648143] [2020-01-16 19:11:06,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:06,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-01-16 19:11:06,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886648143] [2020-01-16 19:11:06,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:06,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:06,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997287919] [2020-01-16 19:11:06,749 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:06,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:06,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:06,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:06,750 INFO L87 Difference]: Start difference. First operand 379 states and 1286 transitions. Second operand 9 states. [2020-01-16 19:11:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:06,874 INFO L93 Difference]: Finished difference Result 607 states and 1777 transitions. [2020-01-16 19:11:06,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:06,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:06,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:06,876 INFO L225 Difference]: With dead ends: 607 [2020-01-16 19:11:06,876 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:11:06,876 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:06,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:11:06,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 376. [2020-01-16 19:11:06,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:11:06,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1279 transitions. [2020-01-16 19:11:06,885 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1279 transitions. Word has length 22 [2020-01-16 19:11:06,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:06,886 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1279 transitions. [2020-01-16 19:11:06,886 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:06,886 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1279 transitions. [2020-01-16 19:11:06,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:06,886 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:06,886 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:06,886 INFO L426 AbstractCegarLoop]: === Iteration 1845 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:06,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:06,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1562067306, now seen corresponding path program 1839 times [2020-01-16 19:11:06,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:06,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917090957] [2020-01-16 19:11:06,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:07,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917090957] [2020-01-16 19:11:07,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:07,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:07,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452434113] [2020-01-16 19:11:07,146 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:07,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:07,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:07,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:07,146 INFO L87 Difference]: Start difference. First operand 376 states and 1279 transitions. Second operand 9 states. [2020-01-16 19:11:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:07,229 INFO L93 Difference]: Finished difference Result 611 states and 1789 transitions. [2020-01-16 19:11:07,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:07,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:07,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:07,231 INFO L225 Difference]: With dead ends: 611 [2020-01-16 19:11:07,231 INFO L226 Difference]: Without dead ends: 595 [2020-01-16 19:11:07,232 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:07,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-01-16 19:11:07,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 382. [2020-01-16 19:11:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:11:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1289 transitions. [2020-01-16 19:11:07,241 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1289 transitions. Word has length 22 [2020-01-16 19:11:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:07,241 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1289 transitions. [2020-01-16 19:11:07,241 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1289 transitions. [2020-01-16 19:11:07,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:07,242 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:07,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, 1, 1, 1] [2020-01-16 19:11:07,242 INFO L426 AbstractCegarLoop]: === Iteration 1846 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:07,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:07,242 INFO L82 PathProgramCache]: Analyzing trace with hash -815636380, now seen corresponding path program 1840 times [2020-01-16 19:11:07,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:07,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973501607] [2020-01-16 19:11:07,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:07,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-01-16 19:11:07,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973501607] [2020-01-16 19:11:07,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:07,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:07,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296374737] [2020-01-16 19:11:07,495 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:07,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:07,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:07,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:07,495 INFO L87 Difference]: Start difference. First operand 382 states and 1289 transitions. Second operand 9 states. [2020-01-16 19:11:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:07,622 INFO L93 Difference]: Finished difference Result 599 states and 1770 transitions. [2020-01-16 19:11:07,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:07,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:07,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:07,624 INFO L225 Difference]: With dead ends: 599 [2020-01-16 19:11:07,624 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:11:07,624 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:07,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:11:07,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 376. [2020-01-16 19:11:07,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:11:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1276 transitions. [2020-01-16 19:11:07,633 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1276 transitions. Word has length 22 [2020-01-16 19:11:07,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:07,633 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1276 transitions. [2020-01-16 19:11:07,633 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:07,634 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1276 transitions. [2020-01-16 19:11:07,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:07,634 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:07,634 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:07,634 INFO L426 AbstractCegarLoop]: === Iteration 1847 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:07,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:07,634 INFO L82 PathProgramCache]: Analyzing trace with hash 713365604, now seen corresponding path program 1841 times [2020-01-16 19:11:07,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:07,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840211940] [2020-01-16 19:11:07,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:07,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840211940] [2020-01-16 19:11:07,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:07,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:07,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751393475] [2020-01-16 19:11:07,888 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:07,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:07,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:07,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:07,888 INFO L87 Difference]: Start difference. First operand 376 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:11:08,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:08,017 INFO L93 Difference]: Finished difference Result 601 states and 1764 transitions. [2020-01-16 19:11:08,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:08,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:08,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:08,018 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:11:08,018 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 19:11:08,019 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:08,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 19:11:08,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 378. [2020-01-16 19:11:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:11:08,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1279 transitions. [2020-01-16 19:11:08,026 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1279 transitions. Word has length 22 [2020-01-16 19:11:08,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:08,027 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1279 transitions. [2020-01-16 19:11:08,027 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:08,027 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1279 transitions. [2020-01-16 19:11:08,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:08,027 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:08,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, 1, 1, 1] [2020-01-16 19:11:08,027 INFO L426 AbstractCegarLoop]: === Iteration 1848 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:08,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:08,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1284820410, now seen corresponding path program 1842 times [2020-01-16 19:11:08,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:08,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724217179] [2020-01-16 19:11:08,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11: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-01-16 19:11:08,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724217179] [2020-01-16 19:11:08,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:08,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:08,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649109085] [2020-01-16 19:11:08,283 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:08,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:08,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:08,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:08,283 INFO L87 Difference]: Start difference. First operand 378 states and 1279 transitions. Second operand 9 states. [2020-01-16 19:11:08,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:08,413 INFO L93 Difference]: Finished difference Result 595 states and 1760 transitions. [2020-01-16 19:11:08,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:08,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:08,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:08,414 INFO L225 Difference]: With dead ends: 595 [2020-01-16 19:11:08,414 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:11:08,415 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:08,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:11:08,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 373. [2020-01-16 19:11:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:11:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1269 transitions. [2020-01-16 19:11:08,424 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1269 transitions. Word has length 22 [2020-01-16 19:11:08,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:08,424 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1269 transitions. [2020-01-16 19:11:08,424 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:08,424 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1269 transitions. [2020-01-16 19:11:08,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:08,425 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:08,425 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:08,425 INFO L426 AbstractCegarLoop]: === Iteration 1849 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:08,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:08,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1003379982, now seen corresponding path program 1843 times [2020-01-16 19:11:08,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:08,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692132189] [2020-01-16 19:11:08,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:08,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692132189] [2020-01-16 19:11:08,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:08,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:08,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368513819] [2020-01-16 19:11:08,683 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:08,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:08,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:08,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:08,683 INFO L87 Difference]: Start difference. First operand 373 states and 1269 transitions. Second operand 9 states. [2020-01-16 19:11:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:08,812 INFO L93 Difference]: Finished difference Result 593 states and 1748 transitions. [2020-01-16 19:11:08,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:08,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:08,814 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:11:08,814 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 19:11:08,814 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 19:11:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 377. [2020-01-16 19:11:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:11:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1279 transitions. [2020-01-16 19:11:08,823 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1279 transitions. Word has length 22 [2020-01-16 19:11:08,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:08,823 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1279 transitions. [2020-01-16 19:11:08,823 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:08,823 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1279 transitions. [2020-01-16 19:11:08,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:08,823 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:08,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, 1, 1, 1] [2020-01-16 19:11:08,824 INFO L426 AbstractCegarLoop]: === Iteration 1850 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:08,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:08,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1949654526, now seen corresponding path program 1844 times [2020-01-16 19:11:08,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:08,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772596380] [2020-01-16 19:11:08,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:09,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-01-16 19:11:09,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772596380] [2020-01-16 19:11:09,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:09,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:09,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483118926] [2020-01-16 19:11:09,077 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:09,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:09,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:09,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:09,078 INFO L87 Difference]: Start difference. First operand 377 states and 1279 transitions. Second operand 9 states. [2020-01-16 19:11:09,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:09,208 INFO L93 Difference]: Finished difference Result 592 states and 1744 transitions. [2020-01-16 19:11:09,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:09,209 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:09,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:09,210 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:11:09,210 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 19:11:09,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:09,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 19:11:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 375. [2020-01-16 19:11:09,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:11:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1274 transitions. [2020-01-16 19:11:09,219 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1274 transitions. Word has length 22 [2020-01-16 19:11:09,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:09,219 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1274 transitions. [2020-01-16 19:11:09,219 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1274 transitions. [2020-01-16 19:11:09,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:09,220 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:09,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, 1, 1, 1] [2020-01-16 19:11:09,220 INFO L426 AbstractCegarLoop]: === Iteration 1851 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:09,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:09,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1538609784, now seen corresponding path program 1845 times [2020-01-16 19:11:09,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:09,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412265704] [2020-01-16 19:11:09,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:09,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:09,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412265704] [2020-01-16 19:11:09,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:09,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:09,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252011446] [2020-01-16 19:11:09,467 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:09,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:09,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:09,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:09,468 INFO L87 Difference]: Start difference. First operand 375 states and 1274 transitions. Second operand 9 states. [2020-01-16 19:11:09,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:09,595 INFO L93 Difference]: Finished difference Result 594 states and 1750 transitions. [2020-01-16 19:11:09,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:09,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:09,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:09,596 INFO L225 Difference]: With dead ends: 594 [2020-01-16 19:11:09,597 INFO L226 Difference]: Without dead ends: 583 [2020-01-16 19:11:09,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:09,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-01-16 19:11:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 378. [2020-01-16 19:11:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:11:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1279 transitions. [2020-01-16 19:11:09,605 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1279 transitions. Word has length 22 [2020-01-16 19:11:09,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:09,605 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1279 transitions. [2020-01-16 19:11:09,606 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:09,606 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1279 transitions. [2020-01-16 19:11:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:09,606 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:09,606 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:09,606 INFO L426 AbstractCegarLoop]: === Iteration 1852 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:09,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:09,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1310220776, now seen corresponding path program 1846 times [2020-01-16 19:11:09,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:09,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740540136] [2020-01-16 19:11:09,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:09,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740540136] [2020-01-16 19:11:09,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:09,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:09,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203863694] [2020-01-16 19:11:09,854 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:09,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:09,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:09,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:09,854 INFO L87 Difference]: Start difference. First operand 378 states and 1279 transitions. Second operand 9 states. [2020-01-16 19:11:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:09,980 INFO L93 Difference]: Finished difference Result 587 states and 1743 transitions. [2020-01-16 19:11:09,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:09,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:09,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:09,982 INFO L225 Difference]: With dead ends: 587 [2020-01-16 19:11:09,982 INFO L226 Difference]: Without dead ends: 571 [2020-01-16 19:11:09,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:09,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-01-16 19:11:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 375. [2020-01-16 19:11:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:11:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1272 transitions. [2020-01-16 19:11:09,992 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1272 transitions. Word has length 22 [2020-01-16 19:11:09,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:09,992 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1272 transitions. [2020-01-16 19:11:09,992 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:09,992 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1272 transitions. [2020-01-16 19:11:09,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:09,993 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:09,993 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:09,993 INFO L426 AbstractCegarLoop]: === Iteration 1853 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:09,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:09,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1807457192, now seen corresponding path program 1847 times [2020-01-16 19:11:09,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:09,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240756222] [2020-01-16 19:11:09,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:10,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-01-16 19:11:10,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240756222] [2020-01-16 19:11:10,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:10,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:10,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337781319] [2020-01-16 19:11:10,241 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:10,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:10,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:10,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:10,242 INFO L87 Difference]: Start difference. First operand 375 states and 1272 transitions. Second operand 9 states. [2020-01-16 19:11:10,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:10,370 INFO L93 Difference]: Finished difference Result 592 states and 1743 transitions. [2020-01-16 19:11:10,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:10,371 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:10,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:10,372 INFO L225 Difference]: With dead ends: 592 [2020-01-16 19:11:10,372 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 19:11:10,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 19:11:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 377. [2020-01-16 19:11:10,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:11:10,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1275 transitions. [2020-01-16 19:11:10,382 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1275 transitions. Word has length 22 [2020-01-16 19:11:10,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:10,382 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1275 transitions. [2020-01-16 19:11:10,382 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:10,382 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1275 transitions. [2020-01-16 19:11:10,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:10,382 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:10,382 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:10,382 INFO L426 AbstractCegarLoop]: === Iteration 1854 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:10,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:10,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1916055298, now seen corresponding path program 1848 times [2020-01-16 19:11:10,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:10,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995317711] [2020-01-16 19:11:10,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:10,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995317711] [2020-01-16 19:11:10,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:10,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:10,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778953804] [2020-01-16 19:11:10,633 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:10,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:10,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:10,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:10,633 INFO L87 Difference]: Start difference. First operand 377 states and 1275 transitions. Second operand 9 states. [2020-01-16 19:11:10,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:10,761 INFO L93 Difference]: Finished difference Result 586 states and 1739 transitions. [2020-01-16 19:11:10,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:10,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:10,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:10,763 INFO L225 Difference]: With dead ends: 586 [2020-01-16 19:11:10,763 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:11:10,763 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:10,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:11:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 370. [2020-01-16 19:11:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-01-16 19:11:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1262 transitions. [2020-01-16 19:11:10,772 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1262 transitions. Word has length 22 [2020-01-16 19:11:10,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:10,772 INFO L478 AbstractCegarLoop]: Abstraction has 370 states and 1262 transitions. [2020-01-16 19:11:10,772 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:10,772 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1262 transitions. [2020-01-16 19:11:10,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:10,773 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:10,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, 1, 1, 1] [2020-01-16 19:11:10,773 INFO L426 AbstractCegarLoop]: === Iteration 1855 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:10,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:10,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1989957178, now seen corresponding path program 1849 times [2020-01-16 19:11:10,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:10,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037409607] [2020-01-16 19:11:10,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:11,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-01-16 19:11:11,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037409607] [2020-01-16 19:11:11,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:11,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:11,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099653148] [2020-01-16 19:11:11,049 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:11,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:11,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:11,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:11,049 INFO L87 Difference]: Start difference. First operand 370 states and 1262 transitions. Second operand 9 states. [2020-01-16 19:11:11,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:11,141 INFO L93 Difference]: Finished difference Result 627 states and 1839 transitions. [2020-01-16 19:11:11,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:11,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:11,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:11,142 INFO L225 Difference]: With dead ends: 627 [2020-01-16 19:11:11,143 INFO L226 Difference]: Without dead ends: 611 [2020-01-16 19:11:11,143 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:11,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-01-16 19:11:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 382. [2020-01-16 19:11:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:11:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1300 transitions. [2020-01-16 19:11:11,152 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1300 transitions. Word has length 22 [2020-01-16 19:11:11,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:11,152 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1300 transitions. [2020-01-16 19:11:11,153 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1300 transitions. [2020-01-16 19:11:11,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:11,153 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:11,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, 1, 1, 1] [2020-01-16 19:11:11,153 INFO L426 AbstractCegarLoop]: === Iteration 1856 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:11,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:11,153 INFO L82 PathProgramCache]: Analyzing trace with hash -399691292, now seen corresponding path program 1850 times [2020-01-16 19:11:11,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:11,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628162030] [2020-01-16 19:11:11,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:11,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-01-16 19:11:11,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628162030] [2020-01-16 19:11:11,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:11,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:11,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336064257] [2020-01-16 19:11:11,428 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:11,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:11,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:11,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:11,428 INFO L87 Difference]: Start difference. First operand 382 states and 1300 transitions. Second operand 9 states. [2020-01-16 19:11:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:11,557 INFO L93 Difference]: Finished difference Result 622 states and 1826 transitions. [2020-01-16 19:11:11,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:11,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:11,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:11,559 INFO L225 Difference]: With dead ends: 622 [2020-01-16 19:11:11,559 INFO L226 Difference]: Without dead ends: 607 [2020-01-16 19:11:11,559 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:11,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2020-01-16 19:11:11,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 378. [2020-01-16 19:11:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:11:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1290 transitions. [2020-01-16 19:11:11,569 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1290 transitions. Word has length 22 [2020-01-16 19:11:11,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:11,569 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1290 transitions. [2020-01-16 19:11:11,569 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1290 transitions. [2020-01-16 19:11:11,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:11,570 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:11,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, 1, 1, 1] [2020-01-16 19:11:11,570 INFO L426 AbstractCegarLoop]: === Iteration 1857 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:11,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:11,570 INFO L82 PathProgramCache]: Analyzing trace with hash 956333366, now seen corresponding path program 1851 times [2020-01-16 19:11:11,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:11,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637945461] [2020-01-16 19:11:11,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:11,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-01-16 19:11:11,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637945461] [2020-01-16 19:11:11,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:11,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:11,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576496207] [2020-01-16 19:11:11,858 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:11,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:11,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:11,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:11,859 INFO L87 Difference]: Start difference. First operand 378 states and 1290 transitions. Second operand 9 states. [2020-01-16 19:11:11,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:11,959 INFO L93 Difference]: Finished difference Result 629 states and 1840 transitions. [2020-01-16 19:11:11,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:11,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:11,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:11,961 INFO L225 Difference]: With dead ends: 629 [2020-01-16 19:11:11,961 INFO L226 Difference]: Without dead ends: 613 [2020-01-16 19:11:11,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:11,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-01-16 19:11:11,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 383. [2020-01-16 19:11:11,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:11:11,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1298 transitions. [2020-01-16 19:11:11,969 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1298 transitions. Word has length 22 [2020-01-16 19:11:11,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:11,969 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1298 transitions. [2020-01-16 19:11:11,969 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1298 transitions. [2020-01-16 19:11:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:11,970 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:11,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, 1, 1, 1] [2020-01-16 19:11:11,970 INFO L426 AbstractCegarLoop]: === Iteration 1858 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:11,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:11,970 INFO L82 PathProgramCache]: Analyzing trace with hash -744994536, now seen corresponding path program 1852 times [2020-01-16 19:11:11,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:11,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023054539] [2020-01-16 19:11:11,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:12,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-01-16 19:11:12,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023054539] [2020-01-16 19:11:12,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:12,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:12,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705321381] [2020-01-16 19:11:12,244 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:12,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:12,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:12,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:12,244 INFO L87 Difference]: Start difference. First operand 383 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:11:12,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:12,373 INFO L93 Difference]: Finished difference Result 625 states and 1828 transitions. [2020-01-16 19:11:12,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:12,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:12,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:12,375 INFO L225 Difference]: With dead ends: 625 [2020-01-16 19:11:12,375 INFO L226 Difference]: Without dead ends: 608 [2020-01-16 19:11:12,375 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:12,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-01-16 19:11:12,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 378. [2020-01-16 19:11:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:11:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1286 transitions. [2020-01-16 19:11:12,385 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1286 transitions. Word has length 22 [2020-01-16 19:11:12,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:12,385 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1286 transitions. [2020-01-16 19:11:12,385 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:12,385 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1286 transitions. [2020-01-16 19:11:12,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:12,385 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:12,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, 1, 1, 1] [2020-01-16 19:11:12,386 INFO L426 AbstractCegarLoop]: === Iteration 1859 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:12,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:12,386 INFO L82 PathProgramCache]: Analyzing trace with hash -258963048, now seen corresponding path program 1853 times [2020-01-16 19:11:12,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:12,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308033212] [2020-01-16 19:11:12,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:12,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-01-16 19:11:12,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308033212] [2020-01-16 19:11:12,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:12,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:12,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497351832] [2020-01-16 19:11:12,656 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:12,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:12,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:12,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:12,656 INFO L87 Difference]: Start difference. First operand 378 states and 1286 transitions. Second operand 9 states. [2020-01-16 19:11:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:12,784 INFO L93 Difference]: Finished difference Result 617 states and 1813 transitions. [2020-01-16 19:11:12,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:12,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:12,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:12,786 INFO L225 Difference]: With dead ends: 617 [2020-01-16 19:11:12,786 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 19:11:12,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 19:11:12,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 381. [2020-01-16 19:11:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:11:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1291 transitions. [2020-01-16 19:11:12,796 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1291 transitions. Word has length 22 [2020-01-16 19:11:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:12,796 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1291 transitions. [2020-01-16 19:11:12,796 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1291 transitions. [2020-01-16 19:11:12,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:12,797 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:12,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, 1, 1, 1] [2020-01-16 19:11:12,797 INFO L426 AbstractCegarLoop]: === Iteration 1860 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:12,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:12,797 INFO L82 PathProgramCache]: Analyzing trace with hash 614777632, now seen corresponding path program 1854 times [2020-01-16 19:11:12,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:12,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887711470] [2020-01-16 19:11:12,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:13,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887711470] [2020-01-16 19:11:13,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:13,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:13,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612871207] [2020-01-16 19:11:13,076 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:13,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:13,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:13,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:13,076 INFO L87 Difference]: Start difference. First operand 381 states and 1291 transitions. Second operand 9 states. [2020-01-16 19:11:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:13,188 INFO L93 Difference]: Finished difference Result 618 states and 1812 transitions. [2020-01-16 19:11:13,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:13,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:13,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:13,190 INFO L225 Difference]: With dead ends: 618 [2020-01-16 19:11:13,190 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 19:11:13,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:13,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 19:11:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 374. [2020-01-16 19:11:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:11:13,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1276 transitions. [2020-01-16 19:11:13,199 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1276 transitions. Word has length 22 [2020-01-16 19:11:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:13,199 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1276 transitions. [2020-01-16 19:11:13,200 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:13,200 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1276 transitions. [2020-01-16 19:11:13,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:13,200 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:13,200 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:13,200 INFO L426 AbstractCegarLoop]: === Iteration 1861 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:13,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:13,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1882524392, now seen corresponding path program 1855 times [2020-01-16 19:11:13,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:13,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815488732] [2020-01-16 19:11:13,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:13,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-01-16 19:11:13,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815488732] [2020-01-16 19:11:13,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:13,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:13,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269911441] [2020-01-16 19:11:13,466 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:13,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:13,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:13,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:13,466 INFO L87 Difference]: Start difference. First operand 374 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:11:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:13,558 INFO L93 Difference]: Finished difference Result 621 states and 1816 transitions. [2020-01-16 19:11:13,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:13,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:13,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:13,560 INFO L225 Difference]: With dead ends: 621 [2020-01-16 19:11:13,560 INFO L226 Difference]: Without dead ends: 605 [2020-01-16 19:11:13,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:13,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-01-16 19:11:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 382. [2020-01-16 19:11:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:11:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1296 transitions. [2020-01-16 19:11:13,569 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1296 transitions. Word has length 22 [2020-01-16 19:11:13,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:13,569 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1296 transitions. [2020-01-16 19:11:13,569 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:13,569 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1296 transitions. [2020-01-16 19:11:13,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:13,570 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:13,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, 1, 1, 1] [2020-01-16 19:11:13,570 INFO L426 AbstractCegarLoop]: === Iteration 1862 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:13,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:13,570 INFO L82 PathProgramCache]: Analyzing trace with hash -822177018, now seen corresponding path program 1856 times [2020-01-16 19:11:13,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:13,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910425251] [2020-01-16 19:11:13,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:13,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-01-16 19:11:13,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910425251] [2020-01-16 19:11:13,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:13,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:13,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033505438] [2020-01-16 19:11:13,836 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:13,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:13,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:13,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:13,836 INFO L87 Difference]: Start difference. First operand 382 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:11:13,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:13,963 INFO L93 Difference]: Finished difference Result 616 states and 1803 transitions. [2020-01-16 19:11:13,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:13,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:13,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:13,965 INFO L225 Difference]: With dead ends: 616 [2020-01-16 19:11:13,965 INFO L226 Difference]: Without dead ends: 601 [2020-01-16 19:11:13,965 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:13,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-01-16 19:11:13,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 378. [2020-01-16 19:11:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:11:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1286 transitions. [2020-01-16 19:11:13,975 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1286 transitions. Word has length 22 [2020-01-16 19:11:13,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:13,975 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1286 transitions. [2020-01-16 19:11:13,975 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1286 transitions. [2020-01-16 19:11:13,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:13,976 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:13,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, 1, 1, 1] [2020-01-16 19:11:13,976 INFO L426 AbstractCegarLoop]: === Iteration 1863 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:13,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:13,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1079879976, now seen corresponding path program 1857 times [2020-01-16 19:11:13,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:13,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241344053] [2020-01-16 19:11:13,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:14,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241344053] [2020-01-16 19:11:14,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:14,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:14,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499596125] [2020-01-16 19:11:14,248 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:14,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:14,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:14,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:14,248 INFO L87 Difference]: Start difference. First operand 378 states and 1286 transitions. Second operand 9 states. [2020-01-16 19:11:14,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:14,351 INFO L93 Difference]: Finished difference Result 617 states and 1808 transitions. [2020-01-16 19:11:14,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:14,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:14,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:14,353 INFO L225 Difference]: With dead ends: 617 [2020-01-16 19:11:14,353 INFO L226 Difference]: Without dead ends: 601 [2020-01-16 19:11:14,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:14,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-01-16 19:11:14,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 384. [2020-01-16 19:11:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:11:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1296 transitions. [2020-01-16 19:11:14,363 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1296 transitions. Word has length 22 [2020-01-16 19:11:14,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:14,363 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1296 transitions. [2020-01-16 19:11:14,363 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:14,363 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1296 transitions. [2020-01-16 19:11:14,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:14,364 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:14,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:14,364 INFO L426 AbstractCegarLoop]: === Iteration 1864 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:14,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:14,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1623987292, now seen corresponding path program 1858 times [2020-01-16 19:11:14,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:14,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278304984] [2020-01-16 19:11:14,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:14,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-01-16 19:11:14,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278304984] [2020-01-16 19:11:14,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:14,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:14,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108274993] [2020-01-16 19:11:14,626 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:14,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:14,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:14,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:14,626 INFO L87 Difference]: Start difference. First operand 384 states and 1296 transitions. Second operand 9 states. [2020-01-16 19:11:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:14,735 INFO L93 Difference]: Finished difference Result 605 states and 1789 transitions. [2020-01-16 19:11:14,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:14,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:14,737 INFO L225 Difference]: With dead ends: 605 [2020-01-16 19:11:14,737 INFO L226 Difference]: Without dead ends: 586 [2020-01-16 19:11:14,737 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:14,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-01-16 19:11:14,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 378. [2020-01-16 19:11:14,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:11:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1282 transitions. [2020-01-16 19:11:14,747 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1282 transitions. Word has length 22 [2020-01-16 19:11:14,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:14,747 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1282 transitions. [2020-01-16 19:11:14,747 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:14,747 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1282 transitions. [2020-01-16 19:11:14,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:14,748 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:14,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, 1, 1, 1] [2020-01-16 19:11:14,748 INFO L426 AbstractCegarLoop]: === Iteration 1865 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:14,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:14,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1999790906, now seen corresponding path program 1859 times [2020-01-16 19:11:14,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:14,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517039020] [2020-01-16 19:11:14,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:15,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:15,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517039020] [2020-01-16 19:11:15,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:15,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:15,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893969737] [2020-01-16 19:11:15,011 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:15,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:15,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:15,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:15,011 INFO L87 Difference]: Start difference. First operand 378 states and 1282 transitions. Second operand 9 states. [2020-01-16 19:11:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:15,139 INFO L93 Difference]: Finished difference Result 609 states and 1787 transitions. [2020-01-16 19:11:15,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:15,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:15,141 INFO L225 Difference]: With dead ends: 609 [2020-01-16 19:11:15,141 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:11:15,141 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:15,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:11:15,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 381. [2020-01-16 19:11:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:11:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1287 transitions. [2020-01-16 19:11:15,153 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1287 transitions. Word has length 22 [2020-01-16 19:11:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:15,153 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1287 transitions. [2020-01-16 19:11:15,153 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1287 transitions. [2020-01-16 19:11:15,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:15,154 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:15,154 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:15,154 INFO L426 AbstractCegarLoop]: === Iteration 1866 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:15,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:15,155 INFO L82 PathProgramCache]: Analyzing trace with hash -566129056, now seen corresponding path program 1860 times [2020-01-16 19:11:15,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:15,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179021149] [2020-01-16 19:11:15,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:15,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179021149] [2020-01-16 19:11:15,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:15,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:15,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770277876] [2020-01-16 19:11:15,447 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:15,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:15,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:15,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:15,447 INFO L87 Difference]: Start difference. First operand 381 states and 1287 transitions. Second operand 9 states. [2020-01-16 19:11:15,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:15,575 INFO L93 Difference]: Finished difference Result 602 states and 1780 transitions. [2020-01-16 19:11:15,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:15,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:15,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:15,577 INFO L225 Difference]: With dead ends: 602 [2020-01-16 19:11:15,577 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 19:11:15,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:15,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 19:11:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 374. [2020-01-16 19:11:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:11:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1272 transitions. [2020-01-16 19:11:15,585 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1272 transitions. Word has length 22 [2020-01-16 19:11:15,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:15,585 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1272 transitions. [2020-01-16 19:11:15,585 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1272 transitions. [2020-01-16 19:11:15,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:15,586 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:15,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, 1, 1, 1] [2020-01-16 19:11:15,586 INFO L426 AbstractCegarLoop]: === Iteration 1867 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:15,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:15,586 INFO L82 PathProgramCache]: Analyzing trace with hash -683888826, now seen corresponding path program 1861 times [2020-01-16 19:11:15,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:15,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744755] [2020-01-16 19:11:15,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:15,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-01-16 19:11:15,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744755] [2020-01-16 19:11:15,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:15,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:15,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748466841] [2020-01-16 19:11:15,861 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:15,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:15,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:15,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:15,861 INFO L87 Difference]: Start difference. First operand 374 states and 1272 transitions. Second operand 9 states. [2020-01-16 19:11:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:15,966 INFO L93 Difference]: Finished difference Result 618 states and 1812 transitions. [2020-01-16 19:11:15,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:15,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:15,968 INFO L225 Difference]: With dead ends: 618 [2020-01-16 19:11:15,968 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 19:11:15,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 19:11:15,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 384. [2020-01-16 19:11:15,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:11:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1298 transitions. [2020-01-16 19:11:15,977 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1298 transitions. Word has length 22 [2020-01-16 19:11:15,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:15,978 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1298 transitions. [2020-01-16 19:11:15,978 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1298 transitions. [2020-01-16 19:11:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:15,978 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:15,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, 1, 1, 1] [2020-01-16 19:11:15,978 INFO L426 AbstractCegarLoop]: === Iteration 1868 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:15,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:15,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1909750568, now seen corresponding path program 1862 times [2020-01-16 19:11:15,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:15,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565693808] [2020-01-16 19:11:15,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:16,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-01-16 19:11:16,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565693808] [2020-01-16 19:11:16,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:16,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:16,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821753844] [2020-01-16 19:11:16,247 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:16,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:16,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:16,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:16,248 INFO L87 Difference]: Start difference. First operand 384 states and 1298 transitions. Second operand 9 states. [2020-01-16 19:11:16,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:16,378 INFO L93 Difference]: Finished difference Result 614 states and 1800 transitions. [2020-01-16 19:11:16,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:16,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:16,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:16,380 INFO L225 Difference]: With dead ends: 614 [2020-01-16 19:11:16,380 INFO L226 Difference]: Without dead ends: 597 [2020-01-16 19:11:16,380 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-01-16 19:11:16,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 379. [2020-01-16 19:11:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:11:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1285 transitions. [2020-01-16 19:11:16,390 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1285 transitions. Word has length 22 [2020-01-16 19:11:16,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:16,390 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1285 transitions. [2020-01-16 19:11:16,390 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:16,390 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1285 transitions. [2020-01-16 19:11:16,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:16,390 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:16,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, 1, 1, 1] [2020-01-16 19:11:16,391 INFO L426 AbstractCegarLoop]: === Iteration 1869 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:16,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:16,391 INFO L82 PathProgramCache]: Analyzing trace with hash 60813672, now seen corresponding path program 1863 times [2020-01-16 19:11:16,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:16,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966303847] [2020-01-16 19:11:16,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:16,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-01-16 19:11:16,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966303847] [2020-01-16 19:11:16,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:16,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:16,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942587180] [2020-01-16 19:11:16,669 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:16,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:16,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:16,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:16,670 INFO L87 Difference]: Start difference. First operand 379 states and 1285 transitions. Second operand 9 states. [2020-01-16 19:11:16,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:16,752 INFO L93 Difference]: Finished difference Result 606 states and 1782 transitions. [2020-01-16 19:11:16,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:16,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:16,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:16,754 INFO L225 Difference]: With dead ends: 606 [2020-01-16 19:11:16,754 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 19:11:16,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 19:11:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 385. [2020-01-16 19:11:16,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-01-16 19:11:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1295 transitions. [2020-01-16 19:11:16,762 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1295 transitions. Word has length 22 [2020-01-16 19:11:16,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:16,762 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 1295 transitions. [2020-01-16 19:11:16,762 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:16,763 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1295 transitions. [2020-01-16 19:11:16,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:16,763 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:16,763 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:16,763 INFO L426 AbstractCegarLoop]: === Iteration 1870 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:16,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:16,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1530286356, now seen corresponding path program 1864 times [2020-01-16 19:11:16,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:16,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634098011] [2020-01-16 19:11:16,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:17,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-01-16 19:11:17,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634098011] [2020-01-16 19:11:17,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:17,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:17,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544109984] [2020-01-16 19:11:17,038 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:17,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:17,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:17,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:17,038 INFO L87 Difference]: Start difference. First operand 385 states and 1295 transitions. Second operand 9 states. [2020-01-16 19:11:17,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:17,170 INFO L93 Difference]: Finished difference Result 594 states and 1763 transitions. [2020-01-16 19:11:17,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:17,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:17,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:17,171 INFO L225 Difference]: With dead ends: 594 [2020-01-16 19:11:17,172 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:11:17,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:17,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:11:17,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 379. [2020-01-16 19:11:17,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:11:17,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1280 transitions. [2020-01-16 19:11:17,180 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1280 transitions. Word has length 22 [2020-01-16 19:11:17,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:17,180 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1280 transitions. [2020-01-16 19:11:17,180 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1280 transitions. [2020-01-16 19:11:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:17,181 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:17,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, 1, 1, 1] [2020-01-16 19:11:17,181 INFO L426 AbstractCegarLoop]: === Iteration 1871 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:17,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:17,181 INFO L82 PathProgramCache]: Analyzing trace with hash 759660260, now seen corresponding path program 1865 times [2020-01-16 19:11:17,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:17,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62746194] [2020-01-16 19:11:17,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:17,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-01-16 19:11:17,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62746194] [2020-01-16 19:11:17,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:17,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:17,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634714920] [2020-01-16 19:11:17,455 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:17,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:17,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:17,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:17,456 INFO L87 Difference]: Start difference. First operand 379 states and 1280 transitions. Second operand 9 states. [2020-01-16 19:11:17,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:17,573 INFO L93 Difference]: Finished difference Result 591 states and 1757 transitions. [2020-01-16 19:11:17,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:17,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:17,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:17,574 INFO L225 Difference]: With dead ends: 591 [2020-01-16 19:11:17,575 INFO L226 Difference]: Without dead ends: 579 [2020-01-16 19:11:17,575 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-01-16 19:11:17,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 383. [2020-01-16 19:11:17,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:11:17,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1287 transitions. [2020-01-16 19:11:17,585 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1287 transitions. Word has length 22 [2020-01-16 19:11:17,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:17,586 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1287 transitions. [2020-01-16 19:11:17,586 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1287 transitions. [2020-01-16 19:11:17,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:17,586 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:17,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, 1, 1, 1] [2020-01-16 19:11:17,587 INFO L426 AbstractCegarLoop]: === Iteration 1872 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:17,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:17,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1618534790, now seen corresponding path program 1866 times [2020-01-16 19:11:17,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:17,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445612675] [2020-01-16 19:11:17,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:17,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-01-16 19:11:17,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445612675] [2020-01-16 19:11:17,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:17,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:17,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246137846] [2020-01-16 19:11:17,859 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:17,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:17,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:17,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:17,859 INFO L87 Difference]: Start difference. First operand 383 states and 1287 transitions. Second operand 9 states. [2020-01-16 19:11:17,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:17,989 INFO L93 Difference]: Finished difference Result 578 states and 1738 transitions. [2020-01-16 19:11:17,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:17,990 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:17,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:17,991 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:11:17,991 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:11:17,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:17,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:11:18,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 374. [2020-01-16 19:11:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:11:18,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1268 transitions. [2020-01-16 19:11:18,000 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1268 transitions. Word has length 22 [2020-01-16 19:11:18,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:18,001 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1268 transitions. [2020-01-16 19:11:18,001 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:18,001 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1268 transitions. [2020-01-16 19:11:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:18,001 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:18,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, 1, 1, 1] [2020-01-16 19:11:18,001 INFO L426 AbstractCegarLoop]: === Iteration 1873 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:18,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:18,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1322696676, now seen corresponding path program 1867 times [2020-01-16 19:11:18,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:18,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123296224] [2020-01-16 19:11:18,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:18,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-01-16 19:11:18,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123296224] [2020-01-16 19:11:18,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:18,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:18,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887312027] [2020-01-16 19:11:18,274 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:18,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:18,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:18,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:18,274 INFO L87 Difference]: Start difference. First operand 374 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:11:18,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:18,382 INFO L93 Difference]: Finished difference Result 601 states and 1770 transitions. [2020-01-16 19:11:18,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:18,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:18,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:18,384 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:11:18,384 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 19:11:18,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 19:11:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 380. [2020-01-16 19:11:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:11:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1284 transitions. [2020-01-16 19:11:18,393 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1284 transitions. Word has length 22 [2020-01-16 19:11:18,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:18,393 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1284 transitions. [2020-01-16 19:11:18,394 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1284 transitions. [2020-01-16 19:11:18,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:18,394 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:18,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:18,394 INFO L426 AbstractCegarLoop]: === Iteration 1874 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:18,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:18,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2098529940, now seen corresponding path program 1868 times [2020-01-16 19:11:18,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:18,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199913764] [2020-01-16 19:11:18,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:18,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-01-16 19:11:18,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199913764] [2020-01-16 19:11:18,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:18,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:18,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556121298] [2020-01-16 19:11:18,670 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:18,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:18,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:18,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:18,671 INFO L87 Difference]: Start difference. First operand 380 states and 1284 transitions. Second operand 9 states. [2020-01-16 19:11:18,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:18,801 INFO L93 Difference]: Finished difference Result 602 states and 1769 transitions. [2020-01-16 19:11:18,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:18,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:18,802 INFO L225 Difference]: With dead ends: 602 [2020-01-16 19:11:18,802 INFO L226 Difference]: Without dead ends: 587 [2020-01-16 19:11:18,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:18,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-01-16 19:11:18,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 377. [2020-01-16 19:11:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:11:18,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1276 transitions. [2020-01-16 19:11:18,812 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1276 transitions. Word has length 22 [2020-01-16 19:11:18,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:18,812 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1276 transitions. [2020-01-16 19:11:18,812 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1276 transitions. [2020-01-16 19:11:18,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:18,813 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:18,813 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:18,813 INFO L426 AbstractCegarLoop]: === Iteration 1875 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:18,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:18,813 INFO L82 PathProgramCache]: Analyzing trace with hash 2067399174, now seen corresponding path program 1869 times [2020-01-16 19:11:18,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:18,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413298464] [2020-01-16 19:11:18,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:19,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-01-16 19:11:19,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413298464] [2020-01-16 19:11:19,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:19,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:19,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936154123] [2020-01-16 19:11:19,097 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:19,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:19,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:19,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:19,097 INFO L87 Difference]: Start difference. First operand 377 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:11:19,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:19,216 INFO L93 Difference]: Finished difference Result 596 states and 1756 transitions. [2020-01-16 19:11:19,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:19,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:19,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:19,218 INFO L225 Difference]: With dead ends: 596 [2020-01-16 19:11:19,218 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 19:11:19,218 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 19:11:19,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 380. [2020-01-16 19:11:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:11:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1281 transitions. [2020-01-16 19:11:19,227 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1281 transitions. Word has length 22 [2020-01-16 19:11:19,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:19,227 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1281 transitions. [2020-01-16 19:11:19,227 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1281 transitions. [2020-01-16 19:11:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:19,228 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:19,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, 1, 1, 1] [2020-01-16 19:11:19,228 INFO L426 AbstractCegarLoop]: === Iteration 1876 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:19,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:19,228 INFO L82 PathProgramCache]: Analyzing trace with hash -498520788, now seen corresponding path program 1870 times [2020-01-16 19:11:19,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:19,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744049280] [2020-01-16 19:11:19,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:19,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:19,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744049280] [2020-01-16 19:11:19,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:19,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:19,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419379769] [2020-01-16 19:11:19,496 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:19,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:19,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:19,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:19,497 INFO L87 Difference]: Start difference. First operand 380 states and 1281 transitions. Second operand 9 states. [2020-01-16 19:11:19,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:19,624 INFO L93 Difference]: Finished difference Result 589 states and 1749 transitions. [2020-01-16 19:11:19,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:19,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:19,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:19,626 INFO L225 Difference]: With dead ends: 589 [2020-01-16 19:11:19,626 INFO L226 Difference]: Without dead ends: 573 [2020-01-16 19:11:19,626 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:19,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-01-16 19:11:19,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 377. [2020-01-16 19:11:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:11:19,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1273 transitions. [2020-01-16 19:11:19,635 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1273 transitions. Word has length 22 [2020-01-16 19:11:19,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:19,635 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1273 transitions. [2020-01-16 19:11:19,635 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1273 transitions. [2020-01-16 19:11:19,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:19,636 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:19,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, 1, 1, 1] [2020-01-16 19:11:19,636 INFO L426 AbstractCegarLoop]: === Iteration 1877 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:19,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:19,636 INFO L82 PathProgramCache]: Analyzing trace with hash -37670138, now seen corresponding path program 1871 times [2020-01-16 19:11:19,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:19,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731860710] [2020-01-16 19:11:19,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:19,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731860710] [2020-01-16 19:11:19,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:19,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:19,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730742923] [2020-01-16 19:11:19,906 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:19,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:19,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:19,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:19,907 INFO L87 Difference]: Start difference. First operand 377 states and 1273 transitions. Second operand 9 states. [2020-01-16 19:11:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:20,034 INFO L93 Difference]: Finished difference Result 589 states and 1750 transitions. [2020-01-16 19:11:20,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:20,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:20,035 INFO L225 Difference]: With dead ends: 589 [2020-01-16 19:11:20,036 INFO L226 Difference]: Without dead ends: 577 [2020-01-16 19:11:20,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:20,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-01-16 19:11:20,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 381. [2020-01-16 19:11:20,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:11:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1280 transitions. [2020-01-16 19:11:20,045 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1280 transitions. Word has length 22 [2020-01-16 19:11:20,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:20,046 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1280 transitions. [2020-01-16 19:11:20,046 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:20,046 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1280 transitions. [2020-01-16 19:11:20,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:20,046 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:20,046 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:20,046 INFO L426 AbstractCegarLoop]: === Iteration 1878 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:20,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:20,047 INFO L82 PathProgramCache]: Analyzing trace with hash 817636516, now seen corresponding path program 1872 times [2020-01-16 19:11:20,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:20,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038067833] [2020-01-16 19:11:20,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:20,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038067833] [2020-01-16 19:11:20,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:20,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:20,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668779471] [2020-01-16 19:11:20,321 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:20,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:20,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:20,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:20,322 INFO L87 Difference]: Start difference. First operand 381 states and 1280 transitions. Second operand 9 states. [2020-01-16 19:11:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:20,448 INFO L93 Difference]: Finished difference Result 576 states and 1731 transitions. [2020-01-16 19:11:20,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:20,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:20,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:20,450 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:11:20,450 INFO L226 Difference]: Without dead ends: 552 [2020-01-16 19:11:20,450 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:20,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-01-16 19:11:20,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 370. [2020-01-16 19:11:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-01-16 19:11:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1259 transitions. [2020-01-16 19:11:20,460 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1259 transitions. Word has length 22 [2020-01-16 19:11:20,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:20,460 INFO L478 AbstractCegarLoop]: Abstraction has 370 states and 1259 transitions. [2020-01-16 19:11:20,460 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:20,460 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1259 transitions. [2020-01-16 19:11:20,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:20,460 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:20,460 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:20,460 INFO L426 AbstractCegarLoop]: === Iteration 1879 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:20,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:20,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1869926862, now seen corresponding path program 1873 times [2020-01-16 19:11:20,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:20,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861430802] [2020-01-16 19:11:20,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:20,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-01-16 19:11:20,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861430802] [2020-01-16 19:11:20,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:20,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:20,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929994679] [2020-01-16 19:11:20,715 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:20,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:20,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:20,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:20,715 INFO L87 Difference]: Start difference. First operand 370 states and 1259 transitions. Second operand 9 states. [2020-01-16 19:11:20,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:20,818 INFO L93 Difference]: Finished difference Result 615 states and 1798 transitions. [2020-01-16 19:11:20,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:20,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:20,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:20,819 INFO L225 Difference]: With dead ends: 615 [2020-01-16 19:11:20,820 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 19:11:20,820 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:20,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 19:11:20,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 379. [2020-01-16 19:11:20,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:11:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1286 transitions. [2020-01-16 19:11:20,828 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1286 transitions. Word has length 22 [2020-01-16 19:11:20,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:20,828 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1286 transitions. [2020-01-16 19:11:20,828 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1286 transitions. [2020-01-16 19:11:20,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:20,829 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:20,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, 1, 1, 1] [2020-01-16 19:11:20,829 INFO L426 AbstractCegarLoop]: === Iteration 1880 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:20,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:20,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1743290488, now seen corresponding path program 1874 times [2020-01-16 19:11:20,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:20,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308493178] [2020-01-16 19:11:20,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:21,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-01-16 19:11:21,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308493178] [2020-01-16 19:11:21,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:21,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:21,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388853478] [2020-01-16 19:11:21,087 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:21,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:21,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:21,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:21,088 INFO L87 Difference]: Start difference. First operand 379 states and 1286 transitions. Second operand 9 states. [2020-01-16 19:11:21,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:21,216 INFO L93 Difference]: Finished difference Result 609 states and 1784 transitions. [2020-01-16 19:11:21,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:21,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:21,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:21,218 INFO L225 Difference]: With dead ends: 609 [2020-01-16 19:11:21,218 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 19:11:21,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:21,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 19:11:21,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 376. [2020-01-16 19:11:21,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:11:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1279 transitions. [2020-01-16 19:11:21,228 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1279 transitions. Word has length 22 [2020-01-16 19:11:21,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:21,228 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1279 transitions. [2020-01-16 19:11:21,228 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:21,228 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1279 transitions. [2020-01-16 19:11:21,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:21,229 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:21,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, 1, 1, 1] [2020-01-16 19:11:21,229 INFO L426 AbstractCegarLoop]: === Iteration 1881 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:21,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:21,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1349329278, now seen corresponding path program 1875 times [2020-01-16 19:11:21,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:21,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262033334] [2020-01-16 19:11:21,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:21,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262033334] [2020-01-16 19:11:21,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:21,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:21,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370793716] [2020-01-16 19:11:21,490 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:21,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:21,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:21,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:21,490 INFO L87 Difference]: Start difference. First operand 376 states and 1279 transitions. Second operand 9 states. [2020-01-16 19:11:21,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:21,594 INFO L93 Difference]: Finished difference Result 619 states and 1805 transitions. [2020-01-16 19:11:21,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:21,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:21,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:21,596 INFO L225 Difference]: With dead ends: 619 [2020-01-16 19:11:21,596 INFO L226 Difference]: Without dead ends: 603 [2020-01-16 19:11:21,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:21,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-01-16 19:11:21,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 381. [2020-01-16 19:11:21,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-01-16 19:11:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1287 transitions. [2020-01-16 19:11:21,606 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1287 transitions. Word has length 22 [2020-01-16 19:11:21,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:21,606 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 1287 transitions. [2020-01-16 19:11:21,606 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1287 transitions. [2020-01-16 19:11:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:21,606 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:21,607 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:21,607 INFO L426 AbstractCegarLoop]: === Iteration 1882 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:21,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:21,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1240829832, now seen corresponding path program 1876 times [2020-01-16 19:11:21,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:21,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363963848] [2020-01-16 19:11:21,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:21,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363963848] [2020-01-16 19:11:21,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:21,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:21,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382917671] [2020-01-16 19:11:21,867 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:21,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:21,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:21,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:21,867 INFO L87 Difference]: Start difference. First operand 381 states and 1287 transitions. Second operand 9 states. [2020-01-16 19:11:21,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:21,997 INFO L93 Difference]: Finished difference Result 615 states and 1793 transitions. [2020-01-16 19:11:21,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:21,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:21,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:21,999 INFO L225 Difference]: With dead ends: 615 [2020-01-16 19:11:21,999 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 19:11:21,999 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:22,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 19:11:22,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 376. [2020-01-16 19:11:22,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:11:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1276 transitions. [2020-01-16 19:11:22,008 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1276 transitions. Word has length 22 [2020-01-16 19:11:22,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:22,009 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1276 transitions. [2020-01-16 19:11:22,009 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:22,009 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1276 transitions. [2020-01-16 19:11:22,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:22,009 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:22,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, 1, 1, 1] [2020-01-16 19:11:22,009 INFO L426 AbstractCegarLoop]: === Iteration 1883 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:22,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:22,010 INFO L82 PathProgramCache]: Analyzing trace with hash -670205108, now seen corresponding path program 1877 times [2020-01-16 19:11:22,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:22,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411912763] [2020-01-16 19:11:22,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:22,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411912763] [2020-01-16 19:11:22,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:22,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:22,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850105920] [2020-01-16 19:11:22,266 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:22,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:22,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:22,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:22,266 INFO L87 Difference]: Start difference. First operand 376 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:11:22,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:22,392 INFO L93 Difference]: Finished difference Result 604 states and 1772 transitions. [2020-01-16 19:11:22,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:22,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:22,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:22,394 INFO L225 Difference]: With dead ends: 604 [2020-01-16 19:11:22,394 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 19:11:22,394 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:22,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 19:11:22,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 378. [2020-01-16 19:11:22,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:11:22,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1279 transitions. [2020-01-16 19:11:22,402 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1279 transitions. Word has length 22 [2020-01-16 19:11:22,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:22,403 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1279 transitions. [2020-01-16 19:11:22,403 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:22,403 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1279 transitions. [2020-01-16 19:11:22,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:22,403 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:22,403 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:22,403 INFO L426 AbstractCegarLoop]: === Iteration 1884 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:22,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:22,404 INFO L82 PathProgramCache]: Analyzing trace with hash -843452800, now seen corresponding path program 1878 times [2020-01-16 19:11:22,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:22,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038850186] [2020-01-16 19:11:22,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:22,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038850186] [2020-01-16 19:11:22,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:22,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:22,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15308618] [2020-01-16 19:11:22,653 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:22,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:22,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:22,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:22,653 INFO L87 Difference]: Start difference. First operand 378 states and 1279 transitions. Second operand 9 states. [2020-01-16 19:11:22,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:22,789 INFO L93 Difference]: Finished difference Result 606 states and 1774 transitions. [2020-01-16 19:11:22,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:22,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:22,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:22,791 INFO L225 Difference]: With dead ends: 606 [2020-01-16 19:11:22,791 INFO L226 Difference]: Without dead ends: 589 [2020-01-16 19:11:22,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:22,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-01-16 19:11:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 373. [2020-01-16 19:11:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:11:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1269 transitions. [2020-01-16 19:11:22,799 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1269 transitions. Word has length 22 [2020-01-16 19:11:22,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:22,800 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1269 transitions. [2020-01-16 19:11:22,800 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:22,800 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1269 transitions. [2020-01-16 19:11:22,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:22,800 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:22,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, 1, 1, 1] [2020-01-16 19:11:22,800 INFO L426 AbstractCegarLoop]: === Iteration 1885 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:22,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:22,801 INFO L82 PathProgramCache]: Analyzing trace with hash 824602580, now seen corresponding path program 1879 times [2020-01-16 19:11:22,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:22,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521401511] [2020-01-16 19:11:22,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:23,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521401511] [2020-01-16 19:11:23,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:23,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:23,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625686312] [2020-01-16 19:11:23,043 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:23,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:23,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:23,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:23,043 INFO L87 Difference]: Start difference. First operand 373 states and 1269 transitions. Second operand 9 states. [2020-01-16 19:11:23,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:23,146 INFO L93 Difference]: Finished difference Result 611 states and 1783 transitions. [2020-01-16 19:11:23,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:23,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:23,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:23,148 INFO L225 Difference]: With dead ends: 611 [2020-01-16 19:11:23,148 INFO L226 Difference]: Without dead ends: 595 [2020-01-16 19:11:23,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:23,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2020-01-16 19:11:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 379. [2020-01-16 19:11:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:11:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1283 transitions. [2020-01-16 19:11:23,158 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1283 transitions. Word has length 22 [2020-01-16 19:11:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:23,158 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1283 transitions. [2020-01-16 19:11:23,158 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1283 transitions. [2020-01-16 19:11:23,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:23,158 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:23,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, 1, 1, 1] [2020-01-16 19:11:23,159 INFO L426 AbstractCegarLoop]: === Iteration 1886 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:23,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:23,159 INFO L82 PathProgramCache]: Analyzing trace with hash 951238954, now seen corresponding path program 1880 times [2020-01-16 19:11:23,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:23,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570790487] [2020-01-16 19:11:23,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:23,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-01-16 19:11:23,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570790487] [2020-01-16 19:11:23,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:23,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:23,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546613270] [2020-01-16 19:11:23,399 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:23,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:23,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:23,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:23,399 INFO L87 Difference]: Start difference. First operand 379 states and 1283 transitions. Second operand 9 states. [2020-01-16 19:11:23,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:23,528 INFO L93 Difference]: Finished difference Result 605 states and 1769 transitions. [2020-01-16 19:11:23,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:23,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:23,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:23,529 INFO L225 Difference]: With dead ends: 605 [2020-01-16 19:11:23,530 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 19:11:23,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:23,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 19:11:23,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 376. [2020-01-16 19:11:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:11:23,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1276 transitions. [2020-01-16 19:11:23,538 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1276 transitions. Word has length 22 [2020-01-16 19:11:23,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:23,539 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1276 transitions. [2020-01-16 19:11:23,539 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:23,539 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1276 transitions. [2020-01-16 19:11:23,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:23,539 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:23,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, 1, 1, 1] [2020-01-16 19:11:23,539 INFO L426 AbstractCegarLoop]: === Iteration 1887 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:23,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:23,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1359832382, now seen corresponding path program 1881 times [2020-01-16 19:11:23,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:23,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741294670] [2020-01-16 19:11:23,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:23,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:23,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741294670] [2020-01-16 19:11:23,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:23,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:23,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144122162] [2020-01-16 19:11:23,794 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:23,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:23,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:23,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:23,795 INFO L87 Difference]: Start difference. First operand 376 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:11:23,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:23,899 INFO L93 Difference]: Finished difference Result 609 states and 1781 transitions. [2020-01-16 19:11:23,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:23,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:23,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:23,901 INFO L225 Difference]: With dead ends: 609 [2020-01-16 19:11:23,901 INFO L226 Difference]: Without dead ends: 593 [2020-01-16 19:11:23,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:23,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-01-16 19:11:23,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 382. [2020-01-16 19:11:23,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:11:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1286 transitions. [2020-01-16 19:11:23,911 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1286 transitions. Word has length 22 [2020-01-16 19:11:23,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:23,911 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1286 transitions. [2020-01-16 19:11:23,911 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1286 transitions. [2020-01-16 19:11:23,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:23,911 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:23,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:23,912 INFO L426 AbstractCegarLoop]: === Iteration 1888 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:23,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:23,912 INFO L82 PathProgramCache]: Analyzing trace with hash 2106263308, now seen corresponding path program 1882 times [2020-01-16 19:11:23,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:23,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471311560] [2020-01-16 19:11:23,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:24,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471311560] [2020-01-16 19:11:24,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:24,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:24,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750884470] [2020-01-16 19:11:24,165 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:24,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:24,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:24,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:24,165 INFO L87 Difference]: Start difference. First operand 382 states and 1286 transitions. Second operand 9 states. [2020-01-16 19:11:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:24,293 INFO L93 Difference]: Finished difference Result 597 states and 1762 transitions. [2020-01-16 19:11:24,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:24,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:24,294 INFO L225 Difference]: With dead ends: 597 [2020-01-16 19:11:24,294 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:11:24,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:11:24,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 376. [2020-01-16 19:11:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:11:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1273 transitions. [2020-01-16 19:11:24,303 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1273 transitions. Word has length 22 [2020-01-16 19:11:24,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:24,303 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1273 transitions. [2020-01-16 19:11:24,303 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:24,303 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1273 transitions. [2020-01-16 19:11:24,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:24,304 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:24,304 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:24,304 INFO L426 AbstractCegarLoop]: === Iteration 1889 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:24,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:24,304 INFO L82 PathProgramCache]: Analyzing trace with hash -659702004, now seen corresponding path program 1883 times [2020-01-16 19:11:24,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:24,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697065960] [2020-01-16 19:11:24,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:24,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:24,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697065960] [2020-01-16 19:11:24,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:24,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:24,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28141422] [2020-01-16 19:11:24,546 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:24,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:24,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:24,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:24,547 INFO L87 Difference]: Start difference. First operand 376 states and 1273 transitions. Second operand 9 states. [2020-01-16 19:11:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:24,675 INFO L93 Difference]: Finished difference Result 599 states and 1756 transitions. [2020-01-16 19:11:24,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:24,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:24,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:24,677 INFO L225 Difference]: With dead ends: 599 [2020-01-16 19:11:24,677 INFO L226 Difference]: Without dead ends: 589 [2020-01-16 19:11:24,677 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:24,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-01-16 19:11:24,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 378. [2020-01-16 19:11:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:11:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1276 transitions. [2020-01-16 19:11:24,687 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1276 transitions. Word has length 22 [2020-01-16 19:11:24,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:24,687 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1276 transitions. [2020-01-16 19:11:24,687 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:24,687 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1276 transitions. [2020-01-16 19:11:24,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:24,687 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:24,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, 1, 1, 1] [2020-01-16 19:11:24,688 INFO L426 AbstractCegarLoop]: === Iteration 1890 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:24,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:24,688 INFO L82 PathProgramCache]: Analyzing trace with hash -88247198, now seen corresponding path program 1884 times [2020-01-16 19:11:24,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:24,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369091203] [2020-01-16 19:11:24,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:24,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369091203] [2020-01-16 19:11:24,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:24,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:24,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102861386] [2020-01-16 19:11:24,933 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:24,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:24,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:24,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:24,934 INFO L87 Difference]: Start difference. First operand 378 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:11:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:25,050 INFO L93 Difference]: Finished difference Result 593 states and 1752 transitions. [2020-01-16 19:11:25,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:25,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:25,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:25,052 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:11:25,052 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 19:11:25,052 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:25,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 19:11:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 373. [2020-01-16 19:11:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:11:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-01-16 19:11:25,061 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-01-16 19:11:25,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:25,062 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-01-16 19:11:25,062 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:25,062 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-01-16 19:11:25,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:25,062 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:25,062 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:25,062 INFO L426 AbstractCegarLoop]: === Iteration 1891 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:25,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:25,063 INFO L82 PathProgramCache]: Analyzing trace with hash 761583956, now seen corresponding path program 1885 times [2020-01-16 19:11:25,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:25,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316822769] [2020-01-16 19:11:25,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:25,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-01-16 19:11:25,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316822769] [2020-01-16 19:11:25,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:25,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:25,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668074891] [2020-01-16 19:11:25,330 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:25,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:25,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:25,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:25,330 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:11:25,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:25,437 INFO L93 Difference]: Finished difference Result 613 states and 1794 transitions. [2020-01-16 19:11:25,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:25,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:25,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:25,439 INFO L225 Difference]: With dead ends: 613 [2020-01-16 19:11:25,439 INFO L226 Difference]: Without dead ends: 597 [2020-01-16 19:11:25,439 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:25,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-01-16 19:11:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 383. [2020-01-16 19:11:25,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-01-16 19:11:25,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1292 transitions. [2020-01-16 19:11:25,448 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1292 transitions. Word has length 22 [2020-01-16 19:11:25,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:25,448 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 1292 transitions. [2020-01-16 19:11:25,448 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:25,448 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1292 transitions. [2020-01-16 19:11:25,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:25,448 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:25,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, 1, 1, 1] [2020-01-16 19:11:25,449 INFO L426 AbstractCegarLoop]: === Iteration 1892 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:25,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:25,449 INFO L82 PathProgramCache]: Analyzing trace with hash 653084510, now seen corresponding path program 1886 times [2020-01-16 19:11:25,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:25,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584152736] [2020-01-16 19:11:25,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:25,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-01-16 19:11:25,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584152736] [2020-01-16 19:11:25,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:25,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:25,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398994306] [2020-01-16 19:11:25,709 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:25,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:25,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:25,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:25,710 INFO L87 Difference]: Start difference. First operand 383 states and 1292 transitions. Second operand 9 states. [2020-01-16 19:11:25,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:25,805 INFO L93 Difference]: Finished difference Result 609 states and 1782 transitions. [2020-01-16 19:11:25,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:25,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:25,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:25,807 INFO L225 Difference]: With dead ends: 609 [2020-01-16 19:11:25,807 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 19:11:25,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:25,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 19:11:25,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 378. [2020-01-16 19:11:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:11:25,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1279 transitions. [2020-01-16 19:11:25,817 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1279 transitions. Word has length 22 [2020-01-16 19:11:25,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:25,817 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1279 transitions. [2020-01-16 19:11:25,817 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:25,817 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1279 transitions. [2020-01-16 19:11:25,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:25,817 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:25,817 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:25,818 INFO L426 AbstractCegarLoop]: === Iteration 1893 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:25,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:25,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1922442382, now seen corresponding path program 1887 times [2020-01-16 19:11:25,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:25,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674698116] [2020-01-16 19:11:25,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:26,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-01-16 19:11:26,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674698116] [2020-01-16 19:11:26,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:26,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:26,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931539151] [2020-01-16 19:11:26,080 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:26,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:26,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:26,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:26,080 INFO L87 Difference]: Start difference. First operand 378 states and 1279 transitions. Second operand 9 states. [2020-01-16 19:11:26,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:26,156 INFO L93 Difference]: Finished difference Result 601 states and 1764 transitions. [2020-01-16 19:11:26,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:26,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:26,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:26,157 INFO L225 Difference]: With dead ends: 601 [2020-01-16 19:11:26,158 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 19:11:26,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:26,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 19:11:26,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 384. [2020-01-16 19:11:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-01-16 19:11:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1289 transitions. [2020-01-16 19:11:26,167 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1289 transitions. Word has length 22 [2020-01-16 19:11:26,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:26,167 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 1289 transitions. [2020-01-16 19:11:26,167 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1289 transitions. [2020-01-16 19:11:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:26,167 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:26,167 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:26,167 INFO L426 AbstractCegarLoop]: === Iteration 1894 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:26,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:26,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1176011456, now seen corresponding path program 1888 times [2020-01-16 19:11:26,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:26,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630273734] [2020-01-16 19:11:26,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:26,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:26,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630273734] [2020-01-16 19:11:26,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:26,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:26,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807296583] [2020-01-16 19:11:26,427 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:26,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:26,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:26,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:26,427 INFO L87 Difference]: Start difference. First operand 384 states and 1289 transitions. Second operand 9 states. [2020-01-16 19:11:26,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:26,530 INFO L93 Difference]: Finished difference Result 589 states and 1745 transitions. [2020-01-16 19:11:26,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:26,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:26,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:26,532 INFO L225 Difference]: With dead ends: 589 [2020-01-16 19:11:26,532 INFO L226 Difference]: Without dead ends: 570 [2020-01-16 19:11:26,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:26,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-01-16 19:11:26,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 378. [2020-01-16 19:11:26,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:11:26,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1274 transitions. [2020-01-16 19:11:26,540 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1274 transitions. Word has length 22 [2020-01-16 19:11:26,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:26,540 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1274 transitions. [2020-01-16 19:11:26,540 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:26,540 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1274 transitions. [2020-01-16 19:11:26,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:26,541 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:26,541 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:26,541 INFO L426 AbstractCegarLoop]: === Iteration 1895 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:26,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:26,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1047990256, now seen corresponding path program 1889 times [2020-01-16 19:11:26,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:26,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822778691] [2020-01-16 19:11:26,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:26,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:26,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822778691] [2020-01-16 19:11:26,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:26,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:26,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935439210] [2020-01-16 19:11:26,795 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:26,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:26,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:26,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:26,795 INFO L87 Difference]: Start difference. First operand 378 states and 1274 transitions. Second operand 9 states. [2020-01-16 19:11:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:26,891 INFO L93 Difference]: Finished difference Result 586 states and 1739 transitions. [2020-01-16 19:11:26,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:26,891 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:26,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:26,893 INFO L225 Difference]: With dead ends: 586 [2020-01-16 19:11:26,893 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 19:11:26,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:26,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 19:11:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 382. [2020-01-16 19:11:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-01-16 19:11:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1281 transitions. [2020-01-16 19:11:26,901 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1281 transitions. Word has length 22 [2020-01-16 19:11:26,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:26,901 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 1281 transitions. [2020-01-16 19:11:26,901 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:26,901 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1281 transitions. [2020-01-16 19:11:26,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:26,902 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:26,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, 1, 1, 1] [2020-01-16 19:11:26,902 INFO L426 AbstractCegarLoop]: === Iteration 1896 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:26,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:26,902 INFO L82 PathProgramCache]: Analyzing trace with hash -189115726, now seen corresponding path program 1890 times [2020-01-16 19:11:26,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:26,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989883791] [2020-01-16 19:11:26,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:27,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989883791] [2020-01-16 19:11:27,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:27,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:27,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725364558] [2020-01-16 19:11:27,159 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:27,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:27,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:27,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:27,160 INFO L87 Difference]: Start difference. First operand 382 states and 1281 transitions. Second operand 9 states. [2020-01-16 19:11:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:27,254 INFO L93 Difference]: Finished difference Result 573 states and 1720 transitions. [2020-01-16 19:11:27,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:27,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:27,256 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:11:27,256 INFO L226 Difference]: Without dead ends: 551 [2020-01-16 19:11:27,256 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:27,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-01-16 19:11:27,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 373. [2020-01-16 19:11:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:11:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1263 transitions. [2020-01-16 19:11:27,264 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1263 transitions. Word has length 22 [2020-01-16 19:11:27,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:27,264 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1263 transitions. [2020-01-16 19:11:27,264 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:27,264 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1263 transitions. [2020-01-16 19:11:27,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:27,265 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:27,265 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:27,265 INFO L426 AbstractCegarLoop]: === Iteration 1897 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:27,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:27,265 INFO L82 PathProgramCache]: Analyzing trace with hash 930232746, now seen corresponding path program 1891 times [2020-01-16 19:11:27,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:27,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710600065] [2020-01-16 19:11:27,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:27,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-01-16 19:11:27,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710600065] [2020-01-16 19:11:27,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:27,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:27,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466715681] [2020-01-16 19:11:27,523 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:27,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:27,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:27,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:27,524 INFO L87 Difference]: Start difference. First operand 373 states and 1263 transitions. Second operand 9 states. [2020-01-16 19:11:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:27,625 INFO L93 Difference]: Finished difference Result 591 states and 1739 transitions. [2020-01-16 19:11:27,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:27,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:27,626 INFO L225 Difference]: With dead ends: 591 [2020-01-16 19:11:27,626 INFO L226 Difference]: Without dead ends: 581 [2020-01-16 19:11:27,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-01-16 19:11:27,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 377. [2020-01-16 19:11:27,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:11:27,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1273 transitions. [2020-01-16 19:11:27,636 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1273 transitions. Word has length 22 [2020-01-16 19:11:27,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:27,636 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1273 transitions. [2020-01-16 19:11:27,636 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:27,636 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1273 transitions. [2020-01-16 19:11:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:27,636 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:27,637 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:27,637 INFO L426 AbstractCegarLoop]: === Iteration 1898 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:27,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:27,637 INFO L82 PathProgramCache]: Analyzing trace with hash 756985054, now seen corresponding path program 1892 times [2020-01-16 19:11:27,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:27,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843051073] [2020-01-16 19:11:27,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:27,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-01-16 19:11:27,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843051073] [2020-01-16 19:11:27,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:27,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:27,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750984959] [2020-01-16 19:11:27,885 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:27,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:27,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:27,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:27,886 INFO L87 Difference]: Start difference. First operand 377 states and 1273 transitions. Second operand 9 states. [2020-01-16 19:11:27,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:27,985 INFO L93 Difference]: Finished difference Result 593 states and 1741 transitions. [2020-01-16 19:11:27,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:27,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:27,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:27,987 INFO L225 Difference]: With dead ends: 593 [2020-01-16 19:11:27,987 INFO L226 Difference]: Without dead ends: 579 [2020-01-16 19:11:27,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:27,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-01-16 19:11:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 375. [2020-01-16 19:11:27,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:11:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1268 transitions. [2020-01-16 19:11:27,995 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1268 transitions. Word has length 22 [2020-01-16 19:11:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:27,996 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1268 transitions. [2020-01-16 19:11:27,996 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1268 transitions. [2020-01-16 19:11:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:27,996 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:27,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, 1, 1, 1] [2020-01-16 19:11:27,996 INFO L426 AbstractCegarLoop]: === Iteration 1899 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:27,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:27,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1753793592, now seen corresponding path program 1893 times [2020-01-16 19:11:27,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:27,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438465773] [2020-01-16 19:11:27,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:28,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-01-16 19:11:28,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438465773] [2020-01-16 19:11:28,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:28,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:28,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896643722] [2020-01-16 19:11:28,247 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:28,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:28,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:28,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:28,247 INFO L87 Difference]: Start difference. First operand 375 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:11:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:28,355 INFO L93 Difference]: Finished difference Result 588 states and 1731 transitions. [2020-01-16 19:11:28,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:28,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:28,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:28,357 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:11:28,357 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 19:11:28,357 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:28,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 19:11:28,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 377. [2020-01-16 19:11:28,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:11:28,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1271 transitions. [2020-01-16 19:11:28,365 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1271 transitions. Word has length 22 [2020-01-16 19:11:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:28,366 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1271 transitions. [2020-01-16 19:11:28,366 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:28,366 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1271 transitions. [2020-01-16 19:11:28,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:28,366 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:28,366 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:28,366 INFO L426 AbstractCegarLoop]: === Iteration 1900 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:28,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:28,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1182338786, now seen corresponding path program 1894 times [2020-01-16 19:11:28,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:28,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661114738] [2020-01-16 19:11:28,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:28,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661114738] [2020-01-16 19:11:28,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:28,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:28,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826877693] [2020-01-16 19:11:28,615 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:28,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:28,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:28,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:28,615 INFO L87 Difference]: Start difference. First operand 377 states and 1271 transitions. Second operand 9 states. [2020-01-16 19:11:28,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:28,715 INFO L93 Difference]: Finished difference Result 582 states and 1727 transitions. [2020-01-16 19:11:28,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:28,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:28,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:28,717 INFO L225 Difference]: With dead ends: 582 [2020-01-16 19:11:28,717 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 19:11:28,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:28,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 19:11:28,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 375. [2020-01-16 19:11:28,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:11:28,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1266 transitions. [2020-01-16 19:11:28,726 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1266 transitions. Word has length 22 [2020-01-16 19:11:28,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:28,726 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1266 transitions. [2020-01-16 19:11:28,726 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:28,727 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1266 transitions. [2020-01-16 19:11:28,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:28,727 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:28,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, 1, 1, 1] [2020-01-16 19:11:28,727 INFO L426 AbstractCegarLoop]: === Iteration 1901 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:28,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:28,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1292214856, now seen corresponding path program 1895 times [2020-01-16 19:11:28,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:28,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626480646] [2020-01-16 19:11:28,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:28,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-01-16 19:11:28,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626480646] [2020-01-16 19:11:28,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:28,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:28,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971457971] [2020-01-16 19:11:28,985 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:28,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:28,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:28,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:28,985 INFO L87 Difference]: Start difference. First operand 375 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:11:29,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:29,080 INFO L93 Difference]: Finished difference Result 583 states and 1731 transitions. [2020-01-16 19:11:29,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:29,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:29,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:29,082 INFO L225 Difference]: With dead ends: 583 [2020-01-16 19:11:29,082 INFO L226 Difference]: Without dead ends: 571 [2020-01-16 19:11:29,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-01-16 19:11:29,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 379. [2020-01-16 19:11:29,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:11:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1273 transitions. [2020-01-16 19:11:29,091 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1273 transitions. Word has length 22 [2020-01-16 19:11:29,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:29,092 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1273 transitions. [2020-01-16 19:11:29,092 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1273 transitions. [2020-01-16 19:11:29,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:29,092 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:29,092 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:29,092 INFO L426 AbstractCegarLoop]: === Iteration 1902 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:29,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:29,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2036917354, now seen corresponding path program 1896 times [2020-01-16 19:11:29,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:29,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433048659] [2020-01-16 19:11:29,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:29,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-01-16 19:11:29,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433048659] [2020-01-16 19:11:29,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:29,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:29,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795691517] [2020-01-16 19:11:29,351 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:29,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:29,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:29,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:29,351 INFO L87 Difference]: Start difference. First operand 379 states and 1273 transitions. Second operand 9 states. [2020-01-16 19:11:29,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:29,457 INFO L93 Difference]: Finished difference Result 570 states and 1712 transitions. [2020-01-16 19:11:29,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:29,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:29,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:29,459 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:11:29,459 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:11:29,459 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:29,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:11:29,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 370. [2020-01-16 19:11:29,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-01-16 19:11:29,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1256 transitions. [2020-01-16 19:11:29,468 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1256 transitions. Word has length 22 [2020-01-16 19:11:29,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:29,468 INFO L478 AbstractCegarLoop]: Abstraction has 370 states and 1256 transitions. [2020-01-16 19:11:29,469 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:29,469 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1256 transitions. [2020-01-16 19:11:29,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:29,469 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:29,469 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:29,469 INFO L426 AbstractCegarLoop]: === Iteration 1903 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:29,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:29,469 INFO L82 PathProgramCache]: Analyzing trace with hash 787851088, now seen corresponding path program 1897 times [2020-01-16 19:11:29,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:29,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213651790] [2020-01-16 19:11:29,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:29,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-01-16 19:11:29,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213651790] [2020-01-16 19:11:29,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:29,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:29,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274295153] [2020-01-16 19:11:29,744 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:29,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:29,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:29,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:29,745 INFO L87 Difference]: Start difference. First operand 370 states and 1256 transitions. Second operand 9 states. [2020-01-16 19:11:29,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:29,845 INFO L93 Difference]: Finished difference Result 581 states and 1720 transitions. [2020-01-16 19:11:29,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:29,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:29,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:29,847 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:11:29,847 INFO L226 Difference]: Without dead ends: 570 [2020-01-16 19:11:29,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-01-16 19:11:29,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 376. [2020-01-16 19:11:29,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:11:29,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1275 transitions. [2020-01-16 19:11:29,857 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1275 transitions. Word has length 22 [2020-01-16 19:11:29,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:29,857 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1275 transitions. [2020-01-16 19:11:29,857 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1275 transitions. [2020-01-16 19:11:29,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:29,857 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:29,857 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:29,857 INFO L426 AbstractCegarLoop]: === Iteration 1904 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:29,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:29,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2129783876, now seen corresponding path program 1898 times [2020-01-16 19:11:29,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:29,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200954809] [2020-01-16 19:11:29,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:30,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-01-16 19:11:30,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200954809] [2020-01-16 19:11:30,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:30,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:30,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651699685] [2020-01-16 19:11:30,134 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:30,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:30,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:30,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:30,135 INFO L87 Difference]: Start difference. First operand 376 states and 1275 transitions. Second operand 9 states. [2020-01-16 19:11:30,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:30,232 INFO L93 Difference]: Finished difference Result 580 states and 1716 transitions. [2020-01-16 19:11:30,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:30,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:30,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:30,234 INFO L225 Difference]: With dead ends: 580 [2020-01-16 19:11:30,234 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:11:30,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:11:30,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 374. [2020-01-16 19:11:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:11:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1270 transitions. [2020-01-16 19:11:30,244 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1270 transitions. Word has length 22 [2020-01-16 19:11:30,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:30,244 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1270 transitions. [2020-01-16 19:11:30,244 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1270 transitions. [2020-01-16 19:11:30,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:30,244 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:30,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, 1, 1, 1] [2020-01-16 19:11:30,245 INFO L426 AbstractCegarLoop]: === Iteration 1905 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:30,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:30,245 INFO L82 PathProgramCache]: Analyzing trace with hash -287860068, now seen corresponding path program 1899 times [2020-01-16 19:11:30,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:30,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541929947] [2020-01-16 19:11:30,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:30,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541929947] [2020-01-16 19:11:30,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:30,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:30,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967840045] [2020-01-16 19:11:30,517 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:30,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:30,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:30,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:30,517 INFO L87 Difference]: Start difference. First operand 374 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:11:30,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:30,616 INFO L93 Difference]: Finished difference Result 584 states and 1725 transitions. [2020-01-16 19:11:30,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:30,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:30,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:30,617 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:11:30,618 INFO L226 Difference]: Without dead ends: 573 [2020-01-16 19:11:30,618 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-01-16 19:11:30,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 377. [2020-01-16 19:11:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:11:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1275 transitions. [2020-01-16 19:11:30,627 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1275 transitions. Word has length 22 [2020-01-16 19:11:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:30,627 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1275 transitions. [2020-01-16 19:11:30,627 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1275 transitions. [2020-01-16 19:11:30,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:30,627 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:30,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:30,627 INFO L426 AbstractCegarLoop]: === Iteration 1906 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:30,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:30,628 INFO L82 PathProgramCache]: Analyzing trace with hash -2116258228, now seen corresponding path program 1900 times [2020-01-16 19:11:30,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:30,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385898751] [2020-01-16 19:11:30,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:30,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:30,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385898751] [2020-01-16 19:11:30,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:30,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:30,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376171755] [2020-01-16 19:11:30,900 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:30,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:30,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:30,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:30,901 INFO L87 Difference]: Start difference. First operand 377 states and 1275 transitions. Second operand 9 states. [2020-01-16 19:11:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:31,005 INFO L93 Difference]: Finished difference Result 585 states and 1724 transitions. [2020-01-16 19:11:31,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:31,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:31,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:31,007 INFO L225 Difference]: With dead ends: 585 [2020-01-16 19:11:31,007 INFO L226 Difference]: Without dead ends: 570 [2020-01-16 19:11:31,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:31,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-01-16 19:11:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 374. [2020-01-16 19:11:31,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:11:31,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1268 transitions. [2020-01-16 19:11:31,015 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1268 transitions. Word has length 22 [2020-01-16 19:11:31,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:31,015 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1268 transitions. [2020-01-16 19:11:31,015 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:31,015 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1268 transitions. [2020-01-16 19:11:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:31,016 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:31,016 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:31,016 INFO L426 AbstractCegarLoop]: === Iteration 1907 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:31,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:31,016 INFO L82 PathProgramCache]: Analyzing trace with hash -19012660, now seen corresponding path program 1901 times [2020-01-16 19:11:31,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:31,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469416191] [2020-01-16 19:11:31,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:31,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-01-16 19:11:31,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469416191] [2020-01-16 19:11:31,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:31,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:31,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216535140] [2020-01-16 19:11:31,285 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:31,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:31,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:31,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:31,286 INFO L87 Difference]: Start difference. First operand 374 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:11:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:31,382 INFO L93 Difference]: Finished difference Result 581 states and 1716 transitions. [2020-01-16 19:11:31,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:31,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:31,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:31,384 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:11:31,384 INFO L226 Difference]: Without dead ends: 571 [2020-01-16 19:11:31,384 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:31,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-01-16 19:11:31,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 376. [2020-01-16 19:11:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:11:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1271 transitions. [2020-01-16 19:11:31,394 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1271 transitions. Word has length 22 [2020-01-16 19:11:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:31,394 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1271 transitions. [2020-01-16 19:11:31,394 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1271 transitions. [2020-01-16 19:11:31,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:31,394 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:31,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:31,394 INFO L426 AbstractCegarLoop]: === Iteration 1908 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:31,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:31,395 INFO L82 PathProgramCache]: Analyzing trace with hash -192260352, now seen corresponding path program 1902 times [2020-01-16 19:11:31,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:31,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186742843] [2020-01-16 19:11:31,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:31,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186742843] [2020-01-16 19:11:31,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:31,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:31,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810579196] [2020-01-16 19:11:31,666 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:31,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:31,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:31,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:31,667 INFO L87 Difference]: Start difference. First operand 376 states and 1271 transitions. Second operand 9 states. [2020-01-16 19:11:31,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:31,769 INFO L93 Difference]: Finished difference Result 583 states and 1718 transitions. [2020-01-16 19:11:31,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:31,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:31,771 INFO L225 Difference]: With dead ends: 583 [2020-01-16 19:11:31,771 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 19:11:31,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:31,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 19:11:31,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 372. [2020-01-16 19:11:31,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:11:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1263 transitions. [2020-01-16 19:11:31,780 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1263 transitions. Word has length 22 [2020-01-16 19:11:31,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:31,780 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1263 transitions. [2020-01-16 19:11:31,780 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:31,780 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1263 transitions. [2020-01-16 19:11:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:31,781 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:31,781 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:31,781 INFO L426 AbstractCegarLoop]: === Iteration 1909 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:31,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:31,781 INFO L82 PathProgramCache]: Analyzing trace with hash -812586766, now seen corresponding path program 1903 times [2020-01-16 19:11:31,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:31,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614243457] [2020-01-16 19:11:31,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:32,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-01-16 19:11:32,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614243457] [2020-01-16 19:11:32,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:32,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:32,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258375390] [2020-01-16 19:11:32,049 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:32,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:32,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:32,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:32,050 INFO L87 Difference]: Start difference. First operand 372 states and 1263 transitions. Second operand 9 states. [2020-01-16 19:11:32,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:32,150 INFO L93 Difference]: Finished difference Result 578 states and 1708 transitions. [2020-01-16 19:11:32,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:32,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:32,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:32,152 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:11:32,152 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 19:11:32,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:32,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 19:11:32,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 376. [2020-01-16 19:11:32,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:11:32,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1273 transitions. [2020-01-16 19:11:32,163 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1273 transitions. Word has length 22 [2020-01-16 19:11:32,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:32,163 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1273 transitions. [2020-01-16 19:11:32,164 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:32,164 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1273 transitions. [2020-01-16 19:11:32,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:32,164 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:32,164 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:32,164 INFO L426 AbstractCegarLoop]: === Iteration 1910 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:32,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:32,164 INFO L82 PathProgramCache]: Analyzing trace with hash 529346022, now seen corresponding path program 1904 times [2020-01-16 19:11:32,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:32,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000788815] [2020-01-16 19:11:32,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:32,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000788815] [2020-01-16 19:11:32,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:32,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:32,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571034003] [2020-01-16 19:11:32,433 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:32,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:32,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:32,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:32,433 INFO L87 Difference]: Start difference. First operand 376 states and 1273 transitions. Second operand 9 states. [2020-01-16 19:11:32,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:32,541 INFO L93 Difference]: Finished difference Result 577 states and 1704 transitions. [2020-01-16 19:11:32,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:32,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:32,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:32,543 INFO L225 Difference]: With dead ends: 577 [2020-01-16 19:11:32,543 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:11:32,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:32,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:11:32,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 374. [2020-01-16 19:11:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:11:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1268 transitions. [2020-01-16 19:11:32,552 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1268 transitions. Word has length 22 [2020-01-16 19:11:32,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:32,553 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1268 transitions. [2020-01-16 19:11:32,553 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1268 transitions. [2020-01-16 19:11:32,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:32,553 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:32,553 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:32,553 INFO L426 AbstractCegarLoop]: === Iteration 1911 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:32,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:32,554 INFO L82 PathProgramCache]: Analyzing trace with hash -277356964, now seen corresponding path program 1905 times [2020-01-16 19:11:32,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:32,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330870257] [2020-01-16 19:11:32,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:32,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330870257] [2020-01-16 19:11:32,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:32,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:32,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995397701] [2020-01-16 19:11:32,823 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:32,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:32,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:32,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:32,824 INFO L87 Difference]: Start difference. First operand 374 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:11:32,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:32,925 INFO L93 Difference]: Finished difference Result 579 states and 1710 transitions. [2020-01-16 19:11:32,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:32,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:32,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:32,927 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:11:32,927 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:11:32,927 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:32,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:11:32,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 377. [2020-01-16 19:11:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:11:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1273 transitions. [2020-01-16 19:11:32,935 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1273 transitions. Word has length 22 [2020-01-16 19:11:32,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:32,935 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1273 transitions. [2020-01-16 19:11:32,935 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1273 transitions. [2020-01-16 19:11:32,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:32,936 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:32,936 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:32,936 INFO L426 AbstractCegarLoop]: === Iteration 1912 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:32,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:32,936 INFO L82 PathProgramCache]: Analyzing trace with hash -505745972, now seen corresponding path program 1906 times [2020-01-16 19:11:32,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:32,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331207986] [2020-01-16 19:11:32,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:33,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331207986] [2020-01-16 19:11:33,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:33,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:33,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251890537] [2020-01-16 19:11:33,204 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:33,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:33,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:33,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:33,204 INFO L87 Difference]: Start difference. First operand 377 states and 1273 transitions. Second operand 9 states. [2020-01-16 19:11:33,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:33,306 INFO L93 Difference]: Finished difference Result 572 states and 1703 transitions. [2020-01-16 19:11:33,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:33,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:33,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:33,307 INFO L225 Difference]: With dead ends: 572 [2020-01-16 19:11:33,307 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:11:33,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:33,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:11:33,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 374. [2020-01-16 19:11:33,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:11:33,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1266 transitions. [2020-01-16 19:11:33,317 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1266 transitions. Word has length 22 [2020-01-16 19:11:33,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:33,317 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1266 transitions. [2020-01-16 19:11:33,317 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:33,317 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1266 transitions. [2020-01-16 19:11:33,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:33,318 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:33,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, 1, 1, 1] [2020-01-16 19:11:33,318 INFO L426 AbstractCegarLoop]: === Iteration 1913 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:33,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:33,318 INFO L82 PathProgramCache]: Analyzing trace with hash -8509556, now seen corresponding path program 1907 times [2020-01-16 19:11:33,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:33,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875242043] [2020-01-16 19:11:33,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:33,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-01-16 19:11:33,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875242043] [2020-01-16 19:11:33,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:33,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:33,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867776655] [2020-01-16 19:11:33,583 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:33,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:33,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:33,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:33,584 INFO L87 Difference]: Start difference. First operand 374 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:11:33,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:33,680 INFO L93 Difference]: Finished difference Result 577 states and 1703 transitions. [2020-01-16 19:11:33,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:33,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:33,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:33,682 INFO L225 Difference]: With dead ends: 577 [2020-01-16 19:11:33,682 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 19:11:33,682 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:33,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 19:11:33,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 376. [2020-01-16 19:11:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:11:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1269 transitions. [2020-01-16 19:11:33,691 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1269 transitions. Word has length 22 [2020-01-16 19:11:33,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:33,691 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1269 transitions. [2020-01-16 19:11:33,691 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:33,691 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1269 transitions. [2020-01-16 19:11:33,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:33,692 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:33,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, 1, 1, 1] [2020-01-16 19:11:33,692 INFO L426 AbstractCegarLoop]: === Iteration 1914 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:33,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:33,692 INFO L82 PathProgramCache]: Analyzing trace with hash 562945250, now seen corresponding path program 1908 times [2020-01-16 19:11:33,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:33,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042646439] [2020-01-16 19:11:33,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:33,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042646439] [2020-01-16 19:11:33,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:33,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:33,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874779833] [2020-01-16 19:11:33,967 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:33,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:33,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:33,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:33,968 INFO L87 Difference]: Start difference. First operand 376 states and 1269 transitions. Second operand 9 states. [2020-01-16 19:11:34,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:34,064 INFO L93 Difference]: Finished difference Result 571 states and 1699 transitions. [2020-01-16 19:11:34,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:34,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:34,066 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:11:34,066 INFO L226 Difference]: Without dead ends: 554 [2020-01-16 19:11:34,066 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:34,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-01-16 19:11:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 372. [2020-01-16 19:11:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:11:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1261 transitions. [2020-01-16 19:11:34,075 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1261 transitions. Word has length 22 [2020-01-16 19:11:34,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:34,075 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1261 transitions. [2020-01-16 19:11:34,075 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:34,075 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1261 transitions. [2020-01-16 19:11:34,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:34,076 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:34,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, 1, 1, 1] [2020-01-16 19:11:34,076 INFO L426 AbstractCegarLoop]: === Iteration 1915 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:34,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:34,076 INFO L82 PathProgramCache]: Analyzing trace with hash -875605390, now seen corresponding path program 1909 times [2020-01-16 19:11:34,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:34,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006869765] [2020-01-16 19:11:34,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:34,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006869765] [2020-01-16 19:11:34,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:34,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:34,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577562460] [2020-01-16 19:11:34,345 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:34,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:34,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:34,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:34,345 INFO L87 Difference]: Start difference. First operand 372 states and 1261 transitions. Second operand 9 states. [2020-01-16 19:11:34,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:34,442 INFO L93 Difference]: Finished difference Result 583 states and 1722 transitions. [2020-01-16 19:11:34,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:34,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:34,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:34,444 INFO L225 Difference]: With dead ends: 583 [2020-01-16 19:11:34,444 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:11:34,444 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:34,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:11:34,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 378. [2020-01-16 19:11:34,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:11:34,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1277 transitions. [2020-01-16 19:11:34,452 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1277 transitions. Word has length 22 [2020-01-16 19:11:34,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:34,452 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1277 transitions. [2020-01-16 19:11:34,452 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:34,452 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1277 transitions. [2020-01-16 19:11:34,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:34,453 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:34,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, 1, 1, 1] [2020-01-16 19:11:34,453 INFO L426 AbstractCegarLoop]: === Iteration 1916 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:34,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:34,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1590963746, now seen corresponding path program 1910 times [2020-01-16 19:11:34,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:34,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648958120] [2020-01-16 19:11:34,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:34,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-01-16 19:11:34,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648958120] [2020-01-16 19:11:34,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:34,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:34,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945032506] [2020-01-16 19:11:34,723 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:34,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:34,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:34,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:34,724 INFO L87 Difference]: Start difference. First operand 378 states and 1277 transitions. Second operand 9 states. [2020-01-16 19:11:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:34,824 INFO L93 Difference]: Finished difference Result 584 states and 1721 transitions. [2020-01-16 19:11:34,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:34,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:34,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:34,825 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:11:34,825 INFO L226 Difference]: Without dead ends: 569 [2020-01-16 19:11:34,826 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:34,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-01-16 19:11:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 375. [2020-01-16 19:11:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:11:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1269 transitions. [2020-01-16 19:11:34,834 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1269 transitions. Word has length 22 [2020-01-16 19:11:34,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:34,834 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1269 transitions. [2020-01-16 19:11:34,834 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:34,834 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1269 transitions. [2020-01-16 19:11:34,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:34,835 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:34,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, 1, 1, 1] [2020-01-16 19:11:34,835 INFO L426 AbstractCegarLoop]: === Iteration 1917 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:34,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:34,835 INFO L82 PathProgramCache]: Analyzing trace with hash 735335568, now seen corresponding path program 1911 times [2020-01-16 19:11:34,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:34,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335095494] [2020-01-16 19:11:34,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:35,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335095494] [2020-01-16 19:11:35,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:35,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:35,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106838463] [2020-01-16 19:11:35,104 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:35,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:35,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:35,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:35,104 INFO L87 Difference]: Start difference. First operand 375 states and 1269 transitions. Second operand 9 states. [2020-01-16 19:11:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:35,204 INFO L93 Difference]: Finished difference Result 578 states and 1708 transitions. [2020-01-16 19:11:35,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:35,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:35,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:35,205 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:11:35,206 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 19:11:35,206 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:35,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 19:11:35,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 378. [2020-01-16 19:11:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:11:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1274 transitions. [2020-01-16 19:11:35,215 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1274 transitions. Word has length 22 [2020-01-16 19:11:35,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:35,215 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1274 transitions. [2020-01-16 19:11:35,215 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:35,215 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1274 transitions. [2020-01-16 19:11:35,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:35,216 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:35,216 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:35,216 INFO L426 AbstractCegarLoop]: === Iteration 1918 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:35,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:35,216 INFO L82 PathProgramCache]: Analyzing trace with hash 506946560, now seen corresponding path program 1912 times [2020-01-16 19:11:35,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:35,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577312454] [2020-01-16 19:11:35,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:35,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577312454] [2020-01-16 19:11:35,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:35,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:35,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518810382] [2020-01-16 19:11:35,483 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:35,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:35,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:35,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:35,483 INFO L87 Difference]: Start difference. First operand 378 states and 1274 transitions. Second operand 9 states. [2020-01-16 19:11:35,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:35,577 INFO L93 Difference]: Finished difference Result 571 states and 1701 transitions. [2020-01-16 19:11:35,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:35,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:35,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:35,579 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:11:35,579 INFO L226 Difference]: Without dead ends: 555 [2020-01-16 19:11:35,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:35,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-01-16 19:11:35,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 375. [2020-01-16 19:11:35,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:11:35,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1266 transitions. [2020-01-16 19:11:35,588 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1266 transitions. Word has length 22 [2020-01-16 19:11:35,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:35,588 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1266 transitions. [2020-01-16 19:11:35,588 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:35,588 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1266 transitions. [2020-01-16 19:11:35,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:35,589 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:35,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, 1, 1, 1] [2020-01-16 19:11:35,589 INFO L426 AbstractCegarLoop]: === Iteration 1919 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:35,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1194128206, now seen corresponding path program 1913 times [2020-01-16 19:11:35,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:35,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53064881] [2020-01-16 19:11:35,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:35,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:35,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53064881] [2020-01-16 19:11:35,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:35,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:35,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882081476] [2020-01-16 19:11:35,864 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:35,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:35,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:35,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:35,864 INFO L87 Difference]: Start difference. First operand 375 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:11:35,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:35,968 INFO L93 Difference]: Finished difference Result 571 states and 1702 transitions. [2020-01-16 19:11:35,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:35,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:35,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:35,970 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:11:35,970 INFO L226 Difference]: Without dead ends: 559 [2020-01-16 19:11:35,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:35,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-01-16 19:11:35,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 379. [2020-01-16 19:11:35,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:11:35,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1273 transitions. [2020-01-16 19:11:35,979 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1273 transitions. Word has length 22 [2020-01-16 19:11:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:35,979 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1273 transitions. [2020-01-16 19:11:35,979 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1273 transitions. [2020-01-16 19:11:35,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:35,980 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:35,980 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:35,980 INFO L426 AbstractCegarLoop]: === Iteration 1920 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:35,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:35,980 INFO L82 PathProgramCache]: Analyzing trace with hash -338821552, now seen corresponding path program 1914 times [2020-01-16 19:11:35,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:35,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344835051] [2020-01-16 19:11:35,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:36,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344835051] [2020-01-16 19:11:36,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:36,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:36,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738380973] [2020-01-16 19:11:36,248 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:36,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:36,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:36,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:36,249 INFO L87 Difference]: Start difference. First operand 379 states and 1273 transitions. Second operand 9 states. [2020-01-16 19:11:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:36,345 INFO L93 Difference]: Finished difference Result 558 states and 1683 transitions. [2020-01-16 19:11:36,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:36,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:36,347 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:11:36,347 INFO L226 Difference]: Without dead ends: 538 [2020-01-16 19:11:36,347 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:36,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-01-16 19:11:36,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 372. [2020-01-16 19:11:36,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:11:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1259 transitions. [2020-01-16 19:11:36,356 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1259 transitions. Word has length 22 [2020-01-16 19:11:36,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:36,356 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1259 transitions. [2020-01-16 19:11:36,356 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:36,356 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1259 transitions. [2020-01-16 19:11:36,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:36,356 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:36,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, 1, 1, 1] [2020-01-16 19:11:36,356 INFO L426 AbstractCegarLoop]: === Iteration 1921 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:36,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:36,357 INFO L82 PathProgramCache]: Analyzing trace with hash 487333606, now seen corresponding path program 1915 times [2020-01-16 19:11:36,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:36,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110592] [2020-01-16 19:11:36,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:36,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110592] [2020-01-16 19:11:36,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:36,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:36,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49177948] [2020-01-16 19:11:36,623 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:36,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:36,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:36,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:36,623 INFO L87 Difference]: Start difference. First operand 372 states and 1259 transitions. Second operand 9 states. [2020-01-16 19:11:36,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:36,719 INFO L93 Difference]: Finished difference Result 578 states and 1706 transitions. [2020-01-16 19:11:36,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:36,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:36,721 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:11:36,721 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:11:36,721 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:36,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:11:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 376. [2020-01-16 19:11:36,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:11:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1269 transitions. [2020-01-16 19:11:36,730 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1269 transitions. Word has length 22 [2020-01-16 19:11:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:36,730 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1269 transitions. [2020-01-16 19:11:36,730 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1269 transitions. [2020-01-16 19:11:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:36,731 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:36,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, 1, 1, 1] [2020-01-16 19:11:36,731 INFO L426 AbstractCegarLoop]: === Iteration 1922 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:36,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:36,731 INFO L82 PathProgramCache]: Analyzing trace with hash 314085914, now seen corresponding path program 1916 times [2020-01-16 19:11:36,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:36,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35124243] [2020-01-16 19:11:36,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:36,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-01-16 19:11:36,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35124243] [2020-01-16 19:11:36,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:36,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:36,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548467348] [2020-01-16 19:11:36,995 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:36,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:36,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:36,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:36,996 INFO L87 Difference]: Start difference. First operand 376 states and 1269 transitions. Second operand 9 states. [2020-01-16 19:11:37,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:37,091 INFO L93 Difference]: Finished difference Result 580 states and 1708 transitions. [2020-01-16 19:11:37,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:37,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:37,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:37,093 INFO L225 Difference]: With dead ends: 580 [2020-01-16 19:11:37,093 INFO L226 Difference]: Without dead ends: 566 [2020-01-16 19:11:37,093 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:37,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-01-16 19:11:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 374. [2020-01-16 19:11:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:11:37,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1264 transitions. [2020-01-16 19:11:37,102 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1264 transitions. Word has length 22 [2020-01-16 19:11:37,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:37,102 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1264 transitions. [2020-01-16 19:11:37,102 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1264 transitions. [2020-01-16 19:11:37,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:37,103 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:37,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, 1, 1, 1] [2020-01-16 19:11:37,103 INFO L426 AbstractCegarLoop]: === Iteration 1923 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:37,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:37,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2098274564, now seen corresponding path program 1917 times [2020-01-16 19:11:37,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:37,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123350658] [2020-01-16 19:11:37,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:37,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123350658] [2020-01-16 19:11:37,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:37,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:37,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103929215] [2020-01-16 19:11:37,361 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:37,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:37,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:37,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:37,362 INFO L87 Difference]: Start difference. First operand 374 states and 1264 transitions. Second operand 9 states. [2020-01-16 19:11:37,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:37,460 INFO L93 Difference]: Finished difference Result 575 states and 1698 transitions. [2020-01-16 19:11:37,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:37,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:37,462 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:11:37,462 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:11:37,462 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:37,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:11:37,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 376. [2020-01-16 19:11:37,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:11:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1267 transitions. [2020-01-16 19:11:37,472 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1267 transitions. Word has length 22 [2020-01-16 19:11:37,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:37,472 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1267 transitions. [2020-01-16 19:11:37,472 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1267 transitions. [2020-01-16 19:11:37,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:37,472 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:37,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, 1, 1, 1] [2020-01-16 19:11:37,473 INFO L426 AbstractCegarLoop]: === Iteration 1924 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:37,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:37,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1625237926, now seen corresponding path program 1918 times [2020-01-16 19:11:37,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:37,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467763676] [2020-01-16 19:11:37,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:37,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-01-16 19:11:37,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467763676] [2020-01-16 19:11:37,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:37,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:37,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849493000] [2020-01-16 19:11:37,737 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:37,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:37,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:37,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:37,738 INFO L87 Difference]: Start difference. First operand 376 states and 1267 transitions. Second operand 9 states. [2020-01-16 19:11:37,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:37,847 INFO L93 Difference]: Finished difference Result 569 states and 1694 transitions. [2020-01-16 19:11:37,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:37,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:37,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:37,849 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:11:37,849 INFO L226 Difference]: Without dead ends: 554 [2020-01-16 19:11:37,849 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:37,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-01-16 19:11:37,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 374. [2020-01-16 19:11:37,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:11:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1262 transitions. [2020-01-16 19:11:37,858 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1262 transitions. Word has length 22 [2020-01-16 19:11:37,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:37,858 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1262 transitions. [2020-01-16 19:11:37,858 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:37,859 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1262 transitions. [2020-01-16 19:11:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:37,859 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:37,859 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:37,859 INFO L426 AbstractCegarLoop]: === Iteration 1925 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:37,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:37,859 INFO L82 PathProgramCache]: Analyzing trace with hash 849315716, now seen corresponding path program 1919 times [2020-01-16 19:11:37,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:37,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210633899] [2020-01-16 19:11:37,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:38,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210633899] [2020-01-16 19:11:38,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:38,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:38,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708801108] [2020-01-16 19:11:38,128 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:38,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:38,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:38,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:38,128 INFO L87 Difference]: Start difference. First operand 374 states and 1262 transitions. Second operand 9 states. [2020-01-16 19:11:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:38,234 INFO L93 Difference]: Finished difference Result 570 states and 1698 transitions. [2020-01-16 19:11:38,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:38,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:38,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:38,236 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:11:38,236 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:11:38,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:38,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:11:38,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 378. [2020-01-16 19:11:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:11:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1269 transitions. [2020-01-16 19:11:38,245 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1269 transitions. Word has length 22 [2020-01-16 19:11:38,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:38,245 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1269 transitions. [2020-01-16 19:11:38,245 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1269 transitions. [2020-01-16 19:11:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:38,246 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:38,246 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:38,246 INFO L426 AbstractCegarLoop]: === Iteration 1926 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:38,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:38,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1594018214, now seen corresponding path program 1920 times [2020-01-16 19:11:38,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:38,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640038382] [2020-01-16 19:11:38,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:38,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-01-16 19:11:38,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640038382] [2020-01-16 19:11:38,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:38,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:38,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447909595] [2020-01-16 19:11:38,510 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:38,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:38,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:38,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:38,510 INFO L87 Difference]: Start difference. First operand 378 states and 1269 transitions. Second operand 9 states. [2020-01-16 19:11:38,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:38,605 INFO L93 Difference]: Finished difference Result 557 states and 1679 transitions. [2020-01-16 19:11:38,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:38,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:38,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:38,607 INFO L225 Difference]: With dead ends: 557 [2020-01-16 19:11:38,607 INFO L226 Difference]: Without dead ends: 533 [2020-01-16 19:11:38,607 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:38,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-01-16 19:11:38,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 367. [2020-01-16 19:11:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2020-01-16 19:11:38,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1250 transitions. [2020-01-16 19:11:38,616 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1250 transitions. Word has length 22 [2020-01-16 19:11:38,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:38,617 INFO L478 AbstractCegarLoop]: Abstraction has 367 states and 1250 transitions. [2020-01-16 19:11:38,617 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:38,617 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1250 transitions. [2020-01-16 19:11:38,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:38,617 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:38,617 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:38,617 INFO L426 AbstractCegarLoop]: === Iteration 1927 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:38,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:38,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1001171860, now seen corresponding path program 1921 times [2020-01-16 19:11:38,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:38,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157164580] [2020-01-16 19:11:38,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:38,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-01-16 19:11:38,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157164580] [2020-01-16 19:11:38,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:38,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:38,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573210861] [2020-01-16 19:11:38,884 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:38,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:38,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:38,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:38,884 INFO L87 Difference]: Start difference. First operand 367 states and 1250 transitions. Second operand 9 states. [2020-01-16 19:11:38,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:38,967 INFO L93 Difference]: Finished difference Result 574 states and 1668 transitions. [2020-01-16 19:11:38,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:38,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:38,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:38,968 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:11:38,969 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:11:38,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:38,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:11:38,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 375. [2020-01-16 19:11:38,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:11:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1276 transitions. [2020-01-16 19:11:38,978 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1276 transitions. Word has length 22 [2020-01-16 19:11:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:38,978 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1276 transitions. [2020-01-16 19:11:38,978 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1276 transitions. [2020-01-16 19:11:38,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:38,978 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:38,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, 1, 1, 1] [2020-01-16 19:11:38,979 INFO L426 AbstractCegarLoop]: === Iteration 1928 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:38,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:38,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1562240352, now seen corresponding path program 1922 times [2020-01-16 19:11:38,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:38,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542326996] [2020-01-16 19:11:38,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:39,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:39,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542326996] [2020-01-16 19:11:39,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:39,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:39,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757895378] [2020-01-16 19:11:39,243 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:39,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:39,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:39,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:39,244 INFO L87 Difference]: Start difference. First operand 375 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:11:39,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:39,316 INFO L93 Difference]: Finished difference Result 567 states and 1653 transitions. [2020-01-16 19:11:39,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:39,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:39,318 INFO L225 Difference]: With dead ends: 567 [2020-01-16 19:11:39,318 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:11:39,318 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:39,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:11:39,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 373. [2020-01-16 19:11:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:11:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1272 transitions. [2020-01-16 19:11:39,327 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1272 transitions. Word has length 22 [2020-01-16 19:11:39,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:39,327 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1272 transitions. [2020-01-16 19:11:39,327 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1272 transitions. [2020-01-16 19:11:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:39,328 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:39,328 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:39,328 INFO L426 AbstractCegarLoop]: === Iteration 1929 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:39,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:39,328 INFO L82 PathProgramCache]: Analyzing trace with hash -599265994, now seen corresponding path program 1923 times [2020-01-16 19:11:39,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:39,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054153235] [2020-01-16 19:11:39,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:39,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-01-16 19:11:39,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054153235] [2020-01-16 19:11:39,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:39,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:39,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498951475] [2020-01-16 19:11:39,599 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:39,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:39,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:39,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:39,600 INFO L87 Difference]: Start difference. First operand 373 states and 1272 transitions. Second operand 9 states. [2020-01-16 19:11:39,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:39,682 INFO L93 Difference]: Finished difference Result 576 states and 1671 transitions. [2020-01-16 19:11:39,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:39,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:39,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:39,684 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:11:39,684 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:11:39,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:39,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:11:39,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 376. [2020-01-16 19:11:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:11:39,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1276 transitions. [2020-01-16 19:11:39,693 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1276 transitions. Word has length 22 [2020-01-16 19:11:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:39,693 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1276 transitions. [2020-01-16 19:11:39,693 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1276 transitions. [2020-01-16 19:11:39,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:39,694 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:39,694 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:39,694 INFO L426 AbstractCegarLoop]: === Iteration 1930 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:39,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:39,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1561469656, now seen corresponding path program 1924 times [2020-01-16 19:11:39,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:39,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486232139] [2020-01-16 19:11:39,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:39,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486232139] [2020-01-16 19:11:39,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:39,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:39,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452445670] [2020-01-16 19:11:39,959 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:39,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:39,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:39,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:39,959 INFO L87 Difference]: Start difference. First operand 376 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:11:40,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:40,056 INFO L93 Difference]: Finished difference Result 570 states and 1657 transitions. [2020-01-16 19:11:40,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:40,056 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:40,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:40,058 INFO L225 Difference]: With dead ends: 570 [2020-01-16 19:11:40,058 INFO L226 Difference]: Without dead ends: 557 [2020-01-16 19:11:40,058 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:40,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-01-16 19:11:40,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 373. [2020-01-16 19:11:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:11:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-01-16 19:11:40,067 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-01-16 19:11:40,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:40,067 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-01-16 19:11:40,067 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:40,067 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-01-16 19:11:40,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:40,068 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:40,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, 1, 1, 1] [2020-01-16 19:11:40,068 INFO L426 AbstractCegarLoop]: === Iteration 1931 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:40,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:40,068 INFO L82 PathProgramCache]: Analyzing trace with hash -544543768, now seen corresponding path program 1925 times [2020-01-16 19:11:40,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:40,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174619984] [2020-01-16 19:11:40,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:40,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-01-16 19:11:40,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174619984] [2020-01-16 19:11:40,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:40,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:40,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397882960] [2020-01-16 19:11:40,353 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:40,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:40,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:40,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:40,353 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:11:40,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:40,425 INFO L93 Difference]: Finished difference Result 560 states and 1638 transitions. [2020-01-16 19:11:40,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:40,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:40,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:40,427 INFO L225 Difference]: With dead ends: 560 [2020-01-16 19:11:40,427 INFO L226 Difference]: Without dead ends: 551 [2020-01-16 19:11:40,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:40,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-01-16 19:11:40,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 374. [2020-01-16 19:11:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:11:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1271 transitions. [2020-01-16 19:11:40,436 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1271 transitions. Word has length 22 [2020-01-16 19:11:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:40,436 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1271 transitions. [2020-01-16 19:11:40,436 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1271 transitions. [2020-01-16 19:11:40,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:40,437 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:40,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, 1, 1, 1] [2020-01-16 19:11:40,437 INFO L426 AbstractCegarLoop]: === Iteration 1932 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:40,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:40,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1066397190, now seen corresponding path program 1926 times [2020-01-16 19:11:40,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:40,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768764545] [2020-01-16 19:11:40,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:40,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-01-16 19:11:40,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768764545] [2020-01-16 19:11:40,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:40,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:40,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125035905] [2020-01-16 19:11:40,717 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:40,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:40,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:40,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:40,718 INFO L87 Difference]: Start difference. First operand 374 states and 1271 transitions. Second operand 9 states. [2020-01-16 19:11:40,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:40,814 INFO L93 Difference]: Finished difference Result 561 states and 1639 transitions. [2020-01-16 19:11:40,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:40,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:40,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:40,816 INFO L225 Difference]: With dead ends: 561 [2020-01-16 19:11:40,816 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:11:40,816 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:40,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:11:40,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 371. [2020-01-16 19:11:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:11:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1266 transitions. [2020-01-16 19:11:40,824 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1266 transitions. Word has length 22 [2020-01-16 19:11:40,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:40,824 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1266 transitions. [2020-01-16 19:11:40,824 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1266 transitions. [2020-01-16 19:11:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:40,825 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:40,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, 1, 1, 1] [2020-01-16 19:11:40,825 INFO L426 AbstractCegarLoop]: === Iteration 1933 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:40,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:40,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1965098016, now seen corresponding path program 1927 times [2020-01-16 19:11:40,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:40,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351309255] [2020-01-16 19:11:40,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:41,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351309255] [2020-01-16 19:11:41,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:41,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:41,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201768586] [2020-01-16 19:11:41,095 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:41,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:41,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:41,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:41,095 INFO L87 Difference]: Start difference. First operand 371 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:11:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:41,164 INFO L93 Difference]: Finished difference Result 578 states and 1676 transitions. [2020-01-16 19:11:41,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:41,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:41,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:41,166 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:11:41,166 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:11:41,166 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:11:41,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 375. [2020-01-16 19:11:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:11:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1274 transitions. [2020-01-16 19:11:41,175 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1274 transitions. Word has length 22 [2020-01-16 19:11:41,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:41,175 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1274 transitions. [2020-01-16 19:11:41,175 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1274 transitions. [2020-01-16 19:11:41,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:41,176 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:41,176 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:41,176 INFO L426 AbstractCegarLoop]: === Iteration 1934 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:41,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:41,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1404029524, now seen corresponding path program 1928 times [2020-01-16 19:11:41,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:41,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366105066] [2020-01-16 19:11:41,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:41,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-01-16 19:11:41,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366105066] [2020-01-16 19:11:41,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:41,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:41,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481138720] [2020-01-16 19:11:41,464 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:41,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:41,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:41,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:41,464 INFO L87 Difference]: Start difference. First operand 375 states and 1274 transitions. Second operand 9 states. [2020-01-16 19:11:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:41,545 INFO L93 Difference]: Finished difference Result 571 states and 1661 transitions. [2020-01-16 19:11:41,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:41,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:41,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:41,547 INFO L225 Difference]: With dead ends: 571 [2020-01-16 19:11:41,547 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:11:41,547 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:41,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:11:41,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 373. [2020-01-16 19:11:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:11:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-01-16 19:11:41,556 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-01-16 19:11:41,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:41,556 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-01-16 19:11:41,556 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:41,556 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-01-16 19:11:41,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:41,556 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:41,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, 1, 1, 1] [2020-01-16 19:11:41,557 INFO L426 AbstractCegarLoop]: === Iteration 1935 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:41,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:41,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1742123958, now seen corresponding path program 1929 times [2020-01-16 19:11:41,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:41,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412986850] [2020-01-16 19:11:41,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:41,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:41,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412986850] [2020-01-16 19:11:41,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:41,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:41,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849962933] [2020-01-16 19:11:41,829 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:41,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:41,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:41,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:41,830 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:11:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:41,906 INFO L93 Difference]: Finished difference Result 584 states and 1689 transitions. [2020-01-16 19:11:41,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:41,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:41,907 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:11:41,907 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:11:41,908 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:41,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:11:41,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 378. [2020-01-16 19:11:41,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-01-16 19:11:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1278 transitions. [2020-01-16 19:11:41,916 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1278 transitions. Word has length 22 [2020-01-16 19:11:41,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:41,916 INFO L478 AbstractCegarLoop]: Abstraction has 378 states and 1278 transitions. [2020-01-16 19:11:41,916 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:41,916 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1278 transitions. [2020-01-16 19:11:41,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:41,917 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:41,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, 1, 1, 1] [2020-01-16 19:11:41,917 INFO L426 AbstractCegarLoop]: === Iteration 1936 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:41,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:41,917 INFO L82 PathProgramCache]: Analyzing trace with hash -530926680, now seen corresponding path program 1930 times [2020-01-16 19:11:41,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:41,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796347837] [2020-01-16 19:11:41,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:42,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796347837] [2020-01-16 19:11:42,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:42,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:42,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736967763] [2020-01-16 19:11:42,185 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:42,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:42,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:42,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:42,185 INFO L87 Difference]: Start difference. First operand 378 states and 1278 transitions. Second operand 9 states. [2020-01-16 19:11:42,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:42,282 INFO L93 Difference]: Finished difference Result 580 states and 1677 transitions. [2020-01-16 19:11:42,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:42,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:42,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:42,283 INFO L225 Difference]: With dead ends: 580 [2020-01-16 19:11:42,284 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:11:42,284 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:42,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:11:42,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 373. [2020-01-16 19:11:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:11:42,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-01-16 19:11:42,292 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-01-16 19:11:42,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:42,292 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-01-16 19:11:42,292 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:42,292 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-01-16 19:11:42,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:42,293 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:42,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, 1, 1, 1] [2020-01-16 19:11:42,293 INFO L426 AbstractCegarLoop]: === Iteration 1937 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:42,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:42,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1796846184, now seen corresponding path program 1931 times [2020-01-16 19:11:42,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:42,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255937221] [2020-01-16 19:11:42,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:42,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255937221] [2020-01-16 19:11:42,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:42,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:42,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704461609] [2020-01-16 19:11:42,569 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:42,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:42,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:42,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:42,569 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:11:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:42,649 INFO L93 Difference]: Finished difference Result 566 states and 1650 transitions. [2020-01-16 19:11:42,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:42,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:42,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:42,651 INFO L225 Difference]: With dead ends: 566 [2020-01-16 19:11:42,651 INFO L226 Difference]: Without dead ends: 557 [2020-01-16 19:11:42,651 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:42,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-01-16 19:11:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 374. [2020-01-16 19:11:42,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:11:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1269 transitions. [2020-01-16 19:11:42,659 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1269 transitions. Word has length 22 [2020-01-16 19:11:42,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:42,660 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1269 transitions. [2020-01-16 19:11:42,660 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1269 transitions. [2020-01-16 19:11:42,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:42,660 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:42,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:42,660 INFO L426 AbstractCegarLoop]: === Iteration 1938 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:42,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:42,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1962891310, now seen corresponding path program 1932 times [2020-01-16 19:11:42,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:42,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222976194] [2020-01-16 19:11:42,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:42,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222976194] [2020-01-16 19:11:42,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:42,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:42,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788159115] [2020-01-16 19:11:42,931 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:42,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:42,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:42,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:42,932 INFO L87 Difference]: Start difference. First operand 374 states and 1269 transitions. Second operand 9 states. [2020-01-16 19:11:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:43,026 INFO L93 Difference]: Finished difference Result 569 states and 1655 transitions. [2020-01-16 19:11:43,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:43,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:43,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:43,028 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:11:43,028 INFO L226 Difference]: Without dead ends: 554 [2020-01-16 19:11:43,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-01-16 19:11:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 371. [2020-01-16 19:11:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:11:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1264 transitions. [2020-01-16 19:11:43,037 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1264 transitions. Word has length 22 [2020-01-16 19:11:43,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:43,037 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1264 transitions. [2020-01-16 19:11:43,037 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1264 transitions. [2020-01-16 19:11:43,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:43,037 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:43,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, 1, 1, 1] [2020-01-16 19:11:43,038 INFO L426 AbstractCegarLoop]: === Iteration 1939 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:43,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:43,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1639501792, now seen corresponding path program 1933 times [2020-01-16 19:11:43,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:43,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682208835] [2020-01-16 19:11:43,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:43,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682208835] [2020-01-16 19:11:43,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:43,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:43,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796172350] [2020-01-16 19:11:43,305 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:43,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:43,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:43,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:43,305 INFO L87 Difference]: Start difference. First operand 371 states and 1264 transitions. Second operand 9 states. [2020-01-16 19:11:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:43,376 INFO L93 Difference]: Finished difference Result 584 states and 1691 transitions. [2020-01-16 19:11:43,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:43,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:43,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:43,378 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:11:43,378 INFO L226 Difference]: Without dead ends: 568 [2020-01-16 19:11:43,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-01-16 19:11:43,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 377. [2020-01-16 19:11:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:11:43,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1278 transitions. [2020-01-16 19:11:43,388 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1278 transitions. Word has length 22 [2020-01-16 19:11:43,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:43,388 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1278 transitions. [2020-01-16 19:11:43,388 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1278 transitions. [2020-01-16 19:11:43,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:43,389 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:43,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, 1, 1, 1] [2020-01-16 19:11:43,389 INFO L426 AbstractCegarLoop]: === Iteration 1940 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:43,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:43,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1693261842, now seen corresponding path program 1934 times [2020-01-16 19:11:43,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:43,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63882705] [2020-01-16 19:11:43,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:43,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63882705] [2020-01-16 19:11:43,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:43,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:43,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45269237] [2020-01-16 19:11:43,651 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:43,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:43,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:43,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:43,652 INFO L87 Difference]: Start difference. First operand 377 states and 1278 transitions. Second operand 9 states. [2020-01-16 19:11:43,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:43,743 INFO L93 Difference]: Finished difference Result 578 states and 1677 transitions. [2020-01-16 19:11:43,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:43,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:43,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:43,745 INFO L225 Difference]: With dead ends: 578 [2020-01-16 19:11:43,745 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:11:43,745 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:43,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:11:43,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 374. [2020-01-16 19:11:43,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:11:43,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1271 transitions. [2020-01-16 19:11:43,753 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1271 transitions. Word has length 22 [2020-01-16 19:11:43,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:43,753 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1271 transitions. [2020-01-16 19:11:43,753 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:43,754 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1271 transitions. [2020-01-16 19:11:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:43,754 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:43,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, 1, 1, 1] [2020-01-16 19:11:43,754 INFO L426 AbstractCegarLoop]: === Iteration 1941 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:43,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:43,754 INFO L82 PathProgramCache]: Analyzing trace with hash -626809260, now seen corresponding path program 1935 times [2020-01-16 19:11:43,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:43,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969719041] [2020-01-16 19:11:43,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:44,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969719041] [2020-01-16 19:11:44,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:44,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:44,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353918470] [2020-01-16 19:11:44,025 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:44,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:44,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:44,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:44,025 INFO L87 Difference]: Start difference. First operand 374 states and 1271 transitions. Second operand 9 states. [2020-01-16 19:11:44,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:44,099 INFO L93 Difference]: Finished difference Result 588 states and 1698 transitions. [2020-01-16 19:11:44,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:44,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:44,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:44,101 INFO L225 Difference]: With dead ends: 588 [2020-01-16 19:11:44,101 INFO L226 Difference]: Without dead ends: 572 [2020-01-16 19:11:44,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:44,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-01-16 19:11:44,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 379. [2020-01-16 19:11:44,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:11:44,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1279 transitions. [2020-01-16 19:11:44,110 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1279 transitions. Word has length 22 [2020-01-16 19:11:44,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:44,110 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1279 transitions. [2020-01-16 19:11:44,110 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1279 transitions. [2020-01-16 19:11:44,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:44,111 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:44,111 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:44,111 INFO L426 AbstractCegarLoop]: === Iteration 1942 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:44,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:44,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1395107398, now seen corresponding path program 1936 times [2020-01-16 19:11:44,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:44,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114787889] [2020-01-16 19:11:44,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:44,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-01-16 19:11:44,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114787889] [2020-01-16 19:11:44,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:44,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:44,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726720498] [2020-01-16 19:11:44,378 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:44,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:44,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:44,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:44,379 INFO L87 Difference]: Start difference. First operand 379 states and 1279 transitions. Second operand 9 states. [2020-01-16 19:11:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:44,484 INFO L93 Difference]: Finished difference Result 584 states and 1686 transitions. [2020-01-16 19:11:44,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:44,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:44,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:44,486 INFO L225 Difference]: With dead ends: 584 [2020-01-16 19:11:44,486 INFO L226 Difference]: Without dead ends: 567 [2020-01-16 19:11:44,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-01-16 19:11:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 374. [2020-01-16 19:11:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:11:44,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1268 transitions. [2020-01-16 19:11:44,495 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1268 transitions. Word has length 22 [2020-01-16 19:11:44,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:44,495 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1268 transitions. [2020-01-16 19:11:44,495 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1268 transitions. [2020-01-16 19:11:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:44,496 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:44,496 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:44,496 INFO L426 AbstractCegarLoop]: === Iteration 1943 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:44,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:44,496 INFO L82 PathProgramCache]: Analyzing trace with hash 89769710, now seen corresponding path program 1937 times [2020-01-16 19:11:44,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:44,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374178100] [2020-01-16 19:11:44,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:44,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374178100] [2020-01-16 19:11:44,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:44,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:44,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404909145] [2020-01-16 19:11:44,763 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:44,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:44,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:44,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:44,763 INFO L87 Difference]: Start difference. First operand 374 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:11:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:44,872 INFO L93 Difference]: Finished difference Result 573 states and 1665 transitions. [2020-01-16 19:11:44,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:44,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:44,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:44,873 INFO L225 Difference]: With dead ends: 573 [2020-01-16 19:11:44,873 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:11:44,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:11:44,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 376. [2020-01-16 19:11:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:11:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1271 transitions. [2020-01-16 19:11:44,883 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1271 transitions. Word has length 22 [2020-01-16 19:11:44,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:44,883 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1271 transitions. [2020-01-16 19:11:44,883 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1271 transitions. [2020-01-16 19:11:44,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:44,884 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:44,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, 1, 1, 1] [2020-01-16 19:11:44,884 INFO L426 AbstractCegarLoop]: === Iteration 1944 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:44,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:44,884 INFO L82 PathProgramCache]: Analyzing trace with hash -83477982, now seen corresponding path program 1938 times [2020-01-16 19:11:44,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:44,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114109762] [2020-01-16 19:11:44,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:45,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-01-16 19:11:45,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114109762] [2020-01-16 19:11:45,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:45,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:45,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423666600] [2020-01-16 19:11:45,157 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:45,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:45,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:45,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:45,157 INFO L87 Difference]: Start difference. First operand 376 states and 1271 transitions. Second operand 9 states. [2020-01-16 19:11:45,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:45,259 INFO L93 Difference]: Finished difference Result 575 states and 1667 transitions. [2020-01-16 19:11:45,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:45,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:45,260 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:11:45,261 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:11:45,261 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:45,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:11:45,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 371. [2020-01-16 19:11:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:11:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1262 transitions. [2020-01-16 19:11:45,270 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1262 transitions. Word has length 22 [2020-01-16 19:11:45,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:45,270 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1262 transitions. [2020-01-16 19:11:45,270 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:45,270 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1262 transitions. [2020-01-16 19:11:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:45,271 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:45,271 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:45,271 INFO L426 AbstractCegarLoop]: === Iteration 1945 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:45,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:45,271 INFO L82 PathProgramCache]: Analyzing trace with hash -101644628, now seen corresponding path program 1939 times [2020-01-16 19:11:45,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:45,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043918223] [2020-01-16 19:11:45,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:45,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-01-16 19:11:45,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043918223] [2020-01-16 19:11:45,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:45,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:45,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777502846] [2020-01-16 19:11:45,557 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:45,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:45,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:45,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:45,557 INFO L87 Difference]: Start difference. First operand 371 states and 1262 transitions. Second operand 9 states. [2020-01-16 19:11:45,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:45,632 INFO L93 Difference]: Finished difference Result 553 states and 1622 transitions. [2020-01-16 19:11:45,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:45,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:45,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:45,633 INFO L225 Difference]: With dead ends: 553 [2020-01-16 19:11:45,634 INFO L226 Difference]: Without dead ends: 544 [2020-01-16 19:11:45,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:45,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-01-16 19:11:45,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 373. [2020-01-16 19:11:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:11:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-01-16 19:11:45,642 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-01-16 19:11:45,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:45,643 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-01-16 19:11:45,643 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:45,643 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-01-16 19:11:45,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:45,643 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:45,643 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:45,643 INFO L426 AbstractCegarLoop]: === Iteration 1946 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:45,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:45,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1509296330, now seen corresponding path program 1940 times [2020-01-16 19:11:45,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:45,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077326576] [2020-01-16 19:11:45,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:45,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:45,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077326576] [2020-01-16 19:11:45,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:45,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:45,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417498513] [2020-01-16 19:11:45,925 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:45,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:45,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:45,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:45,925 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:11:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:46,026 INFO L93 Difference]: Finished difference Result 554 states and 1623 transitions. [2020-01-16 19:11:46,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:46,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:46,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:46,028 INFO L225 Difference]: With dead ends: 554 [2020-01-16 19:11:46,028 INFO L226 Difference]: Without dead ends: 543 [2020-01-16 19:11:46,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-01-16 19:11:46,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 372. [2020-01-16 19:11:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:11:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1264 transitions. [2020-01-16 19:11:46,038 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1264 transitions. Word has length 22 [2020-01-16 19:11:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:46,038 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1264 transitions. [2020-01-16 19:11:46,038 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1264 transitions. [2020-01-16 19:11:46,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:46,038 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:46,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, 1, 1, 1] [2020-01-16 19:11:46,038 INFO L426 AbstractCegarLoop]: === Iteration 1947 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:46,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:46,039 INFO L82 PathProgramCache]: Analyzing trace with hash 911047904, now seen corresponding path program 1941 times [2020-01-16 19:11:46,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:46,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310270818] [2020-01-16 19:11:46,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:46,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-01-16 19:11:46,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310270818] [2020-01-16 19:11:46,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:46,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:46,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015075847] [2020-01-16 19:11:46,316 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:46,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:46,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:46,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:46,316 INFO L87 Difference]: Start difference. First operand 372 states and 1264 transitions. Second operand 9 states. [2020-01-16 19:11:46,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:46,391 INFO L93 Difference]: Finished difference Result 555 states and 1625 transitions. [2020-01-16 19:11:46,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:46,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:46,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:46,393 INFO L225 Difference]: With dead ends: 555 [2020-01-16 19:11:46,393 INFO L226 Difference]: Without dead ends: 546 [2020-01-16 19:11:46,393 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:46,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-01-16 19:11:46,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 373. [2020-01-16 19:11:46,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:11:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1265 transitions. [2020-01-16 19:11:46,402 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1265 transitions. Word has length 22 [2020-01-16 19:11:46,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:46,402 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1265 transitions. [2020-01-16 19:11:46,402 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1265 transitions. [2020-01-16 19:11:46,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:46,403 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:46,403 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:46,403 INFO L426 AbstractCegarLoop]: === Iteration 1948 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:46,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:46,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1446277706, now seen corresponding path program 1942 times [2020-01-16 19:11:46,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:46,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983394603] [2020-01-16 19:11:46,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:46,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-01-16 19:11:46,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983394603] [2020-01-16 19:11:46,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:46,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:46,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101909637] [2020-01-16 19:11:46,674 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:46,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:46,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:46,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:46,675 INFO L87 Difference]: Start difference. First operand 373 states and 1265 transitions. Second operand 9 states. [2020-01-16 19:11:46,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:46,774 INFO L93 Difference]: Finished difference Result 558 states and 1630 transitions. [2020-01-16 19:11:46,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:46,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:46,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:46,776 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:11:46,776 INFO L226 Difference]: Without dead ends: 545 [2020-01-16 19:11:46,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:46,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-01-16 19:11:46,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 372. [2020-01-16 19:11:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-01-16 19:11:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1263 transitions. [2020-01-16 19:11:46,784 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1263 transitions. Word has length 22 [2020-01-16 19:11:46,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:46,784 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 1263 transitions. [2020-01-16 19:11:46,784 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:46,784 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1263 transitions. [2020-01-16 19:11:46,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:46,785 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:46,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, 1, 1, 1] [2020-01-16 19:11:46,785 INFO L426 AbstractCegarLoop]: === Iteration 1949 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:46,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:46,785 INFO L82 PathProgramCache]: Analyzing trace with hash 921551008, now seen corresponding path program 1943 times [2020-01-16 19:11:46,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:46,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106314528] [2020-01-16 19:11:46,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:47,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106314528] [2020-01-16 19:11:47,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:47,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:47,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444329212] [2020-01-16 19:11:47,055 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:47,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:47,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:47,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:47,056 INFO L87 Difference]: Start difference. First operand 372 states and 1263 transitions. Second operand 9 states. [2020-01-16 19:11:47,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:47,153 INFO L93 Difference]: Finished difference Result 558 states and 1631 transitions. [2020-01-16 19:11:47,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:47,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:47,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:47,155 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:11:47,155 INFO L226 Difference]: Without dead ends: 548 [2020-01-16 19:11:47,155 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:47,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-01-16 19:11:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 374. [2020-01-16 19:11:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:11:47,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1266 transitions. [2020-01-16 19:11:47,163 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1266 transitions. Word has length 22 [2020-01-16 19:11:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:47,163 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1266 transitions. [2020-01-16 19:11:47,163 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1266 transitions. [2020-01-16 19:11:47,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:47,164 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:47,164 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:47,164 INFO L426 AbstractCegarLoop]: === Iteration 1950 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:47,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:47,164 INFO L82 PathProgramCache]: Analyzing trace with hash -154160148, now seen corresponding path program 1944 times [2020-01-16 19:11:47,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:47,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638916223] [2020-01-16 19:11:47,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:47,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638916223] [2020-01-16 19:11:47,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:47,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:47,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319657209] [2020-01-16 19:11:47,431 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:47,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:47,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:47,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:47,431 INFO L87 Difference]: Start difference. First operand 374 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:11:47,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:47,533 INFO L93 Difference]: Finished difference Result 560 states and 1633 transitions. [2020-01-16 19:11:47,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:47,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:47,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:47,535 INFO L225 Difference]: With dead ends: 560 [2020-01-16 19:11:47,535 INFO L226 Difference]: Without dead ends: 543 [2020-01-16 19:11:47,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:47,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-01-16 19:11:47,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 369. [2020-01-16 19:11:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-01-16 19:11:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1258 transitions. [2020-01-16 19:11:47,544 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 1258 transitions. Word has length 22 [2020-01-16 19:11:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:47,544 INFO L478 AbstractCegarLoop]: Abstraction has 369 states and 1258 transitions. [2020-01-16 19:11:47,544 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 1258 transitions. [2020-01-16 19:11:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:47,545 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:47,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, 1, 1, 1] [2020-01-16 19:11:47,545 INFO L426 AbstractCegarLoop]: === Iteration 1951 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:47,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:47,545 INFO L82 PathProgramCache]: Analyzing trace with hash 578686134, now seen corresponding path program 1945 times [2020-01-16 19:11:47,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:47,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669666653] [2020-01-16 19:11:47,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:47,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-01-16 19:11:47,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669666653] [2020-01-16 19:11:47,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:47,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:47,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34052789] [2020-01-16 19:11:47,806 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:47,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:47,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:47,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:47,806 INFO L87 Difference]: Start difference. First operand 369 states and 1258 transitions. Second operand 9 states. [2020-01-16 19:11:47,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:47,882 INFO L93 Difference]: Finished difference Result 572 states and 1657 transitions. [2020-01-16 19:11:47,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:47,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:47,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:47,883 INFO L225 Difference]: With dead ends: 572 [2020-01-16 19:11:47,883 INFO L226 Difference]: Without dead ends: 556 [2020-01-16 19:11:47,884 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:47,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-01-16 19:11:47,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 375. [2020-01-16 19:11:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:11:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1274 transitions. [2020-01-16 19:11:47,892 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1274 transitions. Word has length 22 [2020-01-16 19:11:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:47,892 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1274 transitions. [2020-01-16 19:11:47,892 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1274 transitions. [2020-01-16 19:11:47,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:47,893 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:47,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, 1, 1, 1] [2020-01-16 19:11:47,893 INFO L426 AbstractCegarLoop]: === Iteration 1952 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:47,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:47,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1139754626, now seen corresponding path program 1946 times [2020-01-16 19:11:47,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:47,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081350620] [2020-01-16 19:11:47,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:48,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081350620] [2020-01-16 19:11:48,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:48,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:48,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154937638] [2020-01-16 19:11:48,154 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:48,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:48,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:48,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:48,155 INFO L87 Difference]: Start difference. First operand 375 states and 1274 transitions. Second operand 9 states. [2020-01-16 19:11:48,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:48,231 INFO L93 Difference]: Finished difference Result 565 states and 1642 transitions. [2020-01-16 19:11:48,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:48,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:48,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:48,233 INFO L225 Difference]: With dead ends: 565 [2020-01-16 19:11:48,233 INFO L226 Difference]: Without dead ends: 554 [2020-01-16 19:11:48,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-01-16 19:11:48,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 373. [2020-01-16 19:11:48,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:11:48,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1270 transitions. [2020-01-16 19:11:48,242 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1270 transitions. Word has length 22 [2020-01-16 19:11:48,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:48,242 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1270 transitions. [2020-01-16 19:11:48,242 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:48,242 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1270 transitions. [2020-01-16 19:11:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:48,242 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11: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, 1, 1, 1] [2020-01-16 19:11:48,242 INFO L426 AbstractCegarLoop]: === Iteration 1953 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:48,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:48,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1021751720, now seen corresponding path program 1947 times [2020-01-16 19:11:48,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:48,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114872268] [2020-01-16 19:11:48,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:48,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114872268] [2020-01-16 19:11:48,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:48,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:48,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903759815] [2020-01-16 19:11:48,503 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:48,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:48,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:48,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:48,503 INFO L87 Difference]: Start difference. First operand 373 states and 1270 transitions. Second operand 9 states. [2020-01-16 19:11:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:48,578 INFO L93 Difference]: Finished difference Result 574 states and 1660 transitions. [2020-01-16 19:11:48,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:48,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:48,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:48,580 INFO L225 Difference]: With dead ends: 574 [2020-01-16 19:11:48,580 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:11:48,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:11:48,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 376. [2020-01-16 19:11:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-01-16 19:11:48,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1274 transitions. [2020-01-16 19:11:48,589 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1274 transitions. Word has length 22 [2020-01-16 19:11:48,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:48,590 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 1274 transitions. [2020-01-16 19:11:48,590 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:48,590 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1274 transitions. [2020-01-16 19:11:48,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:48,590 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:48,590 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:48,590 INFO L426 AbstractCegarLoop]: === Iteration 1954 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:48,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:48,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1983955382, now seen corresponding path program 1948 times [2020-01-16 19:11:48,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:48,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917604174] [2020-01-16 19:11:48,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:48,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-01-16 19:11:48,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917604174] [2020-01-16 19:11:48,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:48,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:48,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210523712] [2020-01-16 19:11:48,843 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:48,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:48,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:48,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:48,843 INFO L87 Difference]: Start difference. First operand 376 states and 1274 transitions. Second operand 9 states. [2020-01-16 19:11:48,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:48,967 INFO L93 Difference]: Finished difference Result 568 states and 1646 transitions. [2020-01-16 19:11:48,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:48,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:48,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:48,969 INFO L225 Difference]: With dead ends: 568 [2020-01-16 19:11:48,969 INFO L226 Difference]: Without dead ends: 555 [2020-01-16 19:11:48,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:48,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-01-16 19:11:48,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 373. [2020-01-16 19:11:48,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:11:48,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-01-16 19:11:48,978 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-01-16 19:11:48,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:48,978 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-01-16 19:11:48,978 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:48,978 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-01-16 19:11:48,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:48,979 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:48,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, 1, 1, 1] [2020-01-16 19:11:48,979 INFO L426 AbstractCegarLoop]: === Iteration 1955 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:48,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:48,979 INFO L82 PathProgramCache]: Analyzing trace with hash -967029494, now seen corresponding path program 1949 times [2020-01-16 19:11:48,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:48,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379629980] [2020-01-16 19:11:48,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:49,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:49,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379629980] [2020-01-16 19:11:49,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:49,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:49,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358756910] [2020-01-16 19:11:49,248 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:49,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:49,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:49,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:49,248 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:11:49,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:49,322 INFO L93 Difference]: Finished difference Result 558 states and 1627 transitions. [2020-01-16 19:11:49,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:49,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:49,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:49,324 INFO L225 Difference]: With dead ends: 558 [2020-01-16 19:11:49,324 INFO L226 Difference]: Without dead ends: 549 [2020-01-16 19:11:49,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:49,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-01-16 19:11:49,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 374. [2020-01-16 19:11:49,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:11:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1269 transitions. [2020-01-16 19:11:49,333 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1269 transitions. Word has length 22 [2020-01-16 19:11:49,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:49,333 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1269 transitions. [2020-01-16 19:11:49,333 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:49,334 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1269 transitions. [2020-01-16 19:11:49,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:49,334 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:49,334 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:49,334 INFO L426 AbstractCegarLoop]: === Iteration 1956 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:49,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:49,334 INFO L82 PathProgramCache]: Analyzing trace with hash 643911464, now seen corresponding path program 1950 times [2020-01-16 19:11:49,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:49,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387913334] [2020-01-16 19:11:49,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:49,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387913334] [2020-01-16 19:11:49,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:49,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:49,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550971530] [2020-01-16 19:11:49,607 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:49,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:49,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:49,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:49,608 INFO L87 Difference]: Start difference. First operand 374 states and 1269 transitions. Second operand 9 states. [2020-01-16 19:11:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:49,720 INFO L93 Difference]: Finished difference Result 559 states and 1628 transitions. [2020-01-16 19:11:49,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:49,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:49,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:49,722 INFO L225 Difference]: With dead ends: 559 [2020-01-16 19:11:49,722 INFO L226 Difference]: Without dead ends: 546 [2020-01-16 19:11:49,722 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-01-16 19:11:49,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 371. [2020-01-16 19:11:49,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:11:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1264 transitions. [2020-01-16 19:11:49,731 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1264 transitions. Word has length 22 [2020-01-16 19:11:49,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:49,731 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1264 transitions. [2020-01-16 19:11:49,731 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:49,731 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1264 transitions. [2020-01-16 19:11:49,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:49,732 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:49,732 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:49,732 INFO L426 AbstractCegarLoop]: === Iteration 1957 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:49,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:49,732 INFO L82 PathProgramCache]: Analyzing trace with hash -461549664, now seen corresponding path program 1951 times [2020-01-16 19:11:49,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:49,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093844024] [2020-01-16 19:11:49,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:49,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-01-16 19:11:49,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093844024] [2020-01-16 19:11:49,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:49,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:49,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955711964] [2020-01-16 19:11:49,992 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:49,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:49,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:49,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:49,992 INFO L87 Difference]: Start difference. First operand 371 states and 1264 transitions. Second operand 9 states. [2020-01-16 19:11:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:50,077 INFO L93 Difference]: Finished difference Result 576 states and 1666 transitions. [2020-01-16 19:11:50,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:50,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:50,079 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:11:50,079 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:11:50,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:11:50,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 375. [2020-01-16 19:11:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-01-16 19:11:50,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1272 transitions. [2020-01-16 19:11:50,089 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1272 transitions. Word has length 22 [2020-01-16 19:11:50,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:50,089 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 1272 transitions. [2020-01-16 19:11:50,089 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1272 transitions. [2020-01-16 19:11:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:50,090 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:50,090 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:50,090 INFO L426 AbstractCegarLoop]: === Iteration 1958 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:50,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:50,090 INFO L82 PathProgramCache]: Analyzing trace with hash 99518828, now seen corresponding path program 1952 times [2020-01-16 19:11:50,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:50,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547405367] [2020-01-16 19:11:50,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:50,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-01-16 19:11:50,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547405367] [2020-01-16 19:11:50,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:50,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:50,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430440178] [2020-01-16 19:11:50,352 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:50,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:50,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:50,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:50,352 INFO L87 Difference]: Start difference. First operand 375 states and 1272 transitions. Second operand 9 states. [2020-01-16 19:11:50,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:50,429 INFO L93 Difference]: Finished difference Result 569 states and 1651 transitions. [2020-01-16 19:11:50,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:50,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:50,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:50,431 INFO L225 Difference]: With dead ends: 569 [2020-01-16 19:11:50,431 INFO L226 Difference]: Without dead ends: 558 [2020-01-16 19:11:50,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:50,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-01-16 19:11:50,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 373. [2020-01-16 19:11:50,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:11:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1268 transitions. [2020-01-16 19:11:50,440 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1268 transitions. Word has length 22 [2020-01-16 19:11:50,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:50,440 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1268 transitions. [2020-01-16 19:11:50,440 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1268 transitions. [2020-01-16 19:11:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:50,441 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:50,441 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:50,441 INFO L426 AbstractCegarLoop]: === Iteration 1959 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:50,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:50,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1645234456, now seen corresponding path program 1953 times [2020-01-16 19:11:50,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:50,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091464057] [2020-01-16 19:11:50,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:50,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-01-16 19:11:50,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091464057] [2020-01-16 19:11:50,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:50,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:50,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609528859] [2020-01-16 19:11:50,706 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:50,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:50,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:50,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:50,707 INFO L87 Difference]: Start difference. First operand 373 states and 1268 transitions. Second operand 9 states. [2020-01-16 19:11:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:50,783 INFO L93 Difference]: Finished difference Result 576 states and 1670 transitions. [2020-01-16 19:11:50,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:50,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:50,785 INFO L225 Difference]: With dead ends: 576 [2020-01-16 19:11:50,785 INFO L226 Difference]: Without dead ends: 560 [2020-01-16 19:11:50,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:50,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-01-16 19:11:50,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 379. [2020-01-16 19:11:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-01-16 19:11:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1278 transitions. [2020-01-16 19:11:50,795 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1278 transitions. Word has length 22 [2020-01-16 19:11:50,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:50,795 INFO L478 AbstractCegarLoop]: Abstraction has 379 states and 1278 transitions. [2020-01-16 19:11:50,795 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1278 transitions. [2020-01-16 19:11:50,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:50,795 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:50,796 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:50,796 INFO L426 AbstractCegarLoop]: === Iteration 1960 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:50,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:50,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1838055148, now seen corresponding path program 1954 times [2020-01-16 19:11:50,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:50,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625459662] [2020-01-16 19:11:50,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:51,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-01-16 19:11:51,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625459662] [2020-01-16 19:11:51,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:51,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:51,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872963700] [2020-01-16 19:11:51,058 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:51,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:51,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:51,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:51,059 INFO L87 Difference]: Start difference. First operand 379 states and 1278 transitions. Second operand 9 states. [2020-01-16 19:11:51,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:51,155 INFO L93 Difference]: Finished difference Result 564 states and 1651 transitions. [2020-01-16 19:11:51,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:51,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:51,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:51,156 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:11:51,157 INFO L226 Difference]: Without dead ends: 545 [2020-01-16 19:11:51,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-01-16 19:11:51,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 373. [2020-01-16 19:11:51,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-01-16 19:11:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1266 transitions. [2020-01-16 19:11:51,165 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1266 transitions. Word has length 22 [2020-01-16 19:11:51,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:51,165 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 1266 transitions. [2020-01-16 19:11:51,165 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:51,165 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1266 transitions. [2020-01-16 19:11:51,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:51,166 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:51,166 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:51,166 INFO L426 AbstractCegarLoop]: === Iteration 1961 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:51,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:51,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1699956682, now seen corresponding path program 1955 times [2020-01-16 19:11:51,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:51,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196527700] [2020-01-16 19:11:51,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:51,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196527700] [2020-01-16 19:11:51,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:51,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:51,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019515362] [2020-01-16 19:11:51,433 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:51,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:51,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:51,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:51,433 INFO L87 Difference]: Start difference. First operand 373 states and 1266 transitions. Second operand 9 states. [2020-01-16 19:11:51,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:51,514 INFO L93 Difference]: Finished difference Result 564 states and 1641 transitions. [2020-01-16 19:11:51,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:51,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:51,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:51,516 INFO L225 Difference]: With dead ends: 564 [2020-01-16 19:11:51,516 INFO L226 Difference]: Without dead ends: 555 [2020-01-16 19:11:51,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:51,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-01-16 19:11:51,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 374. [2020-01-16 19:11:51,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:11:51,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1267 transitions. [2020-01-16 19:11:51,525 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1267 transitions. Word has length 22 [2020-01-16 19:11:51,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:51,525 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1267 transitions. [2020-01-16 19:11:51,525 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1267 transitions. [2020-01-16 19:11:51,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:51,526 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:51,526 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:51,526 INFO L426 AbstractCegarLoop]: === Iteration 1962 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:51,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:51,526 INFO L82 PathProgramCache]: Analyzing trace with hash -448839854, now seen corresponding path program 1956 times [2020-01-16 19:11:51,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:51,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11111235] [2020-01-16 19:11:51,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:51,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-01-16 19:11:51,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11111235] [2020-01-16 19:11:51,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:51,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:51,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962951485] [2020-01-16 19:11:51,787 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:51,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:51,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:51,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:51,788 INFO L87 Difference]: Start difference. First operand 374 states and 1267 transitions. Second operand 9 states. [2020-01-16 19:11:51,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:51,886 INFO L93 Difference]: Finished difference Result 559 states and 1640 transitions. [2020-01-16 19:11:51,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:51,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:51,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:51,887 INFO L225 Difference]: With dead ends: 559 [2020-01-16 19:11:51,887 INFO L226 Difference]: Without dead ends: 543 [2020-01-16 19:11:51,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-01-16 19:11:51,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 371. [2020-01-16 19:11:51,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-01-16 19:11:51,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1262 transitions. [2020-01-16 19:11:51,896 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1262 transitions. Word has length 22 [2020-01-16 19:11:51,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:51,897 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 1262 transitions. [2020-01-16 19:11:51,897 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:51,897 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1262 transitions. [2020-01-16 19:11:51,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:51,897 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:51,897 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:51,897 INFO L426 AbstractCegarLoop]: === Iteration 1963 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:51,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:51,898 INFO L82 PathProgramCache]: Analyzing trace with hash -135953440, now seen corresponding path program 1957 times [2020-01-16 19:11:51,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:51,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392627512] [2020-01-16 19:11:51,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:52,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392627512] [2020-01-16 19:11:52,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:52,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:52,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525388794] [2020-01-16 19:11:52,155 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:52,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:52,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:52,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:52,156 INFO L87 Difference]: Start difference. First operand 371 states and 1262 transitions. Second operand 9 states. [2020-01-16 19:11:52,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:52,232 INFO L93 Difference]: Finished difference Result 581 states and 1678 transitions. [2020-01-16 19:11:52,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:52,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:52,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:52,234 INFO L225 Difference]: With dead ends: 581 [2020-01-16 19:11:52,234 INFO L226 Difference]: Without dead ends: 565 [2020-01-16 19:11:52,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:52,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-01-16 19:11:52,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 377. [2020-01-16 19:11:52,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-01-16 19:11:52,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1276 transitions. [2020-01-16 19:11:52,243 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1276 transitions. Word has length 22 [2020-01-16 19:11:52,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:52,243 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 1276 transitions. [2020-01-16 19:11:52,243 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:52,243 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1276 transitions. [2020-01-16 19:11:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:52,244 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:52,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, 1, 1, 1] [2020-01-16 19:11:52,244 INFO L426 AbstractCegarLoop]: === Iteration 1964 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:52,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:52,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1098157102, now seen corresponding path program 1958 times [2020-01-16 19:11:52,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:52,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137056410] [2020-01-16 19:11:52,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:52,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:52,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137056410] [2020-01-16 19:11:52,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:52,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:52,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320566071] [2020-01-16 19:11:52,496 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:52,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:52,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:52,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:52,497 INFO L87 Difference]: Start difference. First operand 377 states and 1276 transitions. Second operand 9 states. [2020-01-16 19:11:52,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:52,608 INFO L93 Difference]: Finished difference Result 575 states and 1664 transitions. [2020-01-16 19:11:52,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:52,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:52,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:52,610 INFO L225 Difference]: With dead ends: 575 [2020-01-16 19:11:52,610 INFO L226 Difference]: Without dead ends: 562 [2020-01-16 19:11:52,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:52,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-01-16 19:11:52,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 374. [2020-01-16 19:11:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-01-16 19:11:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1269 transitions. [2020-01-16 19:11:52,619 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1269 transitions. Word has length 22 [2020-01-16 19:11:52,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:52,620 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 1269 transitions. [2020-01-16 19:11:52,620 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1269 transitions. [2020-01-16 19:11:52,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:52,620 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:52,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, 1, 1, 1] [2020-01-16 19:11:52,620 INFO L426 AbstractCegarLoop]: === Iteration 1965 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:52,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:52,620 INFO L82 PathProgramCache]: Analyzing trace with hash -723698762, now seen corresponding path program 1959 times [2020-01-16 19:11:52,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:52,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477164734] [2020-01-16 19:11:52,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:11:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:11:52,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477164734] [2020-01-16 19:11:52,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:11:52,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-01-16 19:11:52,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138241878] [2020-01-16 19:11:52,901 INFO L458 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-01-16 19:11:52,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:11:52,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-01-16 19:11:52,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:11:52,901 INFO L87 Difference]: Start difference. First operand 374 states and 1269 transitions. Second operand 9 states. [2020-01-16 19:11:52,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:11:52,978 INFO L93 Difference]: Finished difference Result 579 states and 1676 transitions. [2020-01-16 19:11:52,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-01-16 19:11:52,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-01-16 19:11:52,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:11:52,980 INFO L225 Difference]: With dead ends: 579 [2020-01-16 19:11:52,980 INFO L226 Difference]: Without dead ends: 563 [2020-01-16 19:11:52,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-01-16 19:11:52,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-01-16 19:11:52,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 380. [2020-01-16 19:11:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2020-01-16 19:11:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1279 transitions. [2020-01-16 19:11:52,988 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1279 transitions. Word has length 22 [2020-01-16 19:11:52,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:11:52,988 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 1279 transitions. [2020-01-16 19:11:52,988 INFO L479 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-01-16 19:11:52,988 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1279 transitions. [2020-01-16 19:11:52,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-01-16 19:11:52,988 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:11:52,989 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:11:52,989 INFO L426 AbstractCegarLoop]: === Iteration 1966 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 19:11:52,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:11:52,989 INFO L82 PathProgramCache]: Analyzing trace with hash -530878070, now seen corresponding path program 1960 times [2020-01-16 19:11:52,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:11:52,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992645504] [2020-01-16 19:11:52,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:11:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2020-01-16 19:11:53,006 WARN L209 SmtUtils]: Removed 5 from assertion stack [2020-01-16 19:11:53,007 WARN L543 AbstractCegarLoop]: Verification canceled [2020-01-16 19:11:53,009 WARN L227 ceAbstractionStarter]: Timeout [2020-01-16 19:11:53,010 INFO L202 PluginConnector]: Adding new model example_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.01 07:11:53 BasicIcfg [2020-01-16 19:11:53,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-01-16 19:11:53,011 INFO L168 Benchmark]: Toolchain (without parser) took 769195.99 ms. Allocated memory was 145.8 MB in the beginning and 947.9 MB in the end (delta: 802.2 MB). Free memory was 120.8 MB in the beginning and 818.1 MB in the end (delta: -697.3 MB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB. [2020-01-16 19:11:53,011 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.50 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-01-16 19:11:53,012 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.24 ms. Allocated memory is still 145.8 MB. Free memory was 120.6 MB in the beginning and 118.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-01-16 19:11:53,012 INFO L168 Benchmark]: Boogie Preprocessor took 24.40 ms. Allocated memory is still 145.8 MB. Free memory was 118.9 MB in the beginning and 117.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2020-01-16 19:11:53,012 INFO L168 Benchmark]: RCFGBuilder took 374.98 ms. Allocated memory is still 145.8 MB. Free memory was 117.8 MB in the beginning and 105.3 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2020-01-16 19:11:53,012 INFO L168 Benchmark]: TraceAbstraction took 768751.43 ms. Allocated memory was 145.8 MB in the beginning and 947.9 MB in the end (delta: 802.2 MB). Free memory was 104.9 MB in the beginning and 818.1 MB in the end (delta: -713.2 MB). Peak memory consumption was 89.0 MB. Max. memory is 7.1 GB. [2020-01-16 19:11:53,014 INFO L335 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.50 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 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 38.24 ms. Allocated memory is still 145.8 MB. Free memory was 120.6 MB in the beginning and 118.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.40 ms. Allocated memory is still 145.8 MB. Free memory was 118.9 MB in the beginning and 117.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 374.98 ms. Allocated memory is still 145.8 MB. Free memory was 117.8 MB in the beginning and 105.3 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 768751.43 ms. Allocated memory was 145.8 MB in the beginning and 947.9 MB in the end (delta: 802.2 MB). Free memory was 104.9 MB in the beginning and 818.1 MB in the end (delta: -713.2 MB). Peak memory consumption was 89.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.5s, 60 ProgramPointsBefore, 51 ProgramPointsAfterwards, 80 TransitionsBefore, 72 TransitionsAfterwards, 1260 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 336 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 357 CheckedPairsTotal, 8 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 23 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 8 for 1ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. Result: TIMEOUT, OverallTime: 768.5s, OverallIterations: 1966, TraceHistogramMax: 1, AutomataDifference: 207.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.8s, HoareTripleCheckerStatistics: 130995 SDtfs, 199895 SDslu, 316919 SDs, 0 SdLazy, 102325 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 89.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17649 GetRequests, 1971 SyntacticMatches, 0 SemanticMatches, 15678 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9795 ImplicationChecksByTransitivity, 596.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2316occurred 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: 18.3s AutomataMinimizationTime, 1965 MinimizatonAttempts, 386281 StatesRemovedByMinimization, 1959 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 529.1s InterpolantComputationTime, 43230 NumberOfCodeBlocks, 43230 NumberOfCodeBlocksAsserted, 1965 NumberOfCheckSat, 41265 ConstructedInterpolants, 0 QuantifiedInterpolants, 19913817 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1965 InterpolantComputations, 1965 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 could not prove your program: Timeout Completed graceful shutdown